Advertisement

Formal Methods in System Design

, Volume 26, Issue 3, pp 267–292 | Cite as

Checking Timed Büchi Automata Emptiness Efficiently

  • Stavros Tripakis
  • Sergio Yovine
  • Ahmed Bouajjani
Article

Abstract

This paper presents an on-the-fly and symbolic technique for efficiently checking timed automata emptiness. It is symbolic because it uses the simulation graph (instead of the region graph). It is on-the-fly because the simulation graph is generated during the test for emptiness. We have implemented a verification tool called Profounder based on this technique. To our knowledge, Profounder is the only available tool for checking emptiness of timed Büchi automata. To illustrate the practical interest of our approach, we show the performances of the tool on a non-trivial case study.

Keywords

timed automata symbolic model-checking on-the fly verification verification tools 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Altisen, G. Goessler, A. Pnueli, J. Sifakis, and S. Tripakis, “A framework for scheduler synthesis,” in IEEE Real-Time Systems Symposium, RTSS’99, 1999.Google Scholar
  2. 2.
    Rajeev Alur, “Techniques for automatic verification of real-time systems”, PhD thesis, Department of Computer Science, Stanford University, 1991.Google Scholar
  3. 3.
    R. Alur, C. Courcoubetis, and D.L. Dill, “Model checking in dense real time,” Information and Computation, Vol. 104, No. 1, pp. 2–34, 1993.CrossRefGoogle Scholar
  4. 4.
    R. Alur, C. Courcoubetis, N. Halbwachs, D.L. Dill, and H. Wong-Toi, “Minimization of timed transition systems,” in 3rd Conference on Concurrency Theory CONCUR ‘92, volume 630 of Lecture Notes in Computer Science, Springer-Verlag, 1992, pp. 340–354.Google Scholar
  5. 5.
    R. Alur and D.L. Dill, “A theory of timed automata,” Theoretical Computer Science, Vol. 126, pp. 183–235, 1994.CrossRefGoogle Scholar
  6. 6.
    A. Bouajjani, S. Tripakis, and S. Yovine, “On-the-fly symbolic model checking for real-time systems,” in Proc. of the 18th IEEE Real-Time Systems Symposium, San Francisco, CA, IEEE, December 1997, pp. 25–34.Google Scholar
  7. 7.
    M. Bozga, “Smi: An open toolbox for symbolic protocol verification,” Technical report, VERIMAG, 1997.Google Scholar
  8. 8.
    J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, “Petrify: A tool for manipulating concurrent specifications and synthesis of asynchronous controllers,” IEICE Transactions on Information and Systems, Vol. E80-D, No. 3, pp. 315–325, 1997.Google Scholar
  9. 9.
    C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, “Memory efficient algorithms for the verification of temporal properties,” Formal Methods in System Design, Vol. 1, pp. 275–288, 1992.CrossRefGoogle Scholar
  10. 10.
    C. Courcoubetis and M. Yannakakis, “Minimum and maximum delay problems in real-time systems,” in Computer-Aided Verification, LNCS 575, Springer-Verlag, 1991.Google Scholar
  11. 11.
    C. Daws, A. Olivero, S. Tripakis, and S. Yovine, “The tool KRONOS,” in Hybrid Systems III, Verification and Control, volume 1066 of LNCS, Springer-Verlag, 1996, pp. 208–219.Google Scholar
  12. 12.
    D.L. Dill, “Timing assumptions and verification of finite-state concurrent systems,” in J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407, Springer-Verlag, 1989, pp. 197–212.Google Scholar
  13. 13.
    T. Henzinger, O. Kupferman, and M. Vardi, “A space-efficient on-the-fly algorithm for real-time model-checking,” in CONCUR’96. LNCS 1119, 1996.Google Scholar
  14. 14.
    T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” Information and Computation, Vol. 111, No. 2, pp. 193–244, 1994.CrossRefGoogle Scholar
  15. 15.
    L. Lamport, “Sometimes is sometimes “not never”—on the temporal logic of programs,” in 7th ACM Symp. POPL, 1980, pp. 174–185.Google Scholar
  16. 16.
    K. Larsen, P. Petterson, and W. Yi, “Uppaal in a nutshell,” Software Tools for Technology Transfer, Vol. 1, Nos. (1/2), 1997.Google Scholar
  17. 17.
    D. Lee and M. Yannakakis, “Online minimization of transition systems,” in ACM Symp. on Theory of Computing, 1992.Google Scholar
  18. 18.
    O. Lichtenstein and A. Pnueli, “Checking that finite state concurrent programs satisfy their linear specification,” in 12th ACM Symp. POPL, New Orleans, January 1985, pp. 97–107.Google Scholar
  19. 19.
    O. Maler and A. Pnueli, “Timing analysis of asynchronous circuits using timed automata,” in P.E. Camurati, H. Eveking (Eds.), Proc. CHARME’95. LNCS 987, Springer Verlag, 1995.Google Scholar
  20. 20.
    R. Paige and R. Tarjan, “Three partition refinement algorithms,” SIAM Journal on Computing, Vol. 16, No. 6, 1987.Google Scholar
  21. 21.
    A. Pnueli, “A temporal logic of concurrent programs,” Theoretical Computer Science, Vol. 13, pp. 45–60, 1981.CrossRefGoogle Scholar
  22. 22.
    O. Sokolsky and S. Smolka, “Local model checking for real-time systems,” in CAV’95. LNCS 939, 1995.Google Scholar
  23. 23.
    K.S. Stevens, S.V. Robinson, and A.L. Davis, “The post office—communication support for distributed ensemble architectures,” in Sixth International Conference on Distributed Computing Systems, 1986.Google Scholar
  24. 24.
    R. Tarjan, “Depth first search and linear graph algorithms,” SIAM Journal on Computing, Vol. 1, No. 2, pp. 146–170, 1972.CrossRefGoogle Scholar
  25. 25.
    S. Tripakis, “The formal analysis of timed systems in practice,” PhD thesis, Université Joseph Fourrier de Grenoble, 1998.Google Scholar
  26. 26.
    S. Tripakis, “Verifying progress in timed systems,” in 5th Intl. AMAST Workshop on Real-Time and Probabilistic Systems (ARTS), LNCS 1601, 1999.Google Scholar
  27. 27.
    S. Tripakis, “Description and schedulability analysis of the software architecture of an automated vehicle control system,” in EMSOFT’02, 2002. To appear in LNCS.Google Scholar
  28. 28.
    S. Tripakis and S. Yovine, “Analysis of timed systems using time-abstracting bisimulations,” Formal Methods in System Design, Vol. 18, No. 1, pp. 25–68, 2001.CrossRefGoogle Scholar
  29. 29.
    S. Tripakis and S. Yovine, “Timing analysis and code generation of vehicle control software using Taxys,” in Workshop on Runtime Verification (RV’01). Volume 55, Issue 2 of ENTCS, Elsevier, 2001.Google Scholar
  30. 30.
    S. Yovine, “KRONOS: A verification tool for real-time systems,” Software Tools for Technology Transfer, 1997.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Stavros Tripakis
    • 1
  • Sergio Yovine
    • 2
  • Ahmed Bouajjani
    • 3
  1. 1.CNRS–VERIMAG, Centre ÉquationGièresFrance
  2. 2.CNRS–VERIMAG, Centre ÉlquationGièresFrance
  3. 3.LIAFA, Univ. of Paris 7Paris Cedex 5France

Personalised recommendations