Ambient graph rewriting
From MaRDI portal
Publication:2849869
Recommendations
- scientific article; zbMATH DE number 2044490
- 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)- A decentralised graphical implementation of mobile ambients
- On the expressiveness of \(\pi\)-calculus for encoding mobile ambients
- scientific article; zbMATH DE number 1863162 (Why is no real title available?)
- A Decentralized Implementation of Mobile Ambients
- On the expressiveness of the \(\pi \)-calculus and the mobile ambients
- Network Applications of Graph Bisimulation
- Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
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)