A new formulation of the pi-calculus, where name instantiation is handled explicitly via the introduction of a suitable combinator, is presented. The bisimulation semantics originally developed for the pi-calculus are retrieved by giving the description of the corresponding strategies for name instantiation. The explicit handling of name instantiation allows us to reduce the pi-calculus transitional semantics to a standard SOS framework. Hence, pi-calculus bisimulation models can take fully advantage of the SOS meta-theory developed for ‘static’ process calculi. For instance, complete axiomatic characterizations of pi-calculus bisimulation equivalences can be automatically derived by turning SOS rules into equations. This formulation of the pi-calculus is very promising for the development of semantic-based automatic verification tools.
Scheda prodotto non validato
I dati visualizzati non sono stati ancora sottoposti a validazione formale da parte dello Staff di IRIS, ma sono stati ugualmente trasmessi al Sito Docente Cineca (Loginmiur).
Titolo: | A pi-calculus with explicit substitutions |
Autori: | G., Ferrari; U., Montanari; Quaglia, Paola |
Autori Unitn: | |
Titolo del periodico: | THEORETICAL COMPUTER SCIENCE |
Anno di pubblicazione: | 1996 |
Numero e parte del fascicolo: | 1 |
Codice identificativo Scopus: | 2-s2.0-0030289746 |
Codice identificativo ISI: | WOS:A1996VU91000005 |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/S0304-3975(96)00063-1 |
Handle: | http://hdl.handle.net/11572/95191 |
Appare nelle tipologie: | 03.1 Articolo su rivista (Journal article) |