A PBPO+ Graph Rewriting Tutorial

TL;DR

This paper offers a tutorial on PBPO+ graph rewriting, illustrating its construction, applications to decision diagrams, and comparisons with related formalisms like DPO and Bauderon's approach.

Contribution

It provides a clear, step-by-step tutorial on PBPO+ and compares it with other graph rewriting formalisms, clarifying their relationships and differences.

Findings

PBPO+ can be constructed from simple building blocks

Application to binary decision diagrams demonstrates practical modeling

Comparison clarifies differences between PBPO+ and related formalisms

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.