Initial Conflicts for Transformation Rules with Nested Application Conditions

DOI10.1007/978-3-030-51372-6_7zbMATH Open1502.68156arXiv2005.05901OpenAlexW3038088247MaRDI QIDQ5100729FDOQ5100729

Fernando Orejas, Leen Lambers

Publication date: 1 September 2022

Published in: Graph Transformation (Search for Journal in Brave)

Abstract: We extend the theory of initial conflicts in the framework of M-adhesive categories to transformation rules with ACs. We first show that for rules with ACs, conflicts are in general neither inherited from a bigger context any more, nor is it possible to find a finite and complete subset of finite conflicts as illustrated for the category of graphs. We define initial conflicts to be special so-called symbolic transformation pairs, and show that they are minimally complete (and in the case of graphs also finite) in this symbolic way. We show that initial conflicts represent a proper subset of critical pairs again. We moreover demonstrate that (analogous to the case of rules without ACs) for each conflict a unique initial conflict exists representing it. We conclude with presenting a sufficient condition illustrating important special cases for rules with ACs, where we do not only have initial conflicts being complete in a symbolic way, but also find complete (and in the case of graphs also finite) subsets of conflicts in the classical sense.

Full work available at URL: https://arxiv.org/abs/2005.05901

zbMATH Keywords

conflictsgraph transformationcritical pairs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Extensive, distributive, and adhesive categories (18B50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Correctness of high-level transformation systems relative to nested conditions
• Title not available (Why is that?)
• Fundamentals of algebraic graph transformation
• Conflict Detection for Graph Transformation with Negative Application Conditions
• Local Confluence for Rules with Nested Application Conditions
• Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
• Graph-based specification of access control policies
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
• Granularity of Conflicts and Dependencies in Graph Transformation Systems
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
• Title not available (Why is that?)
• Initial conflicts and dependencies: critical pairs revisited
• Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
• On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
• Tableau-Based Reasoning for Graph Properties
• Symbolic Model Generation for Graph Properties
• Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
• Confluence of Graph Rewriting with Interfaces
• Development of Correct Graph Transformation Systems

Cited In (3)

• Local Confluence for Rules with Nested Application Conditions
• Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
• String diagram rewrite theory III: Confluence with and without Frobenius

This page was built for publication: Initial Conflicts for Transformation Rules with Nested Application Conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100729)