A causal semantics for CCS via rewriting logic

We consider two operational semantics for CCS defined in the literature: the first exploits proved transition systems (PTS) and the second rewriting logic (RL). We show that the interleaving interpretation of both semantics agree, in that they define the same transitions and exhibit the same non-deterministic structure. In addition, we study causality in CCS computations. We recall its treatment via PTS, exhibiting the notion of causality presented in the literature, and we show how to recast it in the RL semantics via suitable axioms. Also in this case, the two semantics agree.

[1]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[2]  Cosimo Laneve,et al.  Axiomatizing Permutation Equivalence in the Lambda-Calculus , 1992, ALP.

[3]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[4]  Fabio Gadducci,et al.  Relating Two Categorial Models of Term Rewriting , 1995, RTA.

[5]  Fabio Gadducci,et al.  CCS semantics via proved transition systems and rewriting logic , 1998, WRLA.

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

[7]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

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

[9]  G Boudol.  Computational semantics of term rewriting systems , 1986 .

[10]  Fabio Gadducci,et al.  Tiles, rewriting rules and CCS , 1996, WRLA.

[11]  Fabio Gadducci,et al.  Causality and Replication in Concurrent Processes , 2003, Ershov Memorial Conference.

[12]  John C. Reynolds,et al.  Algebraic Methods in Semantics , 1985 .

[13]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[14]  Fabio Gadducci,et al.  On The Algebraic Approach To Concurrent Term Rewriting , 1996 .

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

[16]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[17]  Fabio Gadducci,et al.  CPO Models for Infinite Term Rewriting , 1995, AMAST.

[18]  Shlomo Nir,et al.  NATO ASI Series , 1995 .

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

[20]  Corrado Priami,et al.  Proved Trees , 1992, ICALP.

[21]  Rocco De Nicola,et al.  A Partial Ordering Semantics for CCS , 1990, Theor. Comput. Sci..

[22]  Fabio Gadducci,et al.  Rational Term Rewriting , 1998, FoSSaCS.

[23]  Corrado Priami,et al.  Enhanced operational semantics , 1996, CSUR.

[24]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

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