Abstract
In this paper, we develop an algorithm for model checking that handles the full modal mucalculus including alternating fixpoints. Our algorithm has a better worst-case complexity than the best known algorithm for this logic while performing just as well on certain sublogics as other specialized algorithms. Important for the efficiency is an alternative characterisation of formulas in terms of equational systems, which enables the sharing and reuse of intermediate results.
The author was supported by NSF Grant CCR-9014775.
Part of the work has been funded by DFG Grant Ste 53T-1.
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
Andersen, H. “Model Checking and Boolean Graphs.” Proc. of ESOP '92, LNCS 582,1992.
Arnold, A., and P. Crubille. “A Linear Algorithm To Solve Fixed-Point Equations on Transition Systems.” Information Processing Letters, v. 29, 30 September 1988, pp. 57–66.
Clarke, E.M., E.A. Emerson and A.P. Sistla. “Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications.” ACM Transactions on Programming Languages and Systems, v. 8, n. 2, 1986, pp. 244–263.
Cleaveland, R. “Tableau-Based Model Checking in the Propositional Mu-Calculus.” Acta Informatica, v. 27, 1990, pp. 725–747.
Cleaveland, R., M. Klein and B. Steffen. “Faster Model Checking for the Modal Mu-Calculus.” In Technical Report RWTH Aachen Nr. 91-29, Fachgruppe der Informatik, 1991.
Cleaveland, R., J. Parrow and B. Steffen. “The Concurrency Workbench.” In Proceedings CAV'89, LNCS 407, 1989.
Cleaveland, R., J. Parrow and B. Steffen. “A Semantics-based Verification Tool for Finite-State Systems”, In Proceedings of the Ninth International Symposium on Protocol Specification, Testing, and Verification. North-Holland, 1989.
Cleaveland, R. and B. Steffen. “Computing Behavioural Relations, Logically.” In Proceedings ICALP '91, LNCS 510,1991.
Cleaveland, R. and B. Steffen. “A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus.” In Proceedings CAV '91, LNCS 575, 1991.
Emerson, E.A. and C.-L. Lei. “Efficient Model Checking in Fragments of the Propositional Mu-Calculus.” In Proceedings of LICS, 1986, pp. 267–278.
Fernandez, J.-C. Aldébaran: Une Système de Vérification par Réduction de Processus Communicants. Ph.D. Thesis, Université de Grenoble, 1988.
Kleene, S. C. “Introduction to Metamathematics”, North Holland, 1952.
Kozen, D. “Results on the Propositional μ-Calculus.” TCS, v. 27, 1983, pp. 333–354.
Larsen, K.G. “Proof Systems for Hennessy-Milner Logic with Recursion.” In Proceedings of CAAP, 1988.
Malhotra, J., Smolka, S.A., Giacalone, A. and Shapiro, R. “Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems.” In Proceedings of the Workshop on Specification and Verification of Concurrent Systems, Univ. of Stirling, Scotland, 1988.
Richier, J., Rodriguez, C., Sifakis, J. and Voiron, J. “Verification in XESAR of the Sliding Window Protocol.” In Proceedings of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification, 1987, North-Holland.
Roy, V. and R. de Simone. “Auto/Autograph.” In Proceedings, CAV'90, LNCS 531, 1990.
Steffen, B.U. “Characteristic Formulae.” In Proceedings ICALP, LNCS 372, 1989.
Steffen, B.U., and A. Ingólfsdóttir. “Characteristic Formulae for CCS with Divergence.” To appear in Information and Computation.
Stirling, C. and D. Walker. “Local Model Checking in the Modal Mu-Calculus.” In Proceedings of TAPSOFT '89, LNCS 351,1989.
Tarski, A. “A Lattice-Theoretical Fixpoint Theorem and its Applications.” Pacific Journal of Mathematics, v. 5, 1955.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleaveland, R., Klein, M., Steffen, B. (1993). Faster model checking for the modal Mu-Calculus. In: von Bochmann, G., Probst, D.K. (eds) Computer Aided Verification. CAV 1992. Lecture Notes in Computer Science, vol 663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56496-9_32
Download citation
DOI: https://doi.org/10.1007/3-540-56496-9_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56496-6
Online ISBN: 978-3-540-47572-9
eBook Packages: Springer Book Archive