A Well-behaved LTS for the Pi-calculus: (Abstract)

The pi-calculus and its many variations have received much attention in the literature. We discuss the standard early labelled transition system (lts) and outline an approach which decomposes the system into two components, one of which is presented in detail. The advantages of using the decomposition include a more complete understanding of the treatment of bound outputs in Pi as well as an lts which is more robust with respect to the addition and removal of language features. The present paper serves as an overview of some of the techniques involved and some of the goals of the ongoing work.

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

[2]  Mogens Nielsen,et al.  A calculus of communicating systems with label passing - ten years after , 2000, Proof, Language, and Interaction.

[3]  Peter Sewell,et al.  Models for name-passing processes: interleaving and causal , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[4]  Marco Pistore,et al.  Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation , 2002, FoSSaCS.

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

[6]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

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

[8]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[9]  Dale Miller,et al.  A Congruence Format for Name-passing Calculi , 2006, SOS@ICALP.

[10]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[11]  Sam Staton,et al.  Comparing Operational Models of Name-Passing Process Calculi , 2004, CMCS.

[12]  Vladimiro Sassone,et al.  Labels from Reductions: Towards a General Theory , 2005, CALCO.