A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
From MaRDI portal
Publication:3540414
DOI10.1007/978-3-540-87405-8_27zbMath1175.68215WikidataQ57090121 ScholiaQ57090121MaRDI QIDQ3540414
Gábor Bergmann, István Ráth, Ákos Horváth, Dániel Varró
Publication date: 20 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_27
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q42: Grammars and rewriting systems
Related Items
Graph transformation benchmarks, The Edge of Graph Transformation — Graphs for Behavioural Specification, Graph Transformation by Computational Category Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The model transformation language of the VIATRA2 framework
- GrGen: A Fast SPO-Based Graph Rewriting Tool
- Handbook of Graph Grammars and Computing by Graph Transformation
- Abstract State Machines
- Handbook of Graph Grammars and Computing by Graph Transformation
- Graph Transformations
- The Petri Net Markup Language