| Bisimilarity in term graphs rewriting (2007) | |||||||||||||||
Abstract | |||||||||||||||
| We present a survey of con uence properties of (acyclic) term graph rewriting. Results and counterexamples are given for dierent kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establish sucient conditions for|and counterexamples to|con uence, con uence modulo bisimilarity and the Church-Rosser property modulo bisimilarity. Moreover, we address rewriting modulo bisimilarity, that is, rewriting of bisimilarity classes of term graphs. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||