Confluence of Graph Transformation Revisited

@inproceedings{Plump2005ConfluenceOG,
  title={Confluence of Graph Transformation Revisited},
  author={Detlef Plump},
  booktitle={Processes, Terms and Cycles},
  year={2005}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
46 Citations
35 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 46 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Bodlaender and Babette de Fluiter . Reduction algorithms for constructing solutions in graphs with small treewidth

  • L. Hans
  • Term Rewriting Systems
  • 2003

Computing by Graph Rewriting

  • Detlef Plump
  • Habilitation thesis, Universität Bremen…
  • 1999
4 Excerpts

The AGG approach: Language and environment

  • Claudia Ermel, Michael Rudolf, Gabi Taentzer
  • Handbook of Graph Grammars and Computing by Graph…
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…