Theoretical Computer Science
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
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
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
Undecidability of universality for timed automata with minimal resources
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Undecidable problems about timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
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
Regular set of representatives for time-constrained MSC graphs
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (event-clock timed automata, automata with integer resets), but some others were not. We prove for instance that strongly non-Zeno timed automata can be determinized. As a corollary of those constructions, we get for those classes the decidability of the universality and of the inclusion problems, and compute their complexities (the inclusion problem is for instance EXPSPACE-complete for strongly non-Zeno timed automata).