Termination of Graph Transformation Systems using Weighted Subgraph Counting

03/14/2023
by   Roy Overbeek, et al.
0

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 method is well-defined in rm-adhesive quasitoposes (which includes toposes), and is applicable to non-linear rules. The method is also defined for other frameworks, including DPO and SqPO, because we have previously shown that they are naturally encodable into PBPO+ in the quasitopos setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2023

Generalized Weighted Type Graphs for Termination of Graph Transformation Systems

We refine a technique by Bruggink et al. that uses weighted type graphs ...
research
06/25/2021

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Encodings of term rewriting systems (TRSs) into graph rewriting systems ...
research
10/25/2019

On the Decidability of Termination for Polynomial Loops

We consider the termination problem for triangular weakly non-linear loo...
research
10/12/2020

DynamiTe: Dynamic Termination and Non-termination Proofs

There is growing interest in termination reasoning for non-linear progra...
research
03/03/2020

Sparse Tiling through Overlap Closures for Termination of String Rewriting

We over-approximate reachability sets in string rewriting by languages d...
research
02/19/2018

Size-based termination of higher-order rewriting

We provide a general and modular criterion for the termination of simply...
research
07/26/2023

Old and New Benchmarks for Relative Termination of String Rewrite Systems

We provide a critical assessment of the current set of benchmarks for re...

Please sign up or login with your details

Forgot password? Click here to reset