40 citations · 129 across the 35 of their papers we have counts for
37 papers
Decreasing Diagrams are Complete for Confluence
Jörg Endrullis, Ievgen Ivanov, Femke van Raamsdonk
Confluence is a fundamental property of nondeterministic computations, arising from parallelism, concurrency, or freedom in the evaluation order. It guarantees that such a computat…
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…
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…
Algebraic Presentation of Semifree Monads
Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis
Monads and their composition via distributive laws have many applications in program semantics and functional programming. For many interesting monads, distributive laws fail to ex…
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…