A game approach to determinize timed automata

Abstract : Timed automata are frequently used to model real-time systems. Their determinization is a key issue for several validation problems. However, not all timed automata can be determinized, and determinizability itself is undecidable. In this paper, we propose a game-based algorithm which, given a timed automaton, tries to produce a language-equivalent deterministic timed automaton, otherwise a deterministic over-approximation. Our method generalizes two recent contributions: the determinization procedure of Baier et al. (Proceedings of the 36th international colloquium on automata, languages and programming (ICALP'09), 2009) and the approximation algorithm of Krichen and Tripakis (Form Methods Syst Des 34(3):238–304, 2009). Moreover, we extend it to apply to timed automata with invariants and ε-transitions, and also consider other useful approximations: under-approximation, and combination of under- and over-approximations.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

Contributor : Nathalie Bertrand <>
Submitted on : Monday, January 12, 2015 - 6:01:02 PM
Last modification on : Thursday, March 7, 2019 - 11:37:14 AM
Long-term archiving on : Monday, April 13, 2015 - 11:15:35 AM


Publisher files allowed on an open archive



Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen. A game approach to determinize timed automata. Formal Methods in System Design, Springer Verlag, 2015, 46 (1), pp.42-80. ⟨10.1007/s10703-014-0220-1⟩. ⟨hal-01102472⟩



Record views


Files downloads