Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs

@article{Baldan2005RelatingSA,
  title={Relating SPO and DPO graph rewriting with Petri nets having read, inhibitor and reset arcs},
  author={Paolo Baldan and Andrea Corradini and Ugo Montanari},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2005},
  volume={127},
  pages={5-28}
}
It belongs to the folklore that graph grammars can be seen as a proper generalisation of Petri nets. In this paper we show how this intuitive relationship can be made formal. The double-pushout approach to graph rewriting turns out to be strictly related to Petri nets with read and inhibitor arcs, while the single-pushout approach has strong connections to Petri nets with read and reset arcs.