Termination of graph transformation systems using weighted subgraph counting

R Overbeek, J Endrullis - Logical Methods in Computer …, 2024 - lmcs.episciences.org
We introduce a termination method for the algebraic graph transformation framework
PBPO+, in which we weigh objects by summing a class of weighted morphisms targeting …

Generalized weighted type graphs for termination of graph transformation systems

J Endrullis, R Overbeek - International Conference on Graph …, 2024 - Springer
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 …

A Unifying Theory for Graph Transformation

R Overbeek - 2024 - research.vu.nl
The field of graph transformation studies the rule-based transformation of graphs. An
important branch is the algebraic graph transformation tradition, in which approaches are …

Vrije Universiteit Amsterdam, Amsterdam, The Netherlands {r. overbeek, j. endrullis}@ vu. nl

R Overbeek - … : 16th International Conference, ICGT 2023, Held …, 2023 - books.google.com
We introduce a termination method for the algebraic graph transformation framework PBPO,
in which we weigh objects by summing a class of weighted morphisms targeting them. The …

[PDF][PDF] From Trees to Graphs: On the Influence of Collapsing on Rewriting and on Termination

MA Schett - 2016 - maria-a-schett.net
When moving from the tree representation of terms to the graph representation of term
graphs, we change the potential rewrite steps: every graph rewrite step can be simulated by …

[PDF][PDF] VU Research Portal

MM Overbeek - Nuclear medicine and biology, 2013 - research.vu.nl
VU Research Portal VU Research Portal Refractory Coeliac Disease Verbeek, WHM 2009
document version Publisher's PDF, also known as Version of record Link to publication in VU …