Initial conflicts for transformation rules with nested application conditions
From MaRDI portal
Publication:5100729
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.
Recommendations
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Initial conflicts and dependencies: critical pairs revisited
- On the essence and initiality of conflicts
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 3988733 (Why is no real title available?)
- scientific article; zbMATH DE number 919847 (Why is no real title available?)
- scientific article; zbMATH DE number 234035 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Conflict Detection for Graph Transformation with Negative Application Conditions
- Confluence of graph rewriting with interfaces
- Correctness of high-level transformation systems relative to nested conditions
- Development of Correct Graph Transformation Systems
- Efficient conflict detection in graph transformation systems by essential critical pairs
- Fundamentals of algebraic graph transformation
- Granularity of conflicts and dependencies in graph transformation systems
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
- Graph-based specification of access control policies
- Initial conflicts and dependencies: critical pairs revisited
- Local Confluence for Rules with Nested Application Conditions
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Symbolic model generation for graph properties
- Tableau-based reasoning for graph properties
- Theory of constraints and application conditions: from graphs to high-level structures
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
Cited in
(5)- String diagram rewrite theory III: Confluence with and without Frobenius
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Local Confluence for Rules with Nested Application Conditions
- On the essence and initiality of conflicts
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
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)
