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.

A causal semantics for CCS via rewriting logic

DEGANO, PIERPAOLO;GADDUCCI, FABIO;Priami C.
2002

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.
Degano, Pierpaolo; Gadducci, Fabio; Priami, C.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/177863
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 11
social impact