N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. Research Report INRIA, No 7381, October 2010.
Download paper:
Adobe portable document (pdf)
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
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 subsumes two recent contributions: it is at once more general than the existing determinization procedure and more precise than the approximation algorithm. Moreover, we explain how to extend our method to deal with invariants and $\varepsilon$-transitions, and also consider other useful approximations: under-approximation, and combination of under- and over-approximations
Nathalie Bertrand http://www.irisa.fr/prive/nbertran/
Amélie Stainer http://www.irisa.fr/prive/amelie.stainer/
Thierry Jéron http://www.irisa.fr/prive/jeron
@TechReport{rr7381,
Author = {Bertrand, N. and Stainer, A. and Jéron, T. and Krichen, M.},
Title = {A game approach to determinize timed automata},
Number = {7381},
Institution = {INRIA},
Month = {October},
Year = {2010}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |