Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
From MaRDI portal
Publication:2049986
DOI10.1016/J.TCS.2021.07.023OpenAlexW3186250933MaRDI QIDQ2049986FDOQ2049986
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
Recommendations
- Initial conflicts for transformation rules with nested application conditions
- Initial conflicts and dependencies: critical pairs revisited
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- On the essence and initiality of conflicts
Cites Work
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Correctness of high-level transformation systems relative to nested conditions
- Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs
- 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
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Graph Transformations
- 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
- Algebraic approach to single-pushout graph transformation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of constraints and application conditions: from graphs to high-level structures
- Critical pairs in term graph rewriting
- 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
- Conditional reactive systems
- Towards Local Confluence Analysis for Amalgamated Graph Transformation
- Confluence of Graph Rewriting with Interfaces
- Initial Conflicts for Transformation Rules with Nested Application Conditions
Cited In (2)
This page was built for publication: Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049986)
