Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
From MaRDI portal
Publication:2355681
DOI10.1016/j.tcs.2015.01.034zbMath1328.68103OpenAlexW2254742387MaRDI QIDQ2355681
Reiko Heckel, Leila Ribeiro, Rodrigo Machado
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.034
Related Items (3)
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Graph grammars according to the type of input and manipulated data: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Verification of graph grammars using a logical approach
- Algebraic approach to single-pushout graph transformation
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Fundamentals of algebraic graph transformation
- Double-pushout graph transformation revisited
- Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions
- 15 Years of Triple Graph Grammars
- Sesqui-Pushout Rewriting
- Conflict Detection for Graph Transformation with Negative Application Conditions
- Toposes Are Adhesive
- Handbook of Graph Grammars and Computing by Graph Transformation
- The category of typed graph grammars and its adjunctions with categories of derivations
- On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH
- Delaying Constraint Solving in Symbolic Graph Transformation
- Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
- Handbook of Graph Grammars and Computing by Graph Transformation
- Graph Transformations
- Foundations of Software Science and Computation Structures
- Adhesive and quasiadhesive categories
- Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
This page was built for publication: Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
