CCS Semantics via Proved Transition Systems and Rewriting Logic (1998)
| Venue: | In Kirchner and Kirchner [47 |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Carabetta98ccssemantics,
author = {Georgia Carabetta and Pierpaolo Degano and Fabio Gadducci},
title = {CCS Semantics via Proved Transition Systems and Rewriting Logic},
booktitle = {In Kirchner and Kirchner [47},
year = {1998},
pages = {253--272},
publisher = {Elsevier}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1 Introduction Concurrency is maybe the basic aspect of the operational interpretation of rewriting logic. And as Jos'e Meseguer says in his lecture at concur'96 [20], . . . my main emphasis in this talk will be on rewriting logic as a semantic framework for concurrency. . . . The goal is . . . to express as faithfully as possible each model [of concurrency] on its own terms, avoiding any encodings or tr...
