Encoding CSP into CCS (Extended Version)

We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous pi-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both encodings satisfy the criteria of Gorla except for compositionality, as both use an additional top-level context. Following the work of Parrow and Sj\"odin, the first encoding uses a central coordinator and establishes a variant of weak bisimilarity between source terms and their translations. The second encoding is decentralised, and thus more efficient, but ensures only a form of coupled similarity between source terms and their translations.

[1]  Uwe Nestmann,et al.  On determinacy and nondeterminacy in concurrent programming , 1996 .

[2]  C. A. R. Hoare.  Why ever CSP? , 2006, Electron. Notes Theor. Comput. Sci..

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

[4]  Peter Sjödin.  From LOTOS specifications to distributed implementations , 1992 .

[5]  Jos C. M. Baeten,et al.  A brief history of process algebra , 2005, Theor. Comput. Sci..

[6]  Robin Milner,et al.  Process Constructors and Interpretations (Invited Paper) , 1986, IFIP Congress.

[7]  Stephen D. Brookes,et al.  On the Relationship of CCS and CSP , 1983, ICALP.

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

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

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

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

[12]  Hugues Evrard,et al.  Automatic Distributed Code Generation from Formal Models of Asynchronous Concurrent Processes , 2015, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[13]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[14]  Ivan Lanese,et al.  Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility , 2006, Electron. Notes Theor. Comput. Sci..

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

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

[17]  Peter Sjödin,et al.  Multiway Synchronization Verified with Coupled Simulation , 1992, CONCUR.

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

[19]  Ed Brinksma,et al.  A tutorial on LOTOS , 1985, PSTV.

[20]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[21]  Uwe Nestmann,et al.  Encoding CSP into CCS , 2015, EXPRESS/SOS.