A non-interleaving process calculus for multi-party synchronisation
Logic in Computer Science
2009-12-04 v1 Programming Languages
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
@article{arxiv.0912.0555,
title = {A non-interleaving process calculus for multi-party synchronisation},
author = {Paweł Sobociński},
journal= {arXiv preprint arXiv:0912.0555},
year = {2009}
}