Graph rewriting and relabeling with PBPO\textsuperscript{+}

DOI10.1007/978-3-030-78946-6_4MaRDI QIDQ2117259zbMATH OpenOpenAlexFDO

Authors Roy Overbeek, Jörg Endrullis, Aloïs Rosset

Publication date 21 March 2022

Full work available at URL https://arxiv.org/abs/2010.08230

Abstract: 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 pattern in the host graph, which is important for a large class of graph rewrite systems. In addition, we show that pbpostrong is well-suited for rewriting labeled graphs and certain classes of attributed graphs. For this purpose, we employ a lattice structure on the label set and use order-preserving graph morphisms. We argue that our approach is simpler and more general than related relabeling approaches in the literature.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: Graph rewriting and relabeling with PBPO\textsuperscript{+}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117259)