Conflict Detection for Graph Transformation with Negative Application Conditions

DOI10.1007/11841883_6zbMath1156.68431OpenAlexW1486344718MaRDI QIDQ3541947

Hartmut Ehrig, Fernando Orejas, Leen Lambers

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841883_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (9)

Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs ⋮ Embedding and Confluence of Graph Transformations with Negative Application Conditions ⋮ Automating the transformation-based analysis of visual languages ⋮ Reasoning with graph constraints ⋮ A Logic of Graph Constraints ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars

Uses Software

• AGG

This page was built for publication: Conflict Detection for Graph Transformation with Negative Application Conditions