Strong joinability analysis for graph transformation systems in CHR

Frank Raiser and Thom Frühwirth. Strong joinability analysis for graph transformation systems in CHR. 2009, Electronic Notes in Theoretical Computer Science - Proceedings of the Fifth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2009), 253(4):91-111, Article

Abstract:

The notion of confluence is prevalent in graph transformation systems (GTS) as well as constraint handling rules (CHR). This work presents a generalized embedding of GTS in CHR that allows to consider strong derivations in confluence analyses. Confluence of a terminating CHR program is decidable, but confluence of a terminating GTS is undecidable. We show that observable confluence in CHR is a sufficient criterion for confluence of the embedded GTS. For this purpose the automatic confluence check for CHR can be reused.