Abstract
Temporal logic model-checking has received substantial academic interest and has enjoyed wide industrial acceptance. Temporal logics are used to describe the behavior (over time) of systems which continuously interact with their environment. Model-checking algorithms are used to decide if a finite-state system satisfies a temporal logic formula. Many temporal logics, e.g., CTL, LTL, and CTL* can be translated into the Mu-Calculus. In addition, the algorithm that decides the Mu-Calculus is used for symbolic (BDD-based) model-checking, a technique that has greatly extended the applicability of model-checking. In this case study we define a model-checker for the Mu-Calculus in ACL2 and show how to translate CTL into the Mu-Calculus.
In the process of defining the Mu-Calculus, we develop (ACL2) books on set theory, fixpoint theory, and relation theory. The development of these books is given as a sequence of exercises. These exercises make use of varied ACL2 features; therefore, the first few sections may be of interest to readers who want more practice in proving theorems in ACL2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Manolios, P. (2000). Mu-Calculus Model-Checking. In: Kaufmann, M., Manolios, P., Moore, J.S. (eds) Computer-Aided Reasoning. Advances in Formal Methods, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3188-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3188-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4981-3
Online ISBN: 978-1-4757-3188-0
eBook Packages: Springer Book Archive