Abstract
Modal logics as introduced in Chapter 2 can express local capabilities and necessities of processes such as “tick is a possible next action” or “tick must happen next.” However, they cannot express enduring capabilities such as “tick is always a possible next action” or long term inevitabilities such as “tick eventually happens.” These features, especially in the guise of safety or liveness properties, have been found to be very useful when analysing the behaviour of concurrent systems. Another abstraction from behaviour is a run of a process that is a finite or infinite length sequence of transitions. Runs provide a basis for understanding longer term capabilities. Logics where properties are primarily ascribed to runs of systems are called “temporal” logics. An alternative foundation for temporal logic is to view enduring features as extremal solutions to recursive modal equations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Temporal Properties. 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3550-5_4
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