Graph rewriting and relabeling with PBPO\textsuperscript{+}
From MaRDI portal
Publication:2117259
DOI10.1007/978-3-030-78946-6_4zbMATH Open1492.68072arXiv2010.08230OpenAlexW3173934614MaRDI QIDQ2117259FDOQ2117259
Authors: Roy Overbeek, Jörg Endrullis, Aloïs Rosset
Publication date: 21 March 2022
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.
Full work available at URL: https://arxiv.org/abs/2010.08230
Recommendations
Cites Work
- Title not available (Why is that?)
- Category Theory
- Foundations of Software Science and Computation Structures
- Sesqui-Pushout Rewriting
- Fundamentals of algebraic graph transformation
- On the axioms for adhesive and quasiadhesive categories
- Amalgamating pushout and pullback graph transformation in collagories
- Collagories: relation-algebraic reasoning for gluing constructions
- Double-pushout graph transformation revisited
- Title not available (Why is that?)
- Algebraic approach to single-pushout graph transformation
- The PBPO graph transformation approach
- AGREE -- algebraic graph rewriting with controlled embedding
- Title not available (Why is that?)
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
- Drags: a compositional algebraic framework for graph rewriting
- Rewriting abstract structures: materialization explained categorically
- Patch graph rewriting
- Formal Methods in Software and Systems Modeling
- Formal Methods in Software and Systems Modeling
Cited In (6)
- Fundamentals of compositional rewriting theory
- The PBPO graph transformation approach
- Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes
- Title not available (Why is that?)
- Finding the right way to Rome: effect-oriented graph transformation
- From linear term rewriting to graph rewriting with preservation of termination
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)