Skip to main content
SpringerLink
Log in

An Introduction to Timed Automata

  • Chapter
Control of Discrete-Event Systems

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 433))

Abstract

We introduce timed automata and show how they can be used for the specification of timed systems. We also present some syntactical extensions useful for modeling and in particular networks of timed automata. Then we present two techniques for the analysis of timed automata: the zone graph and the region graph. The former can be more efficient for reachability analysis and related problems but it is not always finite. In contrast, the latter is a finite graph and can be used for model-checking. We compare the properties fulfilled by finite automata and timed automata emphasizing their main differences: languages of timed automata are not closed under complementation and the inclusion of languages is undecidable for timed automata.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L., Bouyer, P., Burgueño, A., Larsen, K.G.: The power of reachability testing for timed automata. Theoretical Computer Science 300(1-3), 411–475 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Adams, S., Ouaknine, J., Worrell, J.B.: Undecidability of Universality for Timed Automata with Minimal Resources. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 25–37. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Alur, R., Dill, D.L.: Automata for Modeling Real-Time Systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  4. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Information and Computation 104(1), 2–34 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Alur, R., Fix, L., Henzinger, T.A.: A Determinizable Class of Timed Automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 1–13. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  7. Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1–24. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Asarin, E.: Challenges in timed languages from applied theory to basic theory. Bulletin of the European Association for Theoretical Computer Science 83, 106–120 (2004)

    MathSciNet  MATH  Google Scholar 

  9. Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When Are Timed Automata Determinizable? In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part II. LNCS, vol. 5556, pp. 43–54. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Behrmann, G., David, A., Larsen, K.G.: A Tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Bérard, B., Diekert, V., Gastin, P., Petit, A.: Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae 36, 145–182 (1998)

    MathSciNet  MATH  Google Scholar 

  12. Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods in System Design 24(3), 281–320 (2004)

    Article  MATH  Google Scholar 

  13. Bouyer, P., Haddad, S., Reynier, P.-A.: Undecidability results for timed automata with silent transitions. Fundamenta Informaticae 92(1-2), 1–25 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Bouyer, P., Chevalier, F.: On conciseness of extensions of timed automata. Journal of Automata, Languages and Combinatorics 10(4), 393–405 (2005)

    MathSciNet  MATH  Google Scholar 

  15. Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Formal Methods in System Design 1(4), 385–415 (1992)

    Article  MATH  Google Scholar 

  16. Finkel, O.: Undecidable problems about timed automata. CoRR, abs/0712.1363 (2007)

    Google Scholar 

  17. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111(2), 193–244 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  18. Laroussinie, F., Larsen, K.G.: CMC: a tool for compositional model-checking of real-time systems. In: Proc. IFIP Joint Int. Conf. Formal Description Techniques and Protocol Specification, Testing and Verification, Paris, France (1998)

    Google Scholar 

  19. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Transactions on Computational Logic 386(3), 169–187 (2007)

    MATH  Google Scholar 

  20. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proceedings of LICS, pp. 54–63. IEEE Computer Society Press (2004)

    Google Scholar 

  21. Sifakis, J., Yovine, S.: Compositional Specifications of Timed Systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 347–359. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  22. Suman, P.V., Pandya, P.K., Krishna, S.N., Manasa, L.: Timed Automata with Integer Resets: Language Inclusion and Expressiveness. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 78–92. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  23. Tripakis, S.: Folk theorems on the determinization and minimization of timed automata. In: Proc. FORMATS 2003. LNCS, vol. 2791, pp. 182–188. Springer (2004)

    Google Scholar 

  24. Yovine, S.: Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer 1(1-2), 123–133 (1997)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIP6, Université P. & M. Curie and CNRS, Paris, France

    Béatrice Bérard

Authors
  1. Béatrice Bérard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Béatrice Bérard .

Editor information

Editors and Affiliations

  1. , Department of Electrical, University of Cagliari, Piazza D'Armi, Cagliari, 09124, Italy

    Carla Seatzu

  2. , Department of Computer Science, University of Zaragoza, Calle María de Luna 1, Zaragoza, 50018, Spain

    Manuel Silva

  3. Centrum Wiskunde & Informatica, Amsterdam, 1090 GB, Netherlands

    Jan H. van Schuppen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Bérard, B. (2013). An Introduction to Timed Automata. In: Seatzu, C., Silva, M., van Schuppen, J. (eds) Control of Discrete-Event Systems. Lecture Notes in Control and Information Sciences, vol 433. Springer, London. https://doi.org/10.1007/978-1-4471-4276-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4276-8_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4275-1

  • Online ISBN: 978-1-4471-4276-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation