Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
Logic in Computer Science
2026-03-11 v5
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.
Keywords
Cite
@article{arxiv.2307.07601,
title = {Termination of Graph Transformation Systems via Generalized Weighted Type Graphs},
author = {Jörg Endrullis and Roy Overbeek},
journal= {arXiv preprint arXiv:2307.07601},
year = {2026}
}