Ambient graph rewriting
From MaRDI portal
Recommendations
- A LTS semantics of ambients via graph synchronization with mobility
- 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
- A decentralised graphical implementation of mobile ambients
- Concurrent Rewriting for Graphs with Equivalences
- Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
Cited in
(7)- On the expressiveness of the -calculus and the mobile ambients
- On the expressiveness of -calculus for encoding mobile ambients
- A Decentralized Implementation of Mobile Ambients
- Network Applications of Graph Bisimulation
- Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
- Synchronized hyperedge replacement with name mobility. A graphical calculus for mobile systems
- A decentralised graphical implementation of mobile ambients
This page was built for publication: Ambient graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849869)