Advertisement

Formal Methods in System Design

, Volume 46, Issue 1, pp 42–80 | Cite as

A game approach to determinize timed automata

  • Nathalie Bertrand
  • Amélie StainerEmail author
  • Thierry Jéron
  • Moez Krichen
Article

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 \(\varepsilon \)-transitions, and also consider other useful approximations: under-approximation, and combination of under- and over-approximations.

Keywords

Determinization Timed automata Approximate determinization Game 

Notes

Acknowledgments

This work was partially funded by the TESTEC Project of the french research agency (ANR).

References

  1. 1.
    Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126(2):183–235CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Finkel O (2006) Undecidable problems about timed automata. In: Proceedings of the 4th international conference on formal modeling and analysis of timed systems (FORMATS’06) (Lecture Notes in Computer Science), vol 4202. Springer, pp. 187–199Google Scholar
  3. 3.
    Tripakis S (2006) Folk theorems on the determinization and minimization of timed automata. Inf Process Lett 99(6):222–226CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Asarin E, Maler O, Pnueli A, Sifakis J (1998) Controller synthesis for timed automata. In: Proceedings of the 5th IFAC symposium on system structure and control (SSSC’98). Elsevier Science, Amsterdam, pp. 469–474Google Scholar
  5. 5.
    Alur R, Fix L, Henzinger TA (1994) A determinizable class of timed automata. In: Proceedings of the 6th international conference on computer aided verification (CAV’94) (Lecture Notes in Computer Science), vol 818. Springer, New York, pp 1–13Google Scholar
  6. 6.
    Vijay SP, Pandya PK, Narayanan KS, Lakshmi M (2008) Timed automata with integer resets: language inclusion and expressiveness. In: Proceedings of the 6th international conference on formal modeling and analysis of timed systems (FORMATS’08) (Lecture Notes in Computer Science), vol 5215. Springer, pp. 78–92Google Scholar
  7. 7.
    Baier C, Bertrand N, Bouyer P, Brihaye T (2009) When are timed automata determinizable? In: Proceedings of the 36th international colloquium on automata, languages and programming (ICALP’09) (Lecture Notes in Computer Science), vol 5556. Springer, Rhodes, pp. 43–54Google Scholar
  8. 8.
    Krichen M, Tripakis S (2009) Conformance testing for real-time systems. Form Methods Syst Des 34(3):238–304CrossRefzbMATHGoogle Scholar
  9. 9.
    Bouyer P, Chevalier F, D’Souza D (2005) Fault diagnosis using timed automata. In: Proceedings of the 8th international conference on foundations of software science and computational structures (FOSSACS’05) (Lecture Notes in Computer Science), vol 3441. Springer, San Diego, pp. 219–233Google Scholar
  10. 10.
    Bertrand N, Jéron T, Stainer A, Krichen M (2012) Off-line test selection with test purposes for non-deterministic timed automata. Log Methods Comput Sci 8(4:8):1Google Scholar
  11. 11.
    Bertrand N, Stainer A, Jéron T, Krichen M (2011) A game approach to determinize timed automata. In: Proceedings of the 14th international conference on foundations of software science and computation structures (FOSSACS’11) (Lecture Notes in Computer Science), vol 6604. Springer, pp. 245–259.Google Scholar
  12. 12.
    Grädel E, Thomas W, Wilke T (2002) (eds) Automata, logics, and infinite games: a guide to current research (Lecture Notes in Computer Science), (vol 2500). Springer, BerlinGoogle Scholar
  13. 13.
    Bouyer P, Dufourd C, Fleury E, Petit A (2004) Updatable timed automata. Theor Comput Sci 321(2–3):291–345Google Scholar
  14. 14.
    Lakshmi M, Narayanan KS (2010) Integer reset timed automata: clock reduction and determinizability. CoRR arXiv:1001.1215v1
  15. 15.
    Bouyer P (2004) Forward analysis of updatable timed automata. Form Methods Syst Des 24(3):281–320CrossRefzbMATHGoogle Scholar
  16. 16.
    Bertrand N, Jéron T, Stainer A, Krichen M (2011) Off-line test selection with test purposes for non-deterministic timed automata. In: Proceedings of the 17th international conference on tools and algorithms for the construction and analysis of systems (TACAS’11) (Lecture Notes in Computer Science), vol 6605. Springer, pp. 96–111Google Scholar
  17. 17.
    Alur R, Henzinger TA, Kupferman O, Vardi MY (1998) Alternating refinement relations. In: Proceedings of the 9th international conference on concurrency theory (CONCUR’98) (Lecture Notes in Computer Science), vol 1466. Springer, New York, pp 163–178Google Scholar
  18. 18.
    David A, Larsen KG, Legay A, Nyman U, Wasowski A (2010) Timed i/o automata: a complete specification theory for real-time systems. In: Proceedings of the 13th ACM international conference on hybrid systems: computation and control (HSCC’10). ACM, pp. 91–100Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Nathalie Bertrand
    • 1
  • Amélie Stainer
    • 2
    Email author
  • Thierry Jéron
    • 1
  • Moez Krichen
    • 3
  1. 1.Inria Rennes Bretagne AtlantiqueRennesFrance
  2. 2.University of Rennes 1RennesFrance
  3. 3.National School of Engineers of SfaxSfaxTunisia

Personalised recommendations