Skip to main content
SpringerLink
Log in

A graphical μ-calculus and local model checking

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A graphical notation for the propositional μ-calculus, calledmodal graphs, is presented. It is shown that both the textual and equational presentations of the μ-calculus can be translated into modal graphs. A model checking algorithm based on such graphs is proposed. The algorithm istruly local in the sense that it only generates the parts of the underlying search space which are necessary for the computation of the final result. The correctness of the algorithm is proven and its complexity analysed.

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

Access this article

Log in via an institution

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. Clarke E M, Grumberg O, Peled D A. Model Checking. The MIT Press, 1999.

  2. Bradfield J, Stirling C. Modal logics and mu-calculus: An introduction. InHandbook of Process Algebra, Ponse A, Bergstra J A, Smolka S A (eds.), Elsevier, 2001, pp.293–330.

  3. Emerson E A, Lei C-L. Efficient model checking in fragments of the propositional mu-calculus. InProc. Logic in Computer Science, Cambridge, Massachusetts, IEEE Press, 1986, pp.267–278.

    Google Scholar 

  4. Cleaveland R. Tableau-based model checking in the propositional mu-calculus.Acta Informatica, 1990, 27(4): 724–747.

    MathSciNet  Google Scholar 

  5. Andersen H R. Model checking and boolean graphs.Theoretical Computer Science, 1994, 126: 3–30.

    Article  MATH  MathSciNet  Google Scholar 

  6. Stirling C, Walker D. Local model checking in the modal mu-calculus.Theoretical Computer Science, 1991, 89: 161–177.

    Article  MATH  MathSciNet  Google Scholar 

  7. Larsen K G. Efficient local correctness checking. InProc. Computer Aided Verification, Montreal, pp.30–43, Lecture Notes in Computer Science 663, 1992, Springer-Verlag.

    Google Scholar 

  8. Liu X, Ramakrishnan C R, Scott A Smolka. Fully local and efficient evaluation of alternating fixed points. InProc. Tools and Algorithms for the Construction of Systems, Lisbon, pp.5–19, Lecture Notes in Computer Science 1384, Springer-Verlag, 1998.

  9. Tarski A. A lattice-theoretical fixpoint theorem and its applications.Pacific Journal of Mathematics, 1955, 5: 285–309.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Institute of Software, The Chinese Academy of Sciences, P.O. Box 8718, 100080, Beijing, P.R. China

    Lin Huimin

Authors
  1. Lin Huimin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lin Huimin.

Additional information

Supported by the National Natural Science Foundation of China (Grand No.69833020).

LIN Huimin was born in 1947. He received the Ph.D. in computer science from the Institute of Software, Chinese Academy of Sciences, in 1986. His research interests include concurrency, process algebra, model checking, real-time systems, verification tools and algorithms, formal methods, program specification and validation, software modularization, and abstract data types.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, H. A graphical μ-calculus and local model checking. J. Compt. Sci. & Technol. 17, 665–671 (2002). https://doi.org/10.1007/BF02960756

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation