On the Expressive Power of Joint Input
Uwe Nestmann · Electronic Notes in Theoretical Computer Science · 1998
The join-calculus was introduced as an ‘extended subset’ of the asynchronous π-calculus by amalgamating the three operators for input, restriction, and replication into a single operator, called definition, but with the additional capability to describe the atomic joint reception of values from two different channels. In this paper, we just extend the asynchronous π-calculus with joint input. By studying its expressive power, using slight variations of previously investigated choice encodings, we also conclude on the expressiveness of the join-calculus.