Modelling calculi with name mobility using graphs with equivalences
From MaRDI portal
Recommendations
- Concurrent Rewriting for Graphs with Equivalences
- 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
- Graph rewriting for the π-calculus
- scientific article; zbMATH DE number 2242585
- Term graph rewriting for the \(\pi \)-calculus.
Cites work
- A calculus of mobile processes. II
- 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
- Adhesive and quasiadhesive categories
- Concurrent Rewriting for Graphs with Equivalences
- Formal Methods in Software and Systems Modeling
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 1759424 (Why is no real title available?)
- scientific article; zbMATH DE number 919845 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Mobile ambients
- Parallelism and concurrency in high-level replacement systems
- Term graph rewriting for the \(\pi \)-calculus.
Cited in
(5)
This page was built for publication: Modelling calculi with name mobility using graphs with equivalences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867900)