Stronger Validity Criteria for Encoding Synchrony

We analyse two translations from the synchronous into the asynchronous \(\pi \)-calculus, both without choice, that are often quoted as standard examples of valid encodings, showing that the asynchronous \(\pi \)-calculus is just as expressive as the synchronous one. We examine which of the quality criteria for encodings from the literature support the validity of these translations. Moreover, we prove their validity according to much stronger criteria than considered previously in the literature.

[1]  Rob J. van Glabbeek,et al.  On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus , 2018, Inf. Process. Lett..

[2]  Diletta Cacciagrano,et al.  On Synchronous and Asynchronous Communication Paradigms , 2001, ICTCS.

[3]  R. V. Glabbeek.  On the Expressiveness of ACP , 1995 .

[4]  Catuscia Palamidessi,et al.  Separation of synchronous and asynchronous communication via testing , 2006, Theor. Comput. Sci..

[5]  Björn Victor,et al.  A Fully Abstract Encoding of the pi-Calculus with Data Terms , 2005, ICALP.

[6]  Daniele Gorla,et al.  Full abstraction for expressiveness: history, myths and facts † , 2014, Mathematical Structures in Computer Science.

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

[8]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

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

[10]  Thomas Given-Wilson.  On the Expressiveness of Intensional Communication , 2014, EXPRESS/SOS.

[11]  Thomas Given-Wilson,et al.  Expressiveness via Intensionality and Concurrency , 2014, ICTAC.

[12]  G. Boudol,et al.  Notes on Algebraic Calculi of Processes , 1989, Logics and Models of Concurrent Systems.

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

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

[15]  Ehud Shapiro,et al.  Embeddings Among Concurrent Programming Languages (Preliminary Version) , 1992, CONCUR.

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

[17]  Yuxi Fu,et al.  Theory of interaction , 2016, Theor. Comput. Sci..

[18]  Rob J. van Glabbeek,et al.  Analysing and Comparing Encodability Criteria , 2015, EXPRESS/SOS.

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

[20]  Robin Milner.  Functions as Processes , 1990, ICALP.

[21]  Frank D. Valencia,et al.  On the Asynchronous Nature of the Asynchronous pi-Calculus , 2008, Concurrency, Graphs and Models.

[22]  Frits W. Vaandrager,et al.  Expressive Results for Process Algebras , 1992, REX Workshop.

[23]  Axel Legay,et al.  On the Expressiveness of Joining , 2015, ICE.

[24]  Ivan Lanese,et al.  On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi , 2010, ICALP.

[25]  Uwe Nestmann,et al.  On Distributability in Process Calculi , 2013, ESOP.

[26]  Axel Legay,et al.  On the Expressiveness of Symmetric Communication , 2016, ICTAC.

[27]  Rob van Glabbeek.  A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract) , 2018, FoSSaCS.

[28]  David Walker,et al.  On Synchronous and Asynchronous Mobile Processes , 2000, FoSSaCS.

[29]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[30]  Zhengfeng Yang,et al.  A Fully Abstract Encoding for Sub Asynchronous Pi Calculus , 2018, 2018 International Symposium on Theoretical Aspects of Software Engineering (TASE).

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

[32]  Rance Cleaveland,et al.  Divergence and Fair Testing , 1995, ICALP.

[33]  Rob van Glabbeek,et al.  A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract) , 2018, FoSSaCS.

[34]  Daniele Gorla,et al.  A taxonomy of process calculi for distribution and mobility , 2010, Distributed Computing.

[35]  Uwe Nestmann,et al.  Is it a "Good" Encoding of Mixed Choice? (Technical Report) , 2012, FoSSaCS.

[36]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

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

[38]  Jon G. Riecke,et al.  Fully abstract translations between functional languages , 1991, POPL '91.

[39]  Ehud Shapiro,et al.  Separating concurrent languages with categories of language embeddings , 1991, STOC '91.

[40]  Joachim Parrow.  General conditions for full abstraction , 2016, Math. Struct. Comput. Sci..

[41]  Rob J. van Glabbeek,et al.  Musings on Encodings and Expressiveness , 2012, EXPRESS/SOS.

[42]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

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