Eike Best, Harro Wimmel. Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. In Kim Guldstrand Larsen, Igor Potapov, Jirí Srba, editors, Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings. Volume 9899 of Lecture Notes in Computer Science, pages 51-62, Springer, 2016. [doi]
Abstract is missing.