Skip to main content
SpringerLink
Log in

Tableau-based model checking in the propositional mu-calculus

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper describes a procedure, based around the construction of tableau proofs, for determining whether finite-state systems enjoy properties formulated in the propositional mu-calculus. It presents a tableau-based proof system for the logic and proves it sound and complete, and it discusses techniques for the efficient construction of proofs that states enjoy properties expressed in the logic. The approach is the basis of an ongoing implementation of a model checker in the Concurrency Workbench, an automated tool for the analysis of concurrent systems.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arnold, A., Crubille, P.: A Linear Algorithm To Solve Fixed-Point Equations on Transition Systems. Inf. Process. Lett. 29, 57–66 (1988)

    Google Scholar 

  2. Browne, M.C.: An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic. In: Proceedings of First Annual Symposium on Logic in Computer Science, pp. 260–266, 1986

  3. Browne, M.C., Clarke, E.M., Dill, D.: Checking the Correctness of Sequential Circuits. In: Proceedings of the IEEE International Conference on Computer Design, pp. 545–548, 1985

  4. Browne, M.C., Clarke, E.M., Dill, D.: Automatic Circuit Verification Using Temporal Logic: Two New Examples. In: Milne, G.J., Subrahmanyam, P.A. (eds.) Formal Aspects of VLSI Design, pp. 113–124. Amsterdam, New York: Elsevier-North Holland 1986

    Google Scholar 

  5. Browne, M.C., Clarke, E.M., Dill, D., Mishra, B.: Automatic Verification of Sequential Circuits Using Temporal Logic. IEEE Trans. Comput. C-35, 1035–1044 (1986)

    Google Scholar 

  6. Clarke, E.M., Long, D.E., McMillan, K.L.: Compositional Model Checking. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science. Washington DC: Computer Society Press 1989

    Google Scholar 

  7. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications. ACM Trans. Program. Lang. Syst. 8, 244–263 (1986)

    Google Scholar 

  8. Cleaveland, W.R., Parrow, J., Steffen, B.U.: A Semantics-Based Tool for the Verification of Finite-State Systems. In: Proceedings of the Ninth IFIP Symposium on Protocol Specification, Testing and Verification, 287–302. Amsterdam: North-Holland (1990)

    Google Scholar 

  9. Cleaveland, W.R., Parrow, J., Steffen, B.U.: The Concurrency Workbench. In: Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems. (Lect. Notes Comput. Sci., Vol. 407, 24–37). Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  10. Emerson, E.A.: Branching Time Temporal Logic: A Tutorial. In: Proceedings of the REX Summer School/Workshop. Noordwijkerhout, The Netherlands 1988

  11. Emerson, E.A., Clarke, E.M.: Characterizing Correctness Properties of Parallel Programs as Fixpoints. In: Proceedings of the Seventh International Colloquium on Automata, Languages and Programming. (Lect. Notes Comput. Sci. Vol. 85). Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  12. Emerson, E.A., Halpern, J.Y.: Sometimes and Not Never Revisited: On Branching versus Linear Time. In: Proceedings the Twelfth Annual ACM Symposium on Principles of Programming Languages 1983

  13. Emerson, E.A., Lei, C.-L.: Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In: Proceedings of the First Annual Symposium on Logic in Computer Science, pp. 267–278, 1986

  14. Fischer, M.J., Ladner, R.E.: Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci. 18, 194–211 (1979)

    Google Scholar 

  15. Hennessy, M., Milner, R.: Algebraic Laws for Nondeterminism and Concurrency. J. Assoc. Comput. Mach. 32, 137–161 (1985)

    Google Scholar 

  16. Kozen, D.: Results on the Propositional μ-Calculus. Theor. Comput. Sci. 27, 333–354 (1983)

    Google Scholar 

  17. Lamport, L.: Sometimes is Sometimes Not Never — On the Temporal Logic of Programs. In: Proceedings of the Seventh Annual ACM Symposium on Principles of Programming Languages, pp. 174–185, 1980

  18. Larsen, K.G.: Proof Systems for Hennessy-Milner Logic with Recursion. In: Proceedings of CAAP 1988

  19. Milner, R.: A Calculus of Communicating Systems. (Lect. Notes Comput. Sci., Vol. 92). Berlin Heidelberg New York: Springer 1980

    Google Scholar 

  20. Parrow, J.: Submodule Construction as Equation Solving in CCS. In: Proceedings of the Foundations of Software Technology and Theoretical Computer Science. (Lect. Notes Comput. Sci., Vol. 287, pp. 103–123). Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  21. Pnueli, A.: Linear and Branching Structures in the Semantics and Logics of Reactive Systems. In: Proceeding of the Twelfth International Conference on Automata, Languages and Programming. (Lect. Notes Comput. Sci., Vol. 194, pp. 14–32). Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  22. Steffen, B.U.: Characteristic Formulae for CCS with Divergence. In: Proceedings of Eleventh International Colloquium on Automata, Languages and Programming 1989

  23. Stirling, C.: A Complete Modal Proof System for a Subset of SCCS. In: Proceedings of TAPSOFT '85. (Lect. Notes Comput. Sci., Vol. 185, pp. 253–266). Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  24. Stirling, C.: Modal Logics for Communicating Systems. Theor. Comput. Sci. 49, 311–347 (1987)

    Google Scholar 

  25. Stirling, C., Walker, D.: Local Model Checking in the Modal Mu-Calculus. In: Proceedings of TAPSOFT '89. (Lect. Notes Comput. Sci., Vol. 351, pp. 369–383). Berlin Heidelberg New York: Springer 1989

    Google Scholar 

  26. Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications. Pac. J. Math. 5, 285–309 (1955)

    Google Scholar 

  27. Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: Proceedings of the First Annual Symposium on Logic in Computer Science, pp. 332–344, 1986

  28. Winskel, G.: Model Checking in the Modal ν-Calculus. In: Proceedings of Eleventh International Colloquium on Automata, Languages and Programming 1989

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Carolina State University, Box 8206, 27695-8206, Raleigh, NC, USA

    Rance Cleaveland

Authors
  1. Rance Cleaveland
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by British Science and Engineering Research Council grant GC/D69464. The results in this paper were obtained while the author was a research associate at the University of Sussex in Brighton, England

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cleaveland, R. Tableau-based model checking in the propositional mu-calculus. Acta Informatica 27, 725–747 (1990). https://doi.org/10.1007/BF00264284

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation