A decentralised graphical implementation of mobile ambients
From MaRDI portal
Publication:624388
DOI10.1016/j.jlap.2010.10.002zbMath1207.68224MaRDI QIDQ624388
Fabio Gadducci, Giacoma Valentina Monreale
Publication date: 9 February 2011
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2010.10.002
process calculi; reduction semantics; structural congruence; graph transformation; graphical encodings
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient abstract machine for safe ambients
- Synthesising CCS bisimulation using graph rewriting
- 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
- Double-pushout graph transformation revisited
- Bigraphs and transitions
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- A Decentralized Implementation of Mobile Ambients
- Reactive Systems, Barbed Semantics, and the Mobile Ambients
- 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
