Bisimilarity in term graph rewriting
We present a survey of confluence properties of (acyclic) term graph rewriting. Results and counterexamples are given for different 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 sufficient conditions for-and counterexamples to-confluence, confluence modulo bisimilarity and the Church-Rosser property modulo bisimilarity. Moreover, we address rewriting modulo bisimilarity, that is, rewriting of bisimilarity classes of term graphs.
|Models of Computation (acm F.1.1), Mathematical Logic (acm F.4.1), Grammars and Other Rewriting Systems (acm F.4.2)|
|Software Engineering [SEN]|
|Organisation||Specification and Analysis of Embedded Systems|
Ariola, Z.M, Klop, J.W, & Plump, D. (1998). Bisimilarity in term graph rewriting. Software Engineering [SEN]. CWI.