Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
Graph-based specification of access control policies
Journal of Computer and System Sciences
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Theory of Constraints and Application Conditions: From Graphs to High-Level Structures
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
Electronic Notes in Theoretical Computer Science (ENTCS)
Embedding and Confluence of Graph Transformations with Negative Application Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Resolution-Like Theorem Proving for High-Level Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Conflict detection for graph transformation with negative application conditions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Confluence of graph transformation revisited
Processes, Terms and Cycles
Graph transformations for MDE, adaptation, and models at runtime
SFM'12 Proceedings of the 12th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: formal methods for model-driven engineering
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Hi-index | 0.01 |
Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence of rewriting systems in a static way. Critical pairs are defined already in the framework of graphs and adhesive rewriting systems. These systems may hold rules with or without negative application conditions. In this paper however, we consider rules with more general application conditions -- also called nested application conditions -- which in the graph case are equivalent to finite first-order graph conditions. The classical critical pair notion denotes conflicting transformations in a minimal context satisfying the application conditions. This is no longer true for combinations of positive and negative application conditions -- an important special case of nested ones -- where we have to allow that critical pairs do not satisfy all the application conditions. This leads to a new notion of critical pairs which allows to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. We demonstrate this new theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.