Abstract
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.
Research supported by National Science Foundation/DARPA Grant CCR-9014775.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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.
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.
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.
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.
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.
Cleaveland, R. and B. Steffen. “When is ‘Partial’ Complete? A Logic-Based Proof Technique using Partial Specifications.” In Proc. LICS '90, 1990.
Cleaveland, R. and B. Steffen. “Computing Behavioural Relations, Logically.” In Proc. ICALP '91, 1991.
Emerson, E.A. and C.-L. Lei. “Efficient Model Checking in Fragments of the Propositional Mu-Calculus.” In Proc. LICS '86, 1986.
Fernandez, J.-C. Aldébaran: Une Système de Vérification par Réduction de Processus Communicants. Ph.D. Thesis, Université de Grenoble, 1988.
Fischer, M., and R. Ladner. “Propositional Dynamic Logic of Regular Programs.” Journal of Computer and System Sciences 18:194–211, 1979.
Graf, S. and B. Steffen. “Using Interface Specifications for Compositional Reduction.” In Computer-Aided Verification '90.
Kozen, D. “Results on the Propositional Μ-Calculus.” Theoretical Computer Science 27:333–354, 1983.
Larsen, K. “Proof Systems for Hennessy-Milner Logic with Recursion.” In Proc. CAAP, 1988.
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.
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.
Roy, V. and R. de Simone. “Auto/Autograph.” In Computer-Aided Verification '90, 1990.
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.
Tarski, A. “A Lattice-Theoretical Fixpoint Theorem and its Applications.” Pacific Journal of Mathematics 5, 1955.
Walker, D. “Bisimulations and Divergence.” In Proc. LICS '88, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleaveland, R., Steffen, B. (1992). A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive