Abstract
In the previous chapter we saw that modal formulas are not very expressive. They can not capture enduring traits of processes, the properties definable within temporal logic. However, these longer term properties can be viewed as closure conditions on immediate capabilities and necessities that modal logic captures. By permitting recursive modal equations, these temporal properties are expressible as extremal solutions of such equations. The property “whenever a coin is inserted, eventually an item is collected” is expressed using two recursive modal equations with different solutions. In the previous chapter, least and greatest solutions to recursive modal equations were represented using the fixed point quantifiers μZ and υZ. In this chapter we shall explicitly add these connectives to modal logic, thereby providing a very rich temporal logic.
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
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stirling, C. (2001). Modal Mu-Calculus. In: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3550-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3550-5_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3153-5
Online ISBN: 978-1-4757-3550-5
eBook Packages: Springer Book Archive