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.

@article{paperbot4025,
  title = {Termination of Graph Transformation Systems via Generalized Weighted Type Graphs},
  author = {Jörg Endrullis and Roy Overbeek},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 1},
  year = {2026},
  doi = {10.46298/lmcs-22(1:15)2026}
}