Abstract
In this chapter, we apply the theory developed in Chap. 7 to various concrete algebras, viz. PBC, CCS, TCSP, and COSY. We demonstrate that the theory we have developed lends itself to these — at first sight — very different setups. In particular, we argue that it is sufficiently flexible and extensible to describe the key semantic properties of the above algebras.
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
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Best, E., Devillers, R., Koutny, M. (2001). PBC and Other Process Algebras. In: Petri Net Algebra. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04457-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-04457-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08677-9
Online ISBN: 978-3-662-04457-5
eBook Packages: Springer Book Archive