Abstract
In this chapter, we will review the process algebra without timing, known as ACP (Algebra of Communicating Processes), introduced in [21]. The purpose is primarily to acquire a good insight into the basic concepts of ACP-style process algebras in a setting without timing. ACP can be regarded as the core of all process algebras with timing presented in this book. Because it is much simpler than its generalizations with timing, ACP is more suitable to discuss elementary issues.
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
Baeten, J.C.M., Middelburg, C.A. (2002). No Timing. In: Process Algebra with Timing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04995-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-04995-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07788-3
Online ISBN: 978-3-662-04995-2
eBook Packages: Springer Book Archive