Skip to main content
SpringerLink
Log in

Model checking timed automata

  • Formal Models and Analysis
  • Chapter
  • First Online:
Book cover Lectures on Embedded Systems (EEF School 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1494))

Included in the following conference series:

Abstract

The theory of timed automata provides a formal framework to model and to verify the correct functioning of real-time systems. Among the different verification problems that have been investigated within this theory, the so-called reachability problem has been the most throughly studied. This problem is stated as follows. Given two states of the system, is there an execution starting at one of them that reaches the other? The first reason for studying such problem is that safety properties can expressed as the non-reachability of a set of states where the system is consider to show an incorrect or unsafe functioning. Second, the algorithms developed for analyzing other classes of properties are essentially based on the algorithms developed for solving the reachability question. In this paper we survey the different algorithms, data-structures and tools that have been proposed in the literature to solve this problem.

Currently visiting California PATH, University of California at Berkeley, Richmond Field Station Bldg. 452, 1301 S. 46th St, Richmond CA 94804.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J. E. Hopcroft and J. D. Ullman. The design and analysis of computer algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. A. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In Proc. 13th IEEE Real-Time Systems Symposium. IEEE Computer Society Press, 1992.

    Google Scholar 

  3. A. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In W.R. Cleaveland, editor, CONCUR 92: Theories of Concurrency, pages 340–354. Lecture Notes in Computer Science 630, Springer-Verlag, 1992.

    Google Scholar 

  4. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th Symp. on Logics in Computer Science, pages 414–425. IEEE Computer Society Press, 1990. See also “Model checking in dense real time”, Information and Computation, 104(1):2–34, 1993.

    Google Scholar 

  5. R. Alur and D. Dill. Automata for modeling real-time systems. In Proc. 17th ICALP, pages 322–335. Lecture Notes in Computer Science 443, Springer-Verlag, 1990. See also “A theory of timed automata”, Theoretical Computer Science, 126:183–235, 1994.

    Google Scholar 

  6. R. Alur and T. Henzinger. Logics and models of real-time: a survey. In Netherlands, June 1991. Lecture Notes in Computer Science 600, Springer-Verlag.

    Google Scholar 

  7. R. Alur, A. Itai, R. Kurshan, and M. Yannakakis. Timing verification by successive approximation. In Proc. 4th Workshop on Computer-Aided Verification. Lecture Notes in Computer Science 663, Springer-Verlag, 1992. Also in Information and Computation, 118(1):142–157, 1995.

    Google Scholar 

  8. R. Alur and R.P. Kurshan. Timing analysis in COSPAN. In T.A. Henzinger R. Alur and E. Sontag, editors, Hybrid Systems III, pages 220–231. LNCS 1066, Springer-Verlag, 1996.

    Google Scholar 

  9. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse. Data-structures for the verification of timed automata. In O. Maler, editor, Proc. ] HART'97, pages 346–360. LNCS 1201, Springer-Verlag, 1997.

    Google Scholar 

  10. F. Balarin. Approximate reachability analysis of timed automata. In Proc. 1996 IEEE Real-Time Systems Symposium, RTSS'96, Washington, DC, USA, December 1996. IEEE Computer Society Press.

    Google Scholar 

  11. J. Bengtsson, W. Griffioen, K. Kristorffersen, K. Larsen, F. Larsson, P. Pettersson, and Wang Yi. Verification of an audio protocol with bus using Uppaal. In Proc. 8th Conference Computer-Aided Verification, CA V'96, pages 244–256, Rutgers, NJ, July 1996. Lecture Notes in Computer Science 1102, Springer-Verlag.

    Google Scholar 

  12. A. Bouajjani, J.C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Science of Computer Programming, 18:247–269, 1992.

    Google Scholar 

  13. A. Bouajjani, Y. Lakhnech, and S. Yovine. Model checking for extended timed temporal logics. In Proc. 4th Intl. Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT'96, Uppsala, Sweden, September 1996.

    Google Scholar 

  14. A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model-checking for real-time systems. In Proc. 18th IEEE Real-Time Systems Symposium, RTSS'97, San Francisco, USA, December 1997. IEEE Computer Society Press.

    Google Scholar 

  15. M. Bozga, O. Maler, A. Pnueli, and S. Yovine. Some progress in the symbolic verification of timed automata. In Proc. 1997 Computer-Aided Verification, CAV'97, Israel, June 1997. to appear in LNCS, Springer-Verlag.

    Google Scholar 

  16. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677–692, 1986.

    Google Scholar 

  17. J.B. Burch, E.M. Clarke, D.Dill, L.J. Hwang, and K.L. McMillan. Symbolic model checking: 1020 states and beyond. In Proc. 5th Symp. on Logics in Computer Science, pages 428–439. IEEE Computer Society Press, 1990.

    Google Scholar 

  18. K. Čerans. Decidability of bisimulation equivalences for parallel timer processes. In Proc. 4th Workshop on Computer-Aided Verification. Lecture Notes in Computer Science 663, Springer-Verlag, 1992.

    Google Scholar 

  19. K. Cerans, J. C. Godskesen, and K. G. Larsen. Timed modal specifications-theory and tools. In C. Courcoubetis, editor, Proc. 5th Computer-Aided Verification, pages 253–267. LNCS 697, Springer-Verlag, June 1993.

    Google Scholar 

  20. C. Courcoubetis, D. Dill, M. Chatzaki, and P. Tsounakis. Verification with realtime COSPAN. In Proc. 4th Workshop on Computer-Aided Verification. Lecture Notes in Computer Science 663, Springer-Verlag, 1992.

    Google Scholar 

  21. C. Daws and S. Yovine. Two examples of verification of multirate timed automata with KRONOS. In Proc. 1995 IEEE Real-Time Systems Symposium, RTSS'95, Pisa, Italy, December 1995. IEEE Computer Society Press.

    Google Scholar 

  22. C. Daws and S. Yovine. Reducing the number of clock variables of timed automata. In Proc. 1996 IEEE Real-Time Systems Symposium, RTSS'96, Washington, DC, USA, December 1996. IEEE Computer Society Press.

    Google Scholar 

  23. D. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Proc. ist Workshop on Computer-Aided Verification, France, 1989. Lecture Notes in Computer Science 407, Springer-Verlag.

    Google Scholar 

  24. D. L. Dill and H. Wong-Toi. Verification of real-time systems by successive over and under approximation. In Pierre Wolper, editor, Proceedings of the Seventh Conference on Computer-Aided Verification, CAV'95, Lecture Notes in Computer Science 939, pages 409–422, Liege, Belgium, 1995. Springer-Verlag.

    Google Scholar 

  25. E.A. Emerson and E. Clarke. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proc. Workshop on Logic of Programs. Lecture Notes in Computer Science 131, Springer-Verlag, 1981.

    Google Scholar 

  26. J.C. Fernandez and L. Mounier. On the fly verification of behavioural equivalences and preorders. In Proc. CAV'91. LNCS 757, Springer-Verlag, 1991.

    Google Scholar 

  27. A. Göllü, A. Puri, and P. Varaiya. Discretization of timed automata. In Proc. 33rd CDC, 1994.

    Google Scholar 

  28. Z. Har'El and R. Kurshan. Automatic verification of coordinating systems. In J. Sifakis, editor, Proc. 1st Workshop on Computer-Aided Verification. Lecture Notes in Computer Science 407, Springer-Verlag, 1989.

    Google Scholar 

  29. K. Havelund, A. Skou, K. G. Larsen, and K. Lund. Formal modelling and analysis of an audio/video protocol: an industrial case study using uppaal. In Proc. 18th IEEE Real-Time Systems Symposium, RTSS'95, San Francisco, California, USA, December 1997. IEEE Computer Society Press.

    Google Scholar 

  30. T.A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. REX Workshop “Real-Time: Theory in Practice”, New York, 1992. Springer-Verlag.

    Google Scholar 

  31. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. In Proc. 7th Symp, on Logics in Computer Science, pages 394–406. IEEE Computer Society Press, 1992. Also in Information and Computation, 111(2):193–244, 1994.

    Google Scholar 

  32. R. Jain. FDDI handbook: high-speed networking using fiber and other media. Addison-Wesley, 1994.

    Google Scholar 

  33. K. G. Larsen, F. Larsson, P. Pettersson, and Wang Yi. Efficient verification of real-time systems: compact data structure and state-space reduction. In Proc. 18th IEEE Real-Time Systems Symposium, RTSS'95, San Francisco, California, USA, December 1997. IEEE Computer Society Press.

    Google Scholar 

  34. K. G. Larsen, P. Petterson, and Wang Yi. Compositional and symbolic model-checking of real-time systems. In Proc. 1995 IEEE Real-Time Systems Symposium, RTSS'95, Pisa, Italy, December 1995. IEEE Computer Society Press.

    Google Scholar 

  35. K. G. Larsen and Y. Wang. Timed abstracted bisimulation: implicit specification and decidability. In Proc. MFPS'93, 1993.

    Google Scholar 

  36. D. Lee and M. Yannakakis. Online minimization of transition systems. In ACM Symp. on Theory of Computing. ACM Press, 1992.

    Google Scholar 

  37. K.L. McMillan. Symbolic model-checking: an approach to the state-explosion problem. Kluwer, 1993.

    Google Scholar 

  38. M. Measche and B. Berthomieu. Time petri-nets for analyzing and verifying time dependent communication protocols. In H. Rudin and C.H. West, editors, Protocol Specification, Testing and Verification, III. IFIP, North-Holland, 1983.

    Google Scholar 

  39. A. Olivero. Modélisation et analyse de systèmes temporises et hybrides. Thèse, Institut National Polytechnique de Grenoble, Grenoble, France, September 1994.

    Google Scholar 

  40. J.G. Springintveld and F.W. Vaandrager. Minimizable timed automata. In B. Jonsson and J. Parrow, editors, Proc. FTRTFT'96, Uppsala, Sweden, 1996. LNCS 1135, 130–147, Springer-Verlag.

    Google Scholar 

  41. S. Tripakis and C. Courcoubetis. Extending promela and spin for real time. In TACAS'96, Passau, Germany, 1996. Lecture Notes in Computer Science 1055, Springer-Verlag.

    Google Scholar 

  42. S. Tripakis and S. Yovine. Analysis of timed systems based on time-abstracting bisimulations. In Proc. 8th Conference Computer-Aided Verification, CAV'96, pages 232–243, Rutgers, NJ, July 1996. Lecture Notes in Computer Science 1102, Springer-Verlag.

    Google Scholar 

  43. VERIMAG. School on Methods and Tools for the Verification of Infinite-State Systems. http://www.imag.fr/VERIMAG. Grenoble, France, March 1997.

    Google Scholar 

  44. C. Weise and D. Lenzkes. Efficient scaling invariant checking of timed bisimulation. In STACS'97. Springer-Verlag, 1997.

    Google Scholar 

  45. Howard Wong-Toi and David L. Dill. Approximations for verifying timing properties. In Teo Rus and Charles Rattray, editors, Theories and Experiences for Real-Time System Development (Proceedings First AMAST Workshop on Real Time System Development, chapter 7, pages 177–204. World Scientific Publishing, 1994.

    Google Scholar 

  46. S. Yovine. Méthodes et outils pour la verification symbolique de systèmes temporisés. Thèse, Institut National Polytechnique de Grenoble, Grenoble, France, May 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre Equation, VERIMAG, 2, Av. de Vignate, 38610, Gières, France

    Sergio Yovine

Authors
  1. Sergio Yovine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg Frits W. Vaandrager

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Yovine, S. (1998). Model checking timed automata. In: Rozenberg, G., Vaandrager, F.W. (eds) Lectures on Embedded Systems. EEF School 1996. Lecture Notes in Computer Science, vol 1494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65193-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-65193-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65193-2

  • Online ISBN: 978-3-540-49498-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation