Skip to main content
Springer Nature Link
Log in

Model Checking Modal Transition Systems Using Kripke Structures

  • Conference paper
  • First Online:
Verification, Model Checking, and Abstract Interpretation (VMCAI 2002)

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

  • 340 Accesses

Abstract

We reduce the modal mu-calculus model-checking problem for Kripke modal transition systems to the modal mu-calculus model-checking problem for Kripke structures. This reduction is sound, preserves the alternation-depth fragments of the modal mu-calculus, is linear in the size of formulas and models, and extends the reach of modal mu-calculus model checkers to sound abstraction for the full logic. These results specialize to CTL* model-checking and CTL model checking.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. R. Armoni, L. Fix, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, E. Singerman, and M. Y. Vardi. The ForSpec temporal language: A new temporal property-specification language. Submitted, 2001.

    Google Scholar 

  2. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian Abstraction for Model Checking C Programs. In T. Margaria and W. Yi, editors, Proceedings of TACAS’2001, volume 2031 of LNCS, pages 268–283, Genova, Italy, April 2001. Springer Verlag.

    Google Scholar 

  3. O. Bernholtz, M. Vardi, and P. Wolper. An Automata-Theoretic Approach to Branching-Time Model-Checking. In 6th Int’l Conference on Computer Aided Verification (CAV’94), volume 818 of Lecture Notes in Computer Science, pages 142–155. Springer Verlag, 1994.

    Google Scholar 

  4. J. C. Bradfield. Verifying Temporal Properties Of Systems. Birkhäuser, Boston, Mass., 1991.

    Google Scholar 

  5. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1–2):115–131, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  6. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274–287. Springer Verlag, July 1999.

    Google Scholar 

  7. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR’2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168–182. Springer Verlag, August 2000.

    Google Scholar 

  8. J. R. Burch, E. M. Clarke, D. L. Dill K. L. McMillan, and J. Hwang. Symbolic model checking: 1020 states and beyond. Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.

    Google Scholar 

  9. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, January 2000.

    Google Scholar 

  10. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512–1542, 1994.

    Article  Google Scholar 

  11. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1(275–288), 1992.

    Article  Google Scholar 

  12. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. on Principles of Programming Languages, pages 238–252. ACM Press, 1977.

    Google Scholar 

  13. P. Cousot and R. Cousot. Temporal abstract interpretation. In Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 12–25, Boston, Mass., January 2000. ACM Press, New York, NY.

    Google Scholar 

  14. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996.

    Google Scholar 

  15. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2):253–291, 1997.

    Article  Google Scholar 

  16. D. Dams, R. Gerth, and O. Grumberg. Fair Model Checking Of Abstractions. In M. Leuschel, A. Podelski, C.R. Ramakrishnan, and U. Ultes-Nitsche, editors, Proceedings of the Workshop on Verification and Computational Logic (VCL’2000), DSSE-TR-2000-6. University of Southhampton, July 2000.

    Google Scholar 

  17. R. de Nicola and F. Vaandrager. Three Logics for Branching Bisimulation. Journal of the Association of Computing Machinery, 42(2):458–487, March 1995.

    MATH  Google Scholar 

  18. M. B. Dwyer, J. Hatcli., R. Joehanes, S. Laubach, C. S. Pasareanu, Robby, W. Visser, and H. Zheng. Tool-supported Program Abstraction for Finite-state Verification. In Proceedings of the 23nd Intl’ Conference on Software Engineering, pages 177–187. ACM Press, May 2001.

    Google Scholar 

  19. M. B. Dwyer and D. A. Schmidt. Limiting State Explosion with Filter-Based Refinement. In Proceedings of the ILPS’97 Workshop on Verification, Model Checking, and Abstraction, 1997.

    Google Scholar 

  20. E. A. Emerson and C. L. Lei. Efficient Model Checking in Fragments of the Mucalculus. In Proc. of the First Int’l IEEE Symposium on Logic in Computer Science (LICS’86), pages 267–278, Cambridge, Mass., June 1986. IEEE Press.

    Google Scholar 

  21. N. Francez. Fairness. Texts and Monographs in Computer Science. Springer Verlag, 1986.

    Google Scholar 

  22. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proceedings of the International Conference on Theory and Practice of Concurrency, Lecture Notes in Computer Science, pages 426–440. Springer Verlag, August 2001.

    Google Scholar 

  23. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In Sands D., editor, Proceedings of the European Symposium on Programming (ESOP’2001), pages 155–169. Springer Verlag, April 2001.

    Google Scholar 

  24. D. Jackson. Alloy: A Lightweight Object Modelling Language. Technical Report TR-797, Laboratory of Computer Science, Massachusetts Institute of Technology, 28 July 2000.

    Google Scholar 

  25. P. Kelb. Model checking and abstraction: a framework preserving both truth and failure information. Technical Report OFFIS, University of Oldenburg, Germany, 1994.

    Google Scholar 

  26. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

    Google Scholar 

  27. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Third Annual Symposium on Logic in Computer Science, pages 203–210. IEEE Computer Society Press, 1988.

    Google Scholar 

  28. D. E. Long. Model Checking, Abstraction, and Compositional Verification. PhD thesis, Carnegie Mellon University, School of Computer Science, July 1993.

    Google Scholar 

  29. R. Milner. An algebraic definition of simulation between programs. In 2nd International Joint Conference on Artificial Intelligence, pages 481–489, London, United Kingdom, 1971. British Computer Society.

    Google Scholar 

  30. R. Milner. A modal characterisation of observable machine behaviours. In G. Astesiano and C. Böhm, editors, CAAP’ 81, volume 112 of Lecture Notes in Computer Science, pages 25–34. Springer Verlag, 1981.

    Google Scholar 

  31. M. Sagiv, T. Reps, and R. Wilhelm. Parametric Shape Analysis via 3-Valued Logic. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, pages 105–118, January 20–22, San Antonio, Texas 1999.

    Google Scholar 

  32. H. Saidi and N. Shankar. Abstract and model check while you prove. In Proc. of the 11th Conference on Computer-Aided Verification, number 1633 in Lecture Notes in Computer Science, pages 443–454. Springer, 1999.

    Google Scholar 

  33. D. A. Schmidt. Binary relations for abstraction and refinement. Elsevier Electronic Notes in Computer Science, November 1999. Workshop on Refinement and Abstraction, Osaka, Japan. To appear.

    Google Scholar 

  34. David A. Schmidt. From Trace Sets to Modal Transition Systems. Submitted for publication, July 2001.

    Google Scholar 

  35. R. J. van Glabbeek and W. P. Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM, 43(3):555–600, May 1996.

    Article  MathSciNet  Google Scholar 

  36. W. Visser and H. Barringer. Practical CTL* Model Checking —Should SPIN be Extended? Software Tools for Technology Transfer, 2(4), 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology and Medicine, UK

    Michael Huth

Authors
  1. Michael Huth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Via Torino 155, 30170, Mestre-Venezia, Italy

    Agostino Cortesi

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huth, M. (2002). Model Checking Modal Transition Systems Using Kripke Structures. In: Cortesi, A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2002. Lecture Notes in Computer Science, vol 2294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47813-2_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-47813-2_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43631-7

  • Online ISBN: 978-3-540-47813-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics