The PBPO graph transformation approach

Corradini, Andrea; Duval, Dominique; Echahed, Rachid; Prost, Frédéric; Ribeiro, Leila

doi:10.1016/j.jlamp.2018.12.003

Cited by 23 publications

(29 citation statements)

References 25 publications

(53 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…AGREE. AGREE [3] and PBPO [4] by Corradini et al share some of the spirit of PGR. Like for us, their goal is to have control over the transformation of the embedding.…”

Section: Dpo Rewriting In Context (Dpo-c)mentioning

confidence: 93%

Patch Graph Rewriting (Extended Version)

Overbeek,

Endrullis

2020

Preprint

View full text Add to dashboard Cite

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, consisting of those edges of the host graph that touch the subgraph, but are not part of it. We introduce the patch graph rewriting framework, a visual graph rewriting language with precise formal semantics. The language has rich expressive power in two ways. Firstly, rules can flexibly constrain the permitted shapes of patches touching matching subgraphs. Secondly, rules can freely transform patches. While the framework is designed to be easy to understand, it subsumes many approaches to graph rewriting.

show abstract

“…AGREE. AGREE [3] and PBPO [4] by Corradini et al share some of the spirit of PGR. Like for us, their goal is to have control over the transformation of the embedding.…”

Section: Dpo Rewriting In Context (Dpo-c)mentioning

confidence: 93%

Patch Graph Rewriting (Extended Version)

Overbeek,

Endrullis

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…A TRS R induces a relation → on Ter(Σ, X ), the rewrite relation of R, 3 PBPO + and Graph (L,≤) We recently introduced PBPO + [17] (short for PBPO with strong matching), an algebraic rewriting formalism obtained by strengthening the matching mechanism of PBPO by Corradini et al [4]. We believe PBPO + is of interest for at least three important reasons.…”

Section: Definition 8 (Contexts) a Context C[mentioning

confidence: 99%

“…Building on PBPO by Corradini et al [4] and our own patch graph rewriting formalism [16], we recently proposed the PBPO + algebraic graph rewriting approach [17], in which rules employ a type graph to specify transformations and control rule applicability. In the present paper we give an embedding of linear term rewrite systems into PBPO + that preserves global termination, despite being applicable to graphs that are not encodings of terms.…”

Section: Introductionmentioning

confidence: 99%

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Overbeek,

Endrullis

2021

Preprint

View full text Add to dashboard Cite

Encodings of term rewriting systems (TRSs) into graph rewriting systems usually lose global termination, meaning the encodings do not terminate on all graphs. A typical encoding of the terminating TRS rule a(b(x)) → b(a(x)), for example, may be indefinitely applicable along a cycle of a's and b's. Recently, we introduced PBPO + , a graph rewriting formalism in which rules employ a type graph to specify transformations and control rule applicability. In the present paper, we show that PBPO + allows for a natural encoding of linear TRS rules that preserves termination globally. This result is a step towards modeling other rewriting formalisms, such as lambda calculus and higher order rewriting, using graph rewriting in a way that preserves properties like termination and confluence. We moreover expect that the encoding can serve as a guide for lifting TRS termination methods to PBPO + rewriting.

show abstract

“…AGREE. AGREE [3] and PBPO [4] by Corradini et al extend DPO with the ability to erase and clone nodes, while also being able to specify how patch edges are distributed among the copies. For this purpose, a "filter" for the edges determines what kind of patch edges are to be dropped.…”

Section: Dpo Rewriting In Context (Dpo-c)mentioning

confidence: 99%

Patch Graph Rewriting

Overbeek

Endrullis

2020

Graph Transformation

View full text Add to dashboard Cite

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, consisting of those edges of the host graph that touch the subgraph, but are not part of it. We introduce patch graph rewriting, a visual graph rewriting language with precise formal semantics. The language has rich expressive power in two ways. First, rewrite rules can flexibly constrain the permitted shapes of patches touching matching subgraphs. Second, rules can freely transform patches. We highlight the framework's distinguishing features by comparing it against existing approaches.

show abstract

The PBPO graph transformation approach

Cited by 23 publications

References 25 publications

Patch Graph Rewriting (Extended Version)

Patch Graph Rewriting (Extended Version)

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination

Patch Graph Rewriting

Contact Info

Product

Resources

About