Bisimilarity in term graph rewriting.

DOI10.1006/INCO.1999.2824zbMath1045.68590OpenAlexW2004015019MaRDI QIDQ1854321

Zena M. Ariola, Detlef Plump, Jan Willem Klop

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/4683

zbMATH Keywords

bisimilarity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (7)

Unnamed Item ⋮ GETGRATS ⋮ Essentials of Term Graph Rewriting ⋮ Compiling Collapsing Rules in Certain Constructor Systems ⋮ Implementing conditional term rewriting by graph rewriting ⋮ A uniform framework for term and graph rewriting applied to combined systems ⋮ Term Graphs for Computing Derivatives in Imperative Languages

Cites Work

• Computation on graph-like expressions
• Modular aspects of term graph rewriting
• Implementing term rewriting by jungle evaluation
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Critical pairs in term graph rewriting
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisimilarity in term graph rewriting.