Eike Best Harro Wimmel Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. 51-62 2016 RP https://doi.org/10.1007/978-3-319-45994-3_4 conf/rp/2016 db/conf/rp/rp2016.html#BestW16