Analyzing Graph Transformation Systems through Constraint Handling Rules
Logic in Computer Science
2010-06-16 v2 Programming Languages
Abstract
Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well-known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS, and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.
Cite
@article{arxiv.1006.1497,
title = {Analyzing Graph Transformation Systems through Constraint Handling Rules},
author = {Frank Raiser and Thom Frühwirth},
journal= {arXiv preprint arXiv:1006.1497},
year = {2010}
}
Comments
45 pages, 11 figures, to appear in Theory and Practice of Logic Programming (TPLP)