Ambient graph rewriting
From MaRDI portal
Publication:2849869
zbMATH Open1272.68169MaRDI QIDQ2849869FDOQ2849869
Authors: Pietro Cenciarelli, Ivano Talamo, Alessandro Tiberi 
Publication date: 20 September 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104053071
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
Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (7)
- On the expressiveness of the \(\pi \)-calculus and the mobile ambients
- On the expressiveness of \(\pi\)-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
- A decentralised graphical implementation of mobile ambients
- Title not available (Why is that?)
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)
