HAL : hal-00573001, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

RPO Semantics for Mobile Ambients

Filippo Bonchi (  Auteur correspondant ) 1, Fabio Gadducci 2, Valentina Monreale 3

(02/03/2011)

The paper focuses on the synthesis of labelled transition systems (LTSs) for process calculi, choosing as testbed Mobile Ambients (MAs). The proposal is based on a graphical encoding: a process is mapped into a graph equipped with interfaces, such that the denotation is fully abstract with respect to the standard structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (BCs), an instance of relative pushouts (RPOs). The BC mechanism allows the effective construction of a LTS that has graphs with interfaces as states and labels, and such that the associated bisimilarity is a congruence. Our paper focuses on the analysis of a LTS over processes as graphs with interfaces: we use the LTS on graphs to recover a LTS directly defined over the structure of MAs processes, further defining a set of SOS inference rules capturing the same operational semantics.

1 :	Laboratoire de l'Informatique du Parallélisme (LIP)
	Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I
2 :	Department of Computer Science, University of Pisa (DIPI)
	universi
3 :	Dipartimento di Informatica [Pisa] (DI)
	University of Pisa

Équipe de recherche : Plume

Domaine

:

Informatique/Logique en informatique

Mots Clés : Graph Rewriting – Deriving Labeled Transition Systems – Ambient Calculus

hal-00573001, version 1

http://hal.archives-ouvertes.fr/hal-00573001

oai:hal.archives-ouvertes.fr:hal-00573001

Contributeur : Filippo Bonchi <>

Soumis le : Mercredi 2 Mars 2011, 17:07:22

Dernière modification le : Jeudi 7 Mars 2013, 22:26:59