Abstract
Transition systems are introduced as a suitable semantic model of reactive systems. Some notions of behavioral equivalence are discussed, such as isomorphism equivalence, trace equivalence, simulation equivalence and bisimulation equivalence. Internal, unobservable actions are also considered and many behavioral equivalences are suitably adapted for this case.
This is a preview of subscription content, log in via an institution to check access.
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
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gorrieri, R., Versari, C. (2015). Transition Systems and Behavioral Equivalences. In: Introduction to Concurrency Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-21491-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-21491-7_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21490-0
Online ISBN: 978-3-319-21491-7
eBook Packages: Computer ScienceComputer Science (R0)