Bonchi, Filippo and Gadducci, Fabio and Monreale, Giacoma Valentina (2008) Labeled Transitions for Mobile Ambients. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Other (GZip) Available under License Creative Commons Attribution No Derivatives. Download (690Kb) |
Abstract
The paper presents a case study on the synthesis of labelled transition systems (LTSs) for process calculi, choosing as testbed Cardelli and Gordon's Mobile Ambients (MAs). The proposal is based on a graphical encoding: each process is mapped into a graph equipped with suitable interfaces, such that the denotation is fully abstract with respect to the usual structural congruence. Graphs with interfaces are amenable to the synthesis mechanism proposed by Ehrig and Koenig and based on borrowed contexts (BCs), an instance of relative pushouts, introduced by Leifer and Milner. The BC mechanism allows the effective construction of a LTS that has graphs with interfaces as both states and labels, and such that the associated bisimilarity is automatically a congruence. Our paper focuses on the analysis of a LTS over (processes as) graphs with interfaces, as distilled by exploiting the graphical encoding of MAs. In particular, we use the LTS on graphs to recover a suitable LTS directly defined over the structure of MAs processes.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | graph rewriting; labeled transition systems; nominal calculi; borrowed contexts; mobile ambients |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 04 Dec 2014 14:26 |
Last Modified: | 04 Dec 2014 14:26 |
URI: | http://eprints.adm.unipi.it/id/eprint/2213 |
Repository staff only actions
View Item |