1. Atig, M.F., Ganty, P.: Approximating Petri net reachability along context-free traces. In: FSTTCS 2011, Mumbai, India, LIPIcs, vol. 13, pp. 152–163 (2011)
2. Lecture Notes in Computer Science;R Bonnet,2011
3. Bonnet, R., Finkel, A., Leroux, J., Zeitoun, M.: Model checking vector addition systems with one zero-test. Logical Methods Comput. Sci. 8(11), 1–25 (2012)
4. Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary (extended abstract). CoRR, abs/1809.07115 (2018)
5. Dassow, J., Turaev, S.: Petri net controlled grammars: the case of special Petri nets. J. UCS 15(14), 2808–2835 (2009)