Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality

DOI10.1016/j.tcs.2021.07.023OpenAlexW3186250933MaRDI QIDQ2049986

Leen Lambers, Fernando Orejas

Publication date: 27 August 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.023

zbMATH Keywords

critical pairsgraph transformationapplication conditionsinitial conflicts

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Initial Conflicts for Transformation Rules with Nested Application Conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph transformation. 9th international conference, ICGT 2016, in memory of Hartmut Ehrig, held as part of STAF 2016, Vienna, Austria, July 5--6, 2016. Proceedings
• Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs
• Algebraic approach to single-pushout graph transformation
• 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
• Graph-based specification of access control policies
• Fundamentals of algebraic graph transformation
• ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence
• Conditional Reactive Systems
• Towards Local Confluence Analysis for Amalgamated Graph Transformation
• Confluence of Graph Rewriting with Interfaces
• Tableau-Based Reasoning for Graph Properties
• Conflict Detection for Graph Transformation with Negative Application Conditions
• Correctness of high-level transformation systems relative to nested conditions
• Local Confluence for Rules with Nested Application Conditions
• Granularity of Conflicts and Dependencies in Graph Transformation Systems
• Critical pairs in term graph rewriting
• Initial Conflicts for Transformation Rules with Nested Application Conditions
• Symbolic Model Generation for Graph Properties
• Graph Transformations
• Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality