We extend the π-calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of π-calculus, we suggest that it permits divergence-free encodings of distributed calculi, and we show that a limited form of polyadic synchronisation can be encoded weakly in π-calculus. After showing that matching cannot be derived in π-calculus, we compare the expressivity of polyadic synchronisation, mixed choice and matching. In particular we show that the degree of synchronisation of a language increases its expressive power by means of a separation result in the style of Palamidessi's result for mixed choice.  ACM CCS Categories and
In REF Carbone and Maffeis examines the expressive power of a π-calculus with polyadic synchronisation, which is a generalisation of the communication mechanism of the π-calculus that allows channel names to be composite, like the addresses in Homer.
On the Expressive Power of Polyadic Synchronisation in pi-calculus
Nord. J. Comput.
Computer Science Mathematics