We propose a graphical implementation for (possibly) recursive processes of the pi-calculus, encoding each process into a term graph. Our implementation is sound and complete with respect to the standard structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into isomorphic term graphs. Most importantly, the encoding allows for using standard graph rewriting mechanisms in modelling the reduction semantics of the calculus.
Term graph rewriting for the π-calculus
GADDUCCI, FABIO
2003-01-01
Abstract
We propose a graphical implementation for (possibly) recursive processes of the pi-calculus, encoding each process into a term graph. Our implementation is sound and complete with respect to the standard structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into isomorphic term graphs. Most importantly, the encoding allows for using standard graph rewriting mechanisms in modelling the reduction semantics of the calculus.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
aplas2003.pdf
solo utenti autorizzati
Tipologia:
Versione finale editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
402.41 kB
Formato
Adobe PDF
|
402.41 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
