Abstract
Atomic actions and the operators alternative and sequential composition from the previous chapter provide relatively primitive tools to construct an LTS. In general, the size of a basic process term is comparable to the size of the related process graph. This chapter introduces operators to express parallelism and concurrency, which enable us to capture a large process graph by means of a comparatively small process term.
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
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fokkink, W. (2000). Algebra of Communicating Processes. In: Introduction to Process Algebra. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04293-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-04293-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08584-0
Online ISBN: 978-3-662-04293-9
eBook Packages: Springer Book Archive