No CrossRef data available.
RPO semantics for mobile ambients†
Published online by Cambridge University Press: 26 June 2014
In this paper we focus on the synthesis of labelled transition systems (LTSs) for process calculi using Mobile Ambients (MAs) as a testbed. Our 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), which is an instance of relative pushouts (RPOs). The BC mechanism allows the effective construction of an LTS that has graphs with interfaces as states and labels, and such that the associated bisimilarity is a congruence. We focus here on the analysis of an LTS over processes as graphs with interfaces: we use the LTS on graphs to recover an LTS directly defined over the structure of MA processes and define a set of SOS inference rules capturing the same operational semantics.
- Mathematical Structures in Computer Science , Volume 24 , Issue 4: Structure Transformation , August 2014 , 240404
- Copyright © Cambridge University Press 2014
This research was partially supported by the EU FP7-ICT IP ASCEns (IP 257414) and by the MIUR PRIN SisteR (PRIN 20088HXMYN).