Skip to main content
SpringerLink
Log in

Partition refinement in real-time model checking

  • Selected Presentations
  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1998)

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

Abstract

Many successful model checking tools for real-time systems are based on pure forward or backward reachability analysis. In this paper we present a real-time model checker that is based on a different approach, namely partition refinement. Partition refinement was applied before in real-time model checking, but never resulted, to our knowledge, in tools with competitive performance. Our partition refinement algorithm is inspired by currently existing ones for real-time systems, and operates on a product structure of a system specification and a property specification. A key aspects of our approach is that, unlike other real-time model checking approaches, we do not use a canonical representation like DBM’s to manipulate regions. Instead we solely use the splitting history generated by the partition refinement algorithm. This paper presents our model checking technique, and reports on first experiences with a first implementation, comparing its performance to that of other model checkers.

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. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. Minimization of timed transition systems. In Concur’92, volume 630 of LNCS, pages 340–354. Springer-Verlag, 1992.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Alur and D. Dill. The theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22:181–201, 1996.

    Article  Google Scholar 

  5. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  6. D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In CAV’89, volume 407 of LNCS, pages 195–212. Springer-Verlag, 1989.

    Google Scholar 

  7. T.A. Henzinger. The theory of hybrid automata. In LICS’96, pages 278–292. IEEE Computer Society Press, 1996.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. K.J. Kristoffersen, F. Laroussinie, K.G. Larsen, P. Pettersson, and Wang Yi. A compositional proof of a real-time mutual exclusion protocol. In Proceedings of the 7th International Joint Conference on the Theory and Practice of Software Development, 1997.

    Google Scholar 

  10. K.G. Larsen, P. Petterson, and Wang Yi. Compositional and symbolic model checking of real-time systems. In 16th IEEE Real-Time Systems Symposium, 1995.

    Google Scholar 

  11. K.G. Larsen, P. Petterson, and Wang Yi. Model checking for real-time systems. In Proceedings of Fundamentals of Computation Theory, volume 965 of LNCS, pages 62–88. Springer-Verlag, 1995.

    Google Scholar 

  12. K.L. McMillan. Symbolic model checking. Kluwer, 1993.

    Google Scholar 

  13. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  14. O.V. Sokolsky and S.A. Smolka. Local model checking for real-time systems. In CAV’95, volume 939 of LNCS, pages 211–224. Springer-Verlag, 1995.

    Google Scholar 

  15. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In CAV’93, volume 697 of LNCS, pages 210–224. Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology and Systems, Delft University of Technology, Zuidplantsoen 4, NL-2628, BZ Delft, The Netherlands

    Ronald Lutje Spelberg, Hans Toetenel & Marcel Ammerlaan

Authors
  1. Ronald Lutje Spelberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Toetenel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcel Ammerlaan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anders P. Ravn Hans Rischel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spelberg, R.L., Toetenel, H., Ammerlaan, M. (1998). Partition refinement in real-time model checking. In: Ravn, A.P., Rischel, H. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998. Lecture Notes in Computer Science, vol 1486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055344

Download citation

  • DOI: https://doi.org/10.1007/BFb0055344

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65003-4

  • Online ISBN: 978-3-540-49792-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation