🤖 AI Summary
Existing methods for verifying termination of graph transformation systems suffer from limited applicability and fail to uniformly handle diverse DPO variants. Method: This paper introduces the Generalized Weighted Type Graph (GWTG) framework, the first to extend weighted type graph techniques to arbitrary adhesive categories. GWTG supports not only classical DPO but also prominent variants—including SPO, AGREE, and NAC extensions—while preserving decidability of termination checking. Contribution/Results: By integrating categorical modeling, abstract interpretation, and graph rewriting semantics, GWTG enables fully automated termination verification for a substantially broader class of graph transformation systems. The approach significantly enhances expressiveness and generality without compromising theoretical soundness or computational tractability. This work establishes a more robust and scalable formal foundation for termination analysis in model-driven engineering.
📝 Abstract
We refine the weighted type graph technique for proving termination of double pushout (DPO) graph transformation systems. We increase the power of the approach for graphs, we generalize the technique to other categories, and we allow for variations of DPO that occur in the literature.