A Decentralized Implementation of Mobile Ambients

DOI10.1007/978-3-540-87405-8_9zbMath1175.68279OpenAlexW2137241606MaRDI QIDQ3540392

Fabio Gadducci, Giacoma Valentina Monreale

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_9

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (4)

A decentralised graphical implementation of mobile ambients ⋮ Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) ⋮ RPO semantics for mobile ambients ⋮ On the Expressiveness of the π-Calculus and the Mobile Ambients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient abstract machine for safe ambients
• Mobile ambients
• Normal forms for algebras of connections.
• BioAmbients: an abstraction for biological compartments
• A spatial logic for concurrency. I
• An algebraic presentation of term graphs, via gs-monoidal categories
• Pure bigraphs: structure and dynamics
• Bigraphs and transitions
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Behavioral theory for mobile ambients
• Process Bisimulation Via a Graphical Encoding
• Handbook of Graph Grammars and Computing by Graph Transformation
• A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
• Graph rewriting for the π-calculus

This page was built for publication: A Decentralized Implementation of Mobile Ambients