@inbook{3c3eee95274c48e394533469ddc6128a,
title = "Confluence of Graph Transformation Revisited",
abstract = "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.",
keywords = "TERM REWRITING-SYSTEMS",
author = "D Plump",
year = "2005",
doi = "10.1007/11601548_16",
language = "English",
isbn = "3-540-30911-X",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "280--308",
editor = "A Middledorp and V VanOostrom and F VanRaamsdonk and R DeVrijer",
booktitle = "Processes, Terms and Cycles: Steps on the Road to Infinity",
address = "Germany",
}