Process Calculus Based Upon Evaluation to Committed Form

An approach to the semantics of CCS-like communicating processes is proposed that is based upon evaluation of processes to input- or output-committed form, with no explicit mention of silent actions. This leads to a co-inductively defined notion of evaluation bisimilarity—a form of weak equivalence which is shown to be a congruence, even in the presence of summation. The relationship between this evaluation-based approach and the more traditional, labelled transition semantics is investigated. In particular, with some restriction on sums, CCS observation equivalence is characterised purely in terms of evaluation to committed form, and evaluation bisimilarity is characterised as a weak delay equivalence. These results are extended to the higher order case, where evaluation bisimilarity coincides with Sangiorgi's weak context bisimilarity. An evaluation-based approach to π-calculus and the relationship with Milner and Sangiorgi's reduction-based notion of barbed bisimulation are also examined.

[1]  Douglas J. Howe Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[2]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[3]  Andrew M. Pitts,et al.  Process Calculus Based upon Evaluation to Committed Form , 1996, CONCUR.

[4]  S. Abramsky The lazy lambda calculus , 1990 .

[5]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[6]  N. S. Barnett,et al.  Private communication , 1969 .

[7]  Douglas J. Howe Equality in lazy computation systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[8]  John H. Reppy,et al.  CML: A Higher-Order Concurrent Language , 1991, PLDI.

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

[10]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[11]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

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

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

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

[15]  Per Martin-Löf,et al.  Constructive mathematics and computer programming , 1984 .

[16]  Robin Milner,et al.  Definition of standard ML , 1990 .

[17]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[18]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[19]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[20]  Matthew Hennessy,et al.  A theory of weak bisimulation for core CML , 1996, ICFP '96.

[21]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[22]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[23]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[24]  Marvin V. Zelkowitz,et al.  Programming Languages: Design and Implementation , 1975 .

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

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

[27]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[28]  David Turner,et al.  Research topics in functional programming , 1990 .