Bisimilarity in Term Graph Rewriting

textabstractWe 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.

[1]  John Staples,et al.  Computation on Graph-Like Expressions , 1980, Theor. Comput. Sci..

[2]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[4]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[5]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Gerald J. Sussman,et al.  Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[7]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[8]  Detlef Plump,et al.  Term graph rewriting , 1999 .

[9]  Zena M. Ariola,et al.  Confluent rewriting of bisimilar term graphs , 1997, EXPRESS.

[10]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[11]  Berthold Hoffmann,et al.  Jungle Evaluation for Efficient Term Rewriting , 1988, ALP.

[12]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[13]  M. R. K. Krishna Rao,et al.  Modular Aspects of Term Graph Rewriting , 1998, Theor. Comput. Sci..

[14]  Annegret Habel,et al.  Term graph narrowing , 1996, Mathematical Structures in Computer Science.

[15]  Zena M. Ariola,et al.  Equational Term Graph Rewriting , 1996, Fundam. Informaticae.

[16]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

[17]  Paliath Narendran.  Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages) , 2000, SIGA.

[18]  Jan Willem Klop,et al.  On the adequacy of graph rewriting for simulating term rewriting , 1994, TOPL.

[19]  Detlef Plump,et al.  Evaluation of functional expressions by hypergraph rewriting , 1993 .

[20]  Andrea Corradini,et al.  Cyclic) Term Graph Rewriting is adequate for Rational Parallel Term Rewriting , 1997 .

[21]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[22]  Detlef Plump,et al.  Collapsed Tree Rewriting: Completeness, Confluence, and Modularity , 1992, CTRS.

[23]  Detlef Plump,et al.  Critical Pairs in Term Graph Rewriting , 1994, MFCS.