Generalized Weighted Type Graphs for Termination of Graph Transformation Systems
share
We refine a technique by Bruggink et al. that uses weighted type graphs 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.
READ FULL TEXT