Abstract
In this chapter we introduce the basic framework that will be used throughout the whole monograph. We introduce labelled transition systems together with two composition operators, abstraction and parallel composition. We then proceed discussing useful equivalences on this model, essentially recalling the motivation for strong and weak bisimilarity. We also sketch efficient algorithms to compute these equivalences. The contents of this chapter is a collection from [145], [27], [154], [125], [86], [76], [73], [22]. Its purpose is to give an intuitive understanding of the key features of process algebra. A reader familiar this features is invited to fleetingly glance through this chapter in order to catch a glimpse of the notations used.
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
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hermanns, H. (2002). Interactive Processes. In: Interactive Markov Chains. Lecture Notes in Computer Science, vol 2428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45804-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-45804-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44261-5
Online ISBN: 978-3-540-45804-3
eBook Packages: Springer Book Archive