Showing cs.LOShow all
3 papers · 1 filter
cs.LO2023
Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
Jörg Endrullis, Roy Overbeek
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 gener…
cs.LO2020
Patch Graph Rewriting (Extended Version)
Roy Overbeek, Jörg Endrullis
The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, cons…
cs.LO2019
Formalizing Determinacy of Concurrent Revisions
Roy Overbeek
Concurrent revisions is a concurrency control model designed to guarantee determinacy, meaning that the outcomes of programs are uniquely determined. This paper describes an Isabel…