Termination of Graph Transformation Systems via Generalized Weighted Type Graphs

TL;DR

This paper enhances the weighted type graph method to prove termination of graph transformation systems, broadening its applicability across different categories and DPO variations.

Contribution

It generalizes the weighted type graph technique for termination proofs to more categories and DPO variants, increasing its effectiveness.

Findings

Improved method for proving termination of graph transformations.

Broader applicability across categories and DPO variations.

Enhanced power of the weighted type graph approach.

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.