CCS Semantics via Proved Transition Systems and Rewriting Logic

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 th...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science 1998, Vol.15, p.369-387
Main Authors: Carabetta, Georgia, Degano, Pierpaolo, Gadducci, Fabio
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 viaPTS, that exhibits the notion of causality presented in the literature, and we show how to recast it in the RL semantics via suitable axioms.
ISSN:1571-0661
1571-0661
DOI:10.1016/S1571-0661(05)80023-4