zbMATH — the first resource for mathematics

CCS semantics via proved transition systems and rewriting logic. (English) Zbl 0917.68126
Kirchner, Claude (ed.) et al., International workshop on Rewriting logic and its applications. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 15, electronic paper No. 18 (1998).
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 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.
For the entire collection see [Zbl 0903.00070].

68Q55 Semantics in the theory of computing
Full Text: Link