Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
Jörg Endrullis, Roy Overbeek · Logical Methods in Computer Science · 2026
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.