Concurrent Rewriting for Graphs with Equivalences
DOI10.1007/11817949_19zbMATH Open1151.68503OpenAlexW2115225874MaRDI QIDQ5756599FDOQ5756599
Authors: Paolo Baldan, Fabio Gadducci, Ugo Montanari 
Publication date: 4 September 2007
Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817949_19
Recommendations
Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (14)
- Ambient graph rewriting
- Extending graph rewriting with copying
- A calculus of concurrent graph-rewriting processes
- Hypergraph construction and its application to the static analysis of concurrent systems
- Title not available (Why is that?)
- Formal Methods in Software and Systems Modeling
- Ugo Montanari and Graph Transformation
- Concurrent graph and term graph rewriting
- Parallel Graph Rewriting with Overlapping Rules
- Introducing symmetry to graph rewriting systems with process abstraction
- Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
- Title not available (Why is that?)
- Modelling calculi with name mobility using graphs with equivalences
- Graph rewriting, constraint solving and tiles for coordinating distributed systems
This page was built for publication: Concurrent Rewriting for Graphs with Equivalences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756599)
