A Compositional Semantics for the Reversible p-Calculus

We introduce a labelled transition semantics for the reversible π-calculus. It is the first account of a compositional definition of a reversible calculus, that has both concurrency primitives and name mobility. The notion of reversibility is strictly linked to the notion of causality. We discuss the notion of causality induced by our calculus, and we compare it with the existing notions in the literature, in particular for what concerns the syntactic feature of scope extrusion, typical of the π-calculus.

[1]  L. Bourgé,et al.  On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes , 1988 .

[2]  Furio Honsell,et al.  Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi , 2009, WADT.

[3]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[4]  Rocco De Nicola,et al.  Back and Forth Bisimulations , 1990, CONCUR.

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

[6]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[7]  Irek Ulidowski,et al.  Reversibility and Models for Concurrency , 2007, Electron. Notes Theor. Comput. Sci..

[8]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[9]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

[10]  Matthew Hennessy,et al.  A theory of processes with localities , 2005, Formal Aspects of Computing.

[11]  C. K. R. T. Jones,et al.  The ϱ-Calculus , 1981, Math. Log. Q..

[12]  Luc Bougé,et al.  On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes , 1988, Acta Informatica.

[13]  Ilaria Castellani.  Observing Distribution in Processes: Static and Dynamic Localities , 1995, Int. J. Found. Comput. Sci..

[14]  Ivan Lanese,et al.  Reversing Higher-Order Pi , 2010, CONCUR.

[15]  Jérôme Feret,et al.  Confidentiality Analysis of Mobile Systems , 2000, SAS.

[16]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[17]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[18]  Davide Sangiorgi,et al.  A fully abstract semantics for causality in the $\pi$-calculus , 1998, Acta Informatica.

[19]  Corrado Priami,et al.  Non-Interleaving Semantics for Mobile Processes , 1999, Theor. Comput. Sci..

[20]  Iain C. C. Phillips,et al.  Reversing algebraic process calculi , 2006, J. Log. Algebraic Methods Program..

[21]  Daniele Varacca,et al.  Event Structure Semantics of Parallel Extrusion in the Pi-Calculus , 2012, FoSSaCS.

[22]  J. Krivine,et al.  Algèbres de Processus Réversibles , 2006 .