CCS Semantics via Proved Transition Systems and Rewriting Logic
✍ Scribed by Georgia Carabetta; Pierpaolo Degano; Fabio Gadducci
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 959 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
✦ Synopsis
We consider (a slight v ariant of) the ccs calculus, and we analyze two operational semantics de ned in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We s h o w that the interleaving interpretation of both semantics agree, in that they de ne the same transitions and exhibit the same nondeterministic structure. In addition, we study causality i n ccs computations. We recall the treatment via pts, that exhibits the notion of causality presented in the literature, and we s h o w h o w t o r e c a s t i t i n t h e rl semantics via suitable axioms. 1 The second author has been partly supported by the CNR Progetto Strategico Modelli e M e t o di per la Matematica e l'Ingegneria and by the