Michele Boreale & Davide Sangiorgi (1998):
A fully abstract semantics for causality in the π-calculus.
Acta Inf. 35(5),
pp. 353–400,
doi:10.1007/s002360050124.
Gérard Boudol (1992):
Asynchrony and the π-calculus (note).
Note.
INRIA.
Marco Carbone & Sergio Maffeis (2003):
On the Expressive Power of Polyadic Synchronisation in π-Calculus.
Nordic Journal of Computing 10(2),
pp. 70–98.
Cédric Fournet & Georges Gonthier (1996):
The Reflexive Chemical Abstract Machine and the Join-Calculus.
In: Proceedings of POPL '96.
ACM,
pp. 372–385,
doi:10.1145/237721.237805.
Daniele Gorla (2008):
Comparing Communication Primitives via their Relative Expressive Power.
Inf. & Comp. 206(8),
pp. 931–952,
doi:10.1016/j.ic.2008.05.001.
Daniele Gorla (2010):
Towards a Unified Approach to Encodability and Separation Results for Process Calculi.
Inf. & Comp. 208(9),
pp. 1031–1053,
doi:10.1016/j.ic.2010.05.002.
Kohei Honda (1992):
Notes on Soundness of a Mapping from π-calculus to ν-calculus.
With comments added in October 1993.
Kohei Honda & Mario Tokoro (1991):
An Object Calculus for Asynchronous Communication.
In: ECOOP'91,
LNCS 512.
Springer Berlin / Heidelberg,
pp. 133–147,
doi:10.1007/BFb0057019.
Uwe Nestmann (1998):
On the Expressive Power of Joint Input.
In: Catuscia Palamidessi & Ilaria Castellani: Proceedings of EXPRESS '98,
ENTCS 16.2.
Elsevier Science Publishers,
doi:10.1016/S1571-0661(04)00123-9.
Uwe Nestmann (2000):
What is a "Good" Encoding of Guarded Choice?.
Inf. & Comp. 156(1-2),
pp. 287–319,
doi:10.1006/inco.1999.2822.
Catuscia Palamidessi (2003):
Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculi.
MSCS 13(5),
pp. 685–719,
doi:10.1017/S0960129503004043.
Joachim Parrow (2008):
Expressiveness of Process Algebras.
ENTCS 209,
pp. 173–186,
doi:10.1016/j.entcs.2008.04.011.
eptcs@eptcs.org