Theoretical Computer Science
Abstract and concrete categories
Abstract and concrete categories
On ground-confluence of term rewriting systems
Information and Computation
Hypergraph rewriting: critical pairs and undecidability of confluence
Term graph rewriting
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Cornerstones of undecidability
Cornerstones of undecidability
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
The PROGRES approach: language and environment
Handbook of graph grammars and computing by graph transformation
The AGG approach: language and environment
Handbook of graph grammars and computing by graph transformation
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Confluence of Typed Attributed Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Graph Rewriting Systems and their Application to Network Reliability Analysis
WG '91 Proceedings of the 17th International Workshop
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Graph grammars and global program data flow analysis
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Embedding and Confluence of Graph Transformations with Negative Application Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
High-Level Programs and Program Conditions
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Collection Operator for Graph Transformation
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Strong Joinability Analysis for Graph Transformation Systems in CHR
Electronic Notes in Theoretical Computer Science (ENTCS)
Non strict confluent rewrite systems for data-structures with pointers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Formal analysis of functional behaviour for model transformations based on triple graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Analysing graph transformation systems through constraint handling rules
Theory and Practice of Logic Programming
Semantic clone detection for model-based development of embedded systems
Proceedings of the 14th international conference on Model driven engineering languages and systems
Conflict detection for graph transformation with negative application conditions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Confluence in data reduction: bridging graph transformation and kernelization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
A collection operator for graph transformation
Software and Systems Modeling (SoSyM)
Confluence of aspects for sequence diagrams
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply local confluence. A Critical Pair Lemma for hypergraph rewriting is then established which guarantees local confluence if each critical pair of a system has joining derivations that are compatible in that they map certain nodes to the same nodes in the common reduct.