A Game Approach to Determinize Timed Automata
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 with ε-transitions and invariants, tries to produce a language-equivalent deterministic timed automaton, otherwise a deterministic over-approximation. Our method subsumes two recent contributions: it is at once more general than the determinization procedure of  and more precise than the approximation algorithm of .
- 3.Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: Proceedings of the 5th IFAC Symposium on System Structure and Control (SSSC 1998), pp. 469–474. Elsevier Science, Amsterdam (1998)Google Scholar
- 5.Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? Research Report LSV-09-08, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2009, 32 pages (2009)Google Scholar
- 6.Bertrand, N., Stainer, A., Jéron, T., Krichen, M.: A game approach to determinize timed automata. Research Report 7381, INRIA (September 2010), http://hal.inria.fr/inria-00524830
- 7.Bouyer, P.: From Qualitative to Quantitative Analysis of Timed Systems. Mémoire d’habilitation, Université Paris 7, Paris, France (January 2009)Google Scholar
- 12.Manasa, L., Krishna, S.N.: Integer reset timed automata: Clock reduction and determinizability. CoRR arXiv:1001.1215v1 (2010)Google Scholar