Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
From MaRDI portal
Publication:1734517
DOI10.1016/j.jlamp.2018.11.004zbMath1417.68078OpenAlexW2900478167MaRDI QIDQ1734517
Gabriele Taentzer, Jens Kosiol, Daniel Strüber, Leen Lambers, Kristopher Born
Publication date: 27 March 2019
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2018.11.004
Related Items (5)
Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Graph Consistency as a Graduated Property ⋮ Preface to the special issue on the 10th international conference on graph transformation ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the essence and initiality of conflicts
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
- Initial conflicts and dependencies: critical pairs revisited
- Fundamentals of algebraic graph transformation
- RuleMerger: Automatic Construction of Variability-Based Model Transformation Rules
- ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence
- Lazy Graph Transformation
- Granularity of Conflicts and Dependencies in Graph Transformation Systems
- Critical pairs in term graph rewriting
- Towards Critical Pair Analysis for the Graph Programming Language GP 2
- Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
- Formal Methods in Software and Systems Modeling
- Finitary -adhesive categories
This page was built for publication: Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
