Is it a "Good" Encoding of Mixed Choice? (Technical Report)

Mixed choice is a widely-used primitive in process calculi. It is interesting, as it allows to break symmetries in distributed process networks. We present an encoding of mixed choice in the context of the π-calculus and investigate to what extent it can be considered "good". As a crucial novelty, we introduce a suitable criterion to measure whether the degree of distribution in process networks is preserved.

[1]  Ivan Lanese,et al.  Concurrent and Located Synchronizations in pi-Calculus , 2007, SOFSEM.

[2]  Uwe Nestmann,et al.  Breaking Symmetries , 2010, EXPRESS.

[3]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[4]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[5]  Uwe Nestmann,et al.  Is it a , 2012 .

[6]  Sergio Maffeis,et al.  On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

[7]  Daniele Gorla.  Towards a unified approach to encodability and separation results for process calculi , 2010, Inf. Comput..

[8]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[9]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and the asynchronous π-calculus , 1998, POPL '97.

[10]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.

[11]  Daniele Gorla,et al.  Towards a unified approach to encodability and separation results for process calculi , 2008, Inf. Comput..

[12]  Uwe Nestmann.  What is a ‘Good’ Encoding of Guarded Choice? , 1997 .

[13]  G. Erard Boudol.  Asynchrony and the -calculus (note) , 1992 .

[14]  Uwe Nestmann,et al.  Synchrony vs Causality in the Asynchronous Pi-Calculus , 2011, EXPRESS.

[15]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

[16]  Pierre America,et al.  ECOOP'91 European Conference on Object-Oriented Programming , 1991, Lecture Notes in Computer Science.

[17]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[18]  Benjamin C. Pierce,et al.  Decoding Choice Encodings , 1999 .

[19]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .