Analyzing Graph Transformation Systems through Constraint Handling Rules

Details Analyzing Graph Transformation Systems through Constraint Handling Rules Analyzing Graph Transformation Systems through Constraint Handling Rules

2010-06-08

arxiv.org/abs/1006.1497v2

Computer Science

Logic in Computer Science

45 pages, 11 figures, to appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Analyzing Graph Transformation Systems through Constraint Handling Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analyzing Graph Transformation Systems through Constraint Handling Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analyzing Graph Transformation Systems through Constraint Handling Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29915