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.
| Original language | English |
|---|---|
| Pages (from-to) | 45-63 |
| Number of pages | 19 |
| Journal | Electronic Proceedings in Theoretical Computer Science (EPTCS) |
| Volume | 377 |
| DOIs | |
| Publication status | Published - 1 Apr 2023 |
| Event | 12th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2022 - Haifa, Israel Duration: 1 Aug 2022 → … |
Bibliographical note
Funding Information:We thank Jasmin Blanchette, Wouter Brozius and Femke van Raamsdonk for discussions and feedback. We also thank the anonymous reviewers for their helpful suggestions. Both authors received funding from the Netherlands Organization for Scientific Research (NWO) under the Innovational Research Incentives Scheme Vidi (project. No. VI.Vidi.192.004).
Publisher Copyright:
© R. Overbeek & J. Endrullis.
Funding
We thank Jasmin Blanchette, Wouter Brozius and Femke van Raamsdonk for discussions and feedback. We also thank the anonymous reviewers for their helpful suggestions. Both authors received funding from the Netherlands Organization for Scientific Research (NWO) under the Innovational Research Incentives Scheme Vidi (project. No. VI.Vidi.192.004).
