Abstract
Chapters 2-5 presented a standard framework ACPT τ with guarded linear recursion for the specification and manipulation of concurrent processes. Summarising, it consists of basic operators (A, +, •) to define finite processes, communication operators (|| ‖ |) to express parallelism, deadlock and encapsulation (δ, ∂ H ) to force atomic actions into communication, silent step and abstraction (τ, τ I ) to make internal computations invisible, and guarded linear recursion ((X|E>) to capture regular processes. These constructs form a solid basis for the analysis of a wide range of systems.
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 Berlin Heidelberg
About this chapter
Cite this chapter
Fokkink, W. (2000). Protocol Verifications. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-04293-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08584-0
Online ISBN: 978-3-662-04293-9
eBook Packages: Springer Book Archive