Abstract
Process algebra provides an algebraic description of communicating processes. In this chapter we present a particular algebraic approach to processes, known as ACP (Algebra of Communicating Processes). It is particularly more suited for our aims since it has an arbitrary sequential composition. (The other standard process algebra versions CSP and CCS use prefix composition with atomic elements, only.)
Between two evils choose neither; between two goods, choose both.
Tryon Eduards
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
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Ştefănescu, G. (2000). Process algebra. In: Network Algebra. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0479-7_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0479-7_10
Publisher Name: Springer, London
Print ISBN: 978-1-85233-195-5
Online ISBN: 978-1-4471-0479-7
eBook Packages: Springer Book Archive