From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Overbeek, Roy; Endrullis, Jörg

doi:10.4204/eptcs.350.2

Cited by 5 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bruggink et al have shown that string rewriting rules are terminating on graphs iff they are terminating on cycles [6], making cycle rewriting techniques [31,34] applicable to graph transformation systems consisting of string rewrite rules. Similarly, in a previous paper [21], we have shown that particular PBPO + encodings of linear term rewrite rules are terminating on graphs iff they are terminating on terms.…”

Section: Related Worksupporting

confidence: 76%

“…Unlike in Graph, Mono(C) = Reg(C): Mono(C) contains all injective graph homomorphisms such that labels are non-decreasing (≤), and Reg(C) restricts to monomorphisms that preserve labels (=). In previous papers [21][22][23], we have shown that fuzzy graphs are useful structures for implementing relabeling mechanics for graph transformation.…”

Section: Notation 45 (Visual Notation)mentioning

confidence: 99%

See 1 more Smart Citation

Termination of Graph Transformation Systems using Weighted Subgraph Counting

Overbeek¹,

Endrullis²

2023

Preprint

View full text Add to dashboard Cite

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.

show abstract

Section: Related Worksupporting

confidence: 76%

Section: Notation 45 (Visual Notation)mentioning

confidence: 99%

Termination of Graph Transformation Systems using Weighted Subgraph Counting

Overbeek¹,

Endrullis²

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…In another paper [27], we developed the idea of Example 70 further, and showed that any linear term rewriting system R can be faithfully represented by a PBPO + graph rewrite system encoding E(R), with the additional property that R terminates iff E(R) terminates on finite graphs [27,Theorem 62].…”

Section: Pbpo + Models Dpomentioning

confidence: 99%

Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes

Overbeek¹,

Endrullis²,

Rosset³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

We extend the powerful Pullback-Pushout (PBPO) approach for graph rewriting with strong matching. Our approach, called PBPO + , allows more control over the embedding of the pattern in the host graph, which is important for a large class of rewrite systems. We argue that PBPO + can be considered a unifying theory in the general setting of quasitoposes, by demonstrating that PBPO + can define all rewrite relations definable by PBPO, AGREE and DPO, as well as additional ones. Additionally, we show that PBPO + is well suited for rewriting labeled graphs and some classes of attributed graphs, by introducing a lattice structure on the label set and requiring graph morphisms to be order-preserving.

show abstract

Termination of Graph Transformation Systems Using Weighted Subgraph Counting

Overbeek

Endrullis

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Cited by 5 publications

References 16 publications

Termination of Graph Transformation Systems using Weighted Subgraph Counting

Termination of Graph Transformation Systems using Weighted Subgraph Counting

Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes

Termination of Graph Transformation Systems Using Weighted Subgraph Counting

Contact Info

Product

Resources

About