We propose a graphical implementation for (possibly recursive) processes of the pi-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewriting mechanisms for modelling the reduction semantics of the calculus.
Autori interni: | ||
Autori: | Gadducci F. | |
Titolo: | Graph rewriting for the π-calculus | |
Anno del prodotto: | 2007 | |
Digital Object Identifier (DOI): | 10.1017/S096012950700610X | |
Appare nelle tipologie: | 1.1 Articolo in rivista |
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.