Theoretical Computer Science
Journal of the ACM (JACM)
The Expressive Power of Clocks
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
CONCUR 2005 - Concurrency Theory
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
When Are Timed Automata Determinizable?
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A game approach to determinize timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Off-line test selection with test purposes for non-deterministic timed automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
A machine-independent characterization of timed languages
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
| Hi-index | 0.02 |
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. 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. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed Büchi automata accepting infinite timed words some of these problems are Π11-hard, hence highly undecidable (located beyond the arithmetical hierarchy).