CCS Semantics via Proved Transition Systems and Rewriting Logic
Georgia Carabetta, Pierpaolo Degano, Fabio Gadducci · Electronic Notes in Theoretical Computer Science · 1998
We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics 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 nondeterministic structure. In addition, we study causality in ccs computations. We recall the treatment via PTS, that exhibits the notion of causality presented in the literature, and we show how to recast it in the RL semantics via suitable axioms.