A non-interleaving process calculus for multi-party synchronisation

16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Sobocinski, P. (2009). A non-interleaving process calculus for multi-party synchronisation. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 12, pp. 87–98). Open Publishing Association. https://doi.org/10.4204/EPTCS.12.6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free