2015/11/03 by Berthold Hoffmann, Hoffmann, Berthold
Computer Science · #Advanced Software Engineering Methodologies #Model-Driven Software Engineering Techniques #Software Engineering Research
paper · doi:10.14279/tuj.eceasst.61.828
openalex publication_date 2024/03/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01
In the standard theory of graph transformation, a rule modifies only subgraphs of constant size and fixed shape. The rules supported by the graph-rewriting tool GrGen are far more expressive: they may modify subgraphs of unbounded size and variable shape. Therefore properties like termination and confluence cannot be analyzed as for the standard case. In order to lift such results, we formalize the outstanding feature of GrGen rules by using plain rules on two levels: schemata are rules with variables; they are refined with meta-rules, which are based on contextual hyperedge replacement, before they are used for rewriting. We show that every rule based on single pushouts, on neighborhood-controlled embedding, or on variable substitution can be modeled by a schema with appropriate meta-rules. It turns out that the question whether schemata may have overlapping refinements is not decidable.