A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
From MaRDI portal
Recommendations
- Graph transformation with incremental updates
- From pattern invocation networks to rule preconditions
- Incremental graph pattern matching
- Host-graph-sensitive RETE nets for incremental graph pattern matching
- Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
Cites work
- scientific article; zbMATH DE number 177433 (Why is no real title available?)
- scientific article; zbMATH DE number 219262 (Why is no real title available?)
- Abstract State Machines
- GrGen: A Fast SPO-Based Graph Rewriting Tool
- Graph Transformations
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- The Petri net markup language
- The model transformation language of the VIATRA2 framework
Cited in
(10)- The Edge of Graph Transformation — Graphs for Behavioural Specification
- Incremental graph pattern matching
- GrGen: A Fast SPO-Based Graph Rewriting Tool
- Graph transformation benchmarks
- Pattern graph change oriented incremental graph pattern matching
- Host-graph-sensitive RETE nets for incremental graph pattern matching
- Graph Transformation by Computational Category Theory
- Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
- From pattern invocation networks to rule preconditions
- Graph transformation with incremental updates
This page was built for publication: A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540414)