Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)

  • Authors:

  • Filippo Bonchi;Fabio Gadducci;Giacoma Valentina Monreale

  • Affiliations:

  • Dipartimento di Informatica, Università di Pisa, largo Pontecorvo 3c, I-56127 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, largo Pontecorvo 3c, I-56127 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, largo Pontecorvo 3c, I-56127 Pisa, Italy

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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 Konig 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.