A PBPO+ Graph Rewriting Tutorial
Logic in Computer Science
2023-03-30 v2
Abstract
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 reduction rules for binary decision diagrams as an example. Along the way, we comment on how alternative design decisions lead to related formalisms in the literature, such as DPO. We close with a detailed comparison with Bauderon's double pullback approach.
Cite
@article{arxiv.2301.12912,
title = {A PBPO+ Graph Rewriting Tutorial},
author = {Roy Overbeek and Jörg Endrullis},
journal= {arXiv preprint arXiv:2301.12912},
year = {2023}
}
Comments
In Proceedings TERMGRAPH 2022, arXiv:2303.14219