Abstract
This chapter completes the CSP language by introducing three operators that allow one process to hand control on to another. In sequential composition P;Q this happens when the first process terminates successfully via a special action ✓. In interrupt \(P\mathrel {\mathord {\triangle }}Q\) this happens when the environment communicates an initial action of Q, and in throw \(P\mathop{ \varTheta _{A}}Q\) any occurrence of an action in A within P counts as an exception which hands control to Q. We study in particular the relationship between termination and parallel composition, and the effect of termination on the semantic models seen in earlier chapters.
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 subscriptionsNotes
- 1.
It was actually this equivalence, claimed but not proved by Hoare, that inspired the author to discover the principles of constructiveness and unique fixed points for CSP in 1979.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag London Limited
About this chapter
Cite this chapter
Roscoe, A.W. (2010). Further Operators. In: Understanding Concurrent Systems. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84882-258-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-84882-258-0_7
Publisher Name: Springer, London
Print ISBN: 978-1-84882-257-3
Online ISBN: 978-1-84882-258-0
eBook Packages: Computer ScienceComputer Science (R0)