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

DOI10.1016/j.entcs.2009.06.014zbMath1291.68281OpenAlexW2041803551MaRDI QIDQ5170667

Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale

Publication date: 23 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.014

zbMATH Keywords

labelled transition systemmobile ambientsborrowed contexts

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ Reactive Systems, Barbed Semantics, and the Mobile Ambients ⋮ Synthesising CCS bisimulation using graph rewriting

Cites Work

• Mobile ambients
• BioAmbients: an abstraction for biological compartments
• An algebraic presentation of term graphs, via gs-monoidal categories
• Pure bigraphs: structure and dynamics
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Behavioral theory for mobile ambients
• Coalgebraic Models for Reactive Systems
• A Decentralized Implementation of Mobile Ambients
• Deriving Structural Labelled Transitions for Mobile Ambients
• Composition and Decomposition of DPO Transformations with Borrowed Context
• Process Bisimulation Via a Graphical Encoding
• Equational properties of mobile ambients
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)