Critical pairs in term graph rewriting

DOI10.1007/3-540-58338-6_102zbMath1493.68177OpenAlexW1537275197MaRDI QIDQ5096914

Detlef Plump

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://eprints.whiterose.ac.uk/148076/1/Plump.MFCS.94.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (9)

Towards Local Confluence Analysis for Amalgamated Graph Transformation ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Unification of drags and confluence of drag rewriting ⋮ Unnamed Item ⋮ Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Modular aspects of term graph rewriting ⋮ Bisimilarity in term graph rewriting.

Cites Work

• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• Graph reduction. Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29 - October 1, 1986
• REDEX CAPTURING IN TERM GRAPH REWRITING
• Implementing term rewriting by jungle evaluation
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Critical pairs in term graph rewriting