A non-interleaving process calculus for multi-party synchronisation

Paweł Sobociński
(ECS, University of Southampton)

We introduce the wire calculus. Its dynamic features are inspired by Milner's CCS: a unary prefix operation, binary choice and a standard recursion construct. Instead of an interleaving parallel composition operator there are operators for synchronisation along a common boundary and non-communicating parallel composition. The (operational) semantics is a labelled transition system obtained with SOS rules. Bisimilarity is a congruence with respect to the operators of the language. Quotienting terms by bisimilarity results in a compact closed category.

In Filippo Bonchi, Davide Grohmann, Paola Spoletini and Emilio Tuosto: Proceedings 2nd Interaction and Concurrency Experience Structured Interactions (ICE 2009), Bologna, Italy, 31st August 2009, Electronic Proceedings in Theoretical Computer Science 12, pp. 87–98.
Published: 3rd December 2009.

ArXived at: https://dx.doi.org/10.4204/EPTCS.12.6 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org