A game approach to determinize timed automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Methods in System Design Year : 2015

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, 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.
Fichier principal
Vignette du fichier
BSJK-fmsd14.pdf (892.14 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01102472 , version 1 (12-01-2015)



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



Gmail Facebook X LinkedIn More