Abstract
This paper, and the preceding one, survey two types of formalism which has proved to be particularly successful for efficient automatic verification, or “model checking”, of concurrent systems. In the previous paper we considered branching time propositional temporal logics, and now we turn to a more general formalism, the propositional μ-calculus. The emphasis, as before, is on a broad understanding rather than on technical details.
Research supported by a grant from the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bradfield, J. Stirling, C. (1990): Local model checking for infinite state spaces. Report no. ECS-LFCS-90-115, Laboratory for Foundations of Computer Science, University of Edinburgh.
Cleaveland, R. (1990): Tableau-based model checking in the propositional mu-calculus. Acta Informatica 27, 725–747
Cleaveland, R. (1992): The Concurrency Workbench. In this volume.
Emerson, E.A., Lei, C.-L. (1986): Efficient model checking in fragments of the propositional mu-calculus (Extended abstract). In: Proc. IEEE Symp. on Logic in Computer Science, June 1986, Cambridge, MA, pp. 267–278
Stirling, C., Walker, D. (1991): Local model checking in the modal mu-calculus. Theoretical Computer Science 89, 161–177.
Winskel, G. (1989): A note on model checking the modal ν-calculus. In: 16th International Colloq. on Automata, Languages and Programming, Stresa, Italy, July 1989 (ed. G. Ausiello, M. Desani-Ciancaglini, S. Ronchi della Rocca). Lecture Notes in Conputer Science, vol. 372, Springer-Verlag, pp. 761–772
J.I. Zucker (1992): Propositional temporal logics and their use in model checking. In this volume.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zucker, J. (1993). The propositional μ-calculus and its use in model checking. In: Lauer, P.E. (eds) Functional Programming, Concurrency, Simulation and Automated Reasoning. Lecture Notes in Computer Science, vol 693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56883-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-56883-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56883-4
Online ISBN: 978-3-540-47776-1
eBook Packages: Springer Book Archive