The Weak Late pi-Calculus Semantics as Observation Equivalence

We show that the Weak Late π-calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, due e.g. to communication, are explicitly handled via suitable constructors. The approach presented here allows to axiomatize the Weak Late π-calculus semantics by simply adding Milner's τ-laws to the proof system for the Strong equivalence. Resorting to Observation equivalence provides a framework which is general enough to allow to recover, in straightforward ways, other bisimulation semantics (e.g. Early, both Strong and Weak, and Dynamic and Branching, both Early and Late).

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

[2]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[3]  Gian Luigi Ferrari,et al.  A Pi-Calculus with Explicit Substitutions: the Late Semantics , 1994, MFCS.

[4]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, CONCUR.

[5]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[6]  Gian Luigi Ferrari,et al.  A Pi-Calculus with Explicit Substitutions , 1996, Theor. Comput. Sci..

[7]  Matthew Hennessy,et al.  Axiomatising Finite Concurrent Processes , 1988, SIAM J. Comput..

[8]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[10]  John McCarthy,et al.  Recursive Functions of Symbolic Expressions , 1983 .

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

[12]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

[13]  Huimin Lin.  Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus , 1995, TAPSOFT.

[14]  Luca Aceto.  On "Axiomatising Finite Concurrent Processes" , 1994, SIAM J. Comput..

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

[16]  Roberto Gorrieri,et al.  An Extended Expansion Theorem , 1991, TAPSOFT, Vol.2.

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

[18]  Ugo Montanari,et al.  Dynamic congruence vs. progressing bisimulation for CCS , 1992, Fundam. Informaticae.

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

[20]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[21]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[22]  Gian-Luigi Ferrari,et al.  Towards a Semantic-based Verification Environment for the pi-calculus, , 1996 .

[23]  Frits W. Vaandrager,et al.  Turning SOS rules into equations , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.