A decentralised graphical implementation of mobile ambients

Habel, 2001, Double-pushout graph transformation revisited, Math. Structures Comput. Sci., 11, 637, 10.1017/S0960129501003425 Baldan, 1998, An event structure semantics for P/T contextual nets: asymmetric event structures, vol. 1378, 63 Bonchi, 2009, Synthesising CCS bisimulation using graph rewriting, Inform. and Comput., 207, 14, 10.1016/j.ic.2008.10.005 Bonchi, 2009, Reactive systems barbed semantics and the mobile ambients, vol. 5504, 272 Bruni, 2002, Normal forms for algebras of connections, Theoret. Comput. Sci., 286, 247, 10.1016/S0304-3975(01)00318-8 Caires, 2003, A spatial logic for concurrency (part I), Inform. and Comput., 186, 194, 10.1016/S0890-5401(03)00137-8 Cardelli, 2000, Mobile ambients, Theoret. Comput. Sci., 240, 177, 10.1016/S0304-3975(99)00231-5 Cenciarelli, 2005, Ambient graph rewriting, vol. 117, 335 Corradini, 1999, An algebraic presentation of term graphs, via gs-monoidal categories, Appl. Categ. Structures, 7, 299, 10.1023/A:1008647417502 Corradini, 1996, Graph processes, Fund. Inform., 26, 241, 10.3233/FI-1996-263402 Corradini, 1997, Algebraic approaches to graph transformation I: basic concepts and double pushout approach, vol. 1, 163 Drewes, 1997, Hyperedge replacement graph grammars, vol. 1, 95 Ehrig, 2006, Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts, Math. Structures Comput. Sci., 16, 1133, 10.1017/S096012950600569X Ferrari, 2001, A LTS semantics of ambients via graph synchronization with mobility, vol. 2202, 1 Gadducci, 2007, Graph rewriting for the π-calculus, Math. Structures Comput. Sci., 17, 407, 10.1017/S096012950700610X Gadducci, 2008, A decentralized implementation of mobile ambients, vol. 5214, 115 Gadducci, 2001, A concurrent graph semantics for mobile ambients, vol. 45 Hirschkoff, 2007, An efficient abstract machine for safe ambients, J. Logic Algebraic Programming, 71, 114, 10.1016/j.jlap.2007.02.003 O. Jensen, R. Milner, Bigraphs and Mobile Processes, Technical Report 580, Computer Laboratory, University of Cambridge, 2003. Levi, 2003, Mobile safe ambients, ACM Trans. Program. Lang. Syst., 25, 1, 10.1145/596980.596981 Milner, 2006, Pure bigraphs: structure and dynamics, Inform. and Comput., 204, 60, 10.1016/j.ic.2005.07.003 N. Mylonakis, F Orejas, Another fully abstract graph semantics for the ambient calculus, Presented at Graph Transformation – Verification and Concurrency 2007. Regev, 2004, Bioambients: an abstraction for biological compartments, Theoret. Comput. Sci., 325, 141, 10.1016/j.tcs.2004.03.061