A linear-time model-checking algorithm for the alternation-free modal mu-calculus

  • Ranee Cleaveland
  • Bernhard Steffen
Session 2: Model Checking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 575)


We develop a model-checking algorithm for a logic that permits propositions to be defined with greatest and least fixed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identified by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and behavioral preorders. Our algorithm determines whether a process satisfies a formula in time proportional to the product of the sizes of the process and the formula; this improves on the best known algorithm for similar fixed-point logics.


Model Check Temporal Logic Atomic Proposition Label Transition System Computation Tree Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [AC]
    Arnold, A., and P. Crubille. “A Linear Algorithm To Solve Fixed-Point Equations on Transition Systems.” Information Processing Letters 29:57–66, 30 September 1988.Google Scholar
  2. [CES]
    Clarke, E.M., 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.Google Scholar
  3. [CH]
    Cleaveland, R. and M.C.B. Hennessy. “Testing Equivalence as a Bisimulation Equivalence.” In Proc. Workshop on Automatic Verification Methods for Finite-State Systems. LNCS 407.Google Scholar
  4. [CPS1]
    Cleaveland, R., J. Parrow and B. Steffen. “The Concurrency Workbench.” In Proc. Workshop on Automatic Verification Methods for Finite-State Systems, 1989, LNCS 407. To appear in ACM TOPLAS.Google Scholar
  5. [CPS2]
    Cleaveland, R., J. Parrow and B. Steffen. “A Semantics-based Verification Tool for Finite-State Systems”, In Proc. 9th Symp. on Protocol Specification, Testing, and Verification, 1989.Google Scholar
  6. [CS1]
    Cleaveland, R. and B. Steffen. “When is ‘Partial’ Complete? A Logic-Based Proof Technique using Partial Specifications.” In Proc. LICS '90, 1990.Google Scholar
  7. [CS2]
    Cleaveland, R. and B. Steffen. “Computing Behavioural Relations, Logically.” In Proc. ICALP '91, 1991.Google Scholar
  8. [EL]
    Emerson, E.A. and C.-L. Lei. “Efficient Model Checking in Fragments of the Propositional Mu-Calculus.” In Proc. LICS '86, 1986.Google Scholar
  9. [Fe]
    Fernandez, J.-C. Aldébaran: Une Système de Vérification par Réduction de Processus Communicants. Ph.D. Thesis, Université de Grenoble, 1988.Google Scholar
  10. [FL]
    Fischer, M., and R. Ladner. “Propositional Dynamic Logic of Regular Programs.” Journal of Computer and System Sciences 18:194–211, 1979.Google Scholar
  11. [GS]
    Graf, S. and B. Steffen. “Using Interface Specifications for Compositional Reduction.” In Computer-Aided Verification '90.Google Scholar
  12. [Ko]
    Kozen, D. “Results on the Propositional Μ-Calculus.” Theoretical Computer Science 27:333–354, 1983.Google Scholar
  13. [La]
    Larsen, K. “Proof Systems for Hennessy-Milner Logic with Recursion.” In Proc. CAAP, 1988.Google Scholar
  14. [MSGS]
    Malhotra, J., S.A. Smolka, A. Giacalone and R. Shapiro. “Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems.” In Proc. Workshop on Specification and Verification of Concurrent Systems, University of Stirling, Scotland, 1988.Google Scholar
  15. [RRSV]
    Richier, J., C. Rodriguez, J. Sifakis, J. and Voiron. “Verification in Xesar of the Sliding Window Protocol.” In Proc. 7 th Symp. on Protocol Specification, Testing, and Verification, 1987.Google Scholar
  16. [RdS]
    Roy, V. and R. de Simone. “Auto/Autograph.” In Computer-Aided Verification '90, 1990.Google Scholar
  17. [Ste]
    Steffen, B.U. “Characteristic Formulae for CCS with Divergence.” In Proc. ICALP '89,1989. With A. Ingólfsdóttir, to appear in Theorectical Computer Science.Google Scholar
  18. [Ta]
    Tarski, A. “A Lattice-Theoretical Fixpoint Theorem and its Applications.” Pacific Journal of Mathematics 5, 1955.Google Scholar
  19. [Wa]
    Walker, D. “Bisimulations and Divergence.” In Proc. LICS '88, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ranee Cleaveland
    • 1
  • Bernhard Steffen
    • 2
  1. 1.Department of Computer ScienceNorth Carolina State UniversityRaleighUSA
  2. 2.Lehrstuhl für Informatik IIRheinisch-Westfälische Technische Hochschule AachenAachenGermany

Personalised recommendations