10 citations · 37 across the 10 of their papers we have counts for
11 papers
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…
Termination of Graph Transformation Systems Using Weighted Subgraph Counting
Roy Overbeek, Jörg Endrullis
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 met…
Fuzzy Presheaves are Quasitoposes
Aloïs Rosset, Roy Overbeek, Jörg Endrullis
Quasitoposes encompass a wide range of structures, including various categories of graphs. They have proven to be a natural setting for reasoning about the metatheory of algebraic…
A PBPO+ Graph Rewriting Tutorial
Roy Overbeek, Jörg Endrullis
We provide a tutorial introduction to the algebraic graph rewriting formalism PBPO+. We show how PBPO+ can be obtained by composing a few simple building blocks, and model the redu…
Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes
Roy Overbeek, Jörg Endrullis, Aloïs Rosset
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…
From Linear Term Rewriting to Graph Rewriting with Preservation of Termination
Roy Overbeek, Jörg Endrullis
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…
Graph Rewriting and Relabeling with PBPO+
Roy Overbeek, Jörg Endrullis, Aloïs Rosset
We extend the powerful Pullback-Pushout (PBPO) approach for graph rewriting with strong matching. Our approach, called \pbpostrong, exerts more control over the embedding of the pa…
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…
Star Games and Hydras
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
The recursive path ordering is an established and crucial tool in term rewriting to prove termination. We revisit its presentation by means of some simple rules on trees (or corres…
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…
Decreasing Diagrams for Confluence and Commutation
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence. In this paper we…