On Decision Problems for Timed Automata
Olivier Finkel · HAL (Le Centre pour la Communication Scientifique Directe) · 2005
We solve some decision problems for timed automata which were raised by Tripakis in [9] and by Asarin in [3]. 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.