Concurrent Rewriting for Graphs with Equivalences
From MaRDI portal
Publication:5756599
Recommendations
Cited in
(14)- A calculus of concurrent graph-rewriting processes
- Modelling calculi with name mobility using graphs with equivalences
- Graph rewriting, constraint solving and tiles for coordinating distributed systems
- Concurrent graph and term graph rewriting
- Formal Methods in Software and Systems Modeling
- scientific article; zbMATH DE number 2242585 (Why is no real title available?)
- Hypergraph construction and its application to the static analysis of concurrent systems
- scientific article; zbMATH DE number 1231489 (Why is no real title available?)
- Parallel Graph Rewriting with Overlapping Rules
- Introducing symmetry to graph rewriting systems with process abstraction
- Ugo Montanari and Graph Transformation
- Ambient graph rewriting
- Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
- Extending graph rewriting with copying
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)