10 citations · 19 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
Regularity Preserving but not Reflecting Encodings
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defini…