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.

翻译：我们提供了一个针对代数图重写形式PBPO+的教程介绍。我们展示了PBPO+如何通过组合几个简单的构建块得到，并且以二进制决策图的规约规则为例进行建模。在此过程中，我们还评论了如何通过不同的设计决策在相关的文献中得到其它形式主义，例如DPO。我们最后对Bauderon的双回撤方法进行了详细的比较。