On Decision Problems for Timed Automata

Olivier Finkel (1)

1 ELM - Équipe de Logique Mathématique

We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular.

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]; Informatique et langage [cs.CL]

Olivier Finkel. On Decision Problems for Timed Automata. Bulletin- European Association for Theoretical Computer Science, 2005, 87, pp.185-190. ⟨hal-00111148⟩