Rule-based Graph Repair

TL;DR

This paper investigates rule-based methods for repairing graph-structured models in model-driven engineering, focusing on the existence of repair programs that ensure models meet specified constraints.

Contribution

It formalizes the problem of rule-based graph repair and proves the existence of repair programs for certain constraints and rule sets.

Findings

Existence of repair programs for specific graph constraints.

Existence of rule-based repair programs compatible with rule sets.

Formalization of rule-based graph repair problem.

Abstract

Model repair is an essential topic in model-driven engineering. Since models are suitably formalized as graph-like structures, we consider the problem of rule-based graph repair: Given a rule set and a graph constraint, try to construct a graph program based on the given set of rules, such that the application to any graph yields a graph satisfying the graph constraint. We show the existence of repair programs for specific constraints, and show the existence of rule-based repair programs for specific constraints compatible with the rule set.