Abstract
In this chapter a Hennessy-Milner style modal logic for specifying properties of processes is introduced. These properties express specific capabilities of a process. After the definition of the syntax of this logic and its semantics with respect to processes or labelled transition systems, the power of this logic in distinguishing processes is illustrated by a number of examples, including the vending machines from the previous chapter. It is shown that any property expressed in this logic can be expressed without negation. Next, the logic is related to bisimulation equivalence; specifically, it is shown that no formula of modal depth n can distinguish n-game equivalent processes on that system. Characteristic formulae for processes are explored, as well as an alternative approach to defining the semantics of properties.
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
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Moller, F., Struth, G. (2013). Logical Properties of Processes. In: Modelling Computing Systems. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84800-322-4_14
Download citation
DOI: https://doi.org/10.1007/978-1-84800-322-4_14
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84800-321-7
Online ISBN: 978-1-84800-322-4
eBook Packages: Computer ScienceComputer Science (R0)