%0 Conference Proceedings
%F BSJK11
%A Bertrand, N.
%A Stainer, A.
%A Jéron, T.
%A Krichen, M.
%T A game approach to determinize timed automata
%B 14th International Conference on Foundations of Software Science and Computation Structures (FOSSACS)
%V 6604
%P 245-259
%S LNCS
%I Springer
%C Saarbrücken, Germany
%X 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 epsilon-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 recent determinization procedure and more precise than the existing approximation algorithm
%U http://www.irisa.fr/vertecs/Publis/Ps/BSJK-fossacs11.pdf
%U http://dx.doi.org/10.1007/978-3-642-19805-2_17
%8 April
%D 2011