A causal semantics for CCS via rewriting logic☆

https://doi.org/10.1016/S0304-3975(01)00165-7Get rights and content
Under an Elsevier user license
open archive

Abstract

We consider two operational semantics for CCS 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 non-deterministic structure. In addition, we study causality in CCS computations. We recall its treatment via PTS, exhibiting the notion of causality presented in the literature, and we show how to recast it in the RL semantics via suitable axioms. Also in this case, the two semantics agree.

Keywords

Rewriting logic
Process algebra
Causal semantics

Cited by (0)

☆

Research partly supported by the Italian CNR Progetto Strategico Modelli e Metodi per la Matematica e l'Ingegneria and MURST Progetto Tecniche Formali % la Specifica, l'Analisi, la Verifica, la Sintesi e la Trasformazione di Sistemi Software. Research partly carried out during the stay of the second author at the Division of Informatics, University of Edinburgh, Scotland, sponsored by the British EPSRC Grant no. R29375.

Copyright © 2002 Elsevier Science B.V. All rights reserved.