Normal Petri nets

Araki, 1977, Decidable problems on the strong connectivity of Petri net reachability sets, Theoret. Comput. Sci., 4, 97, 10.1016/0304-3975(77)90059-7 Commoner, 1971, Marked directed graphs, J. Comput. System Sci., 5, 511, 10.1016/S0022-0000(71)80013-2 Ginsburg, 1966, Semigroups, Presburger formulas and languages, Pacific J. Math., 16, 285, 10.2140/pjm.1966.16.285 Grabowski, 1980, The decidability of persistence for vector addition systems, Inform. Process. Lett., 11, 20, 10.1016/0020-0190(80)90026-5 Hack, 1976, The equality problem for vector addition systems is undecidable, Theoret. Comput. Sci., 2, 77, 10.1016/0304-3975(76)90008-6 Hopcroft, 1979, On the reachability problem for five-dimensional vector addition systems, Theoret. Comput. Sci., 8, 135, 10.1016/0304-3975(79)90041-0 Landweber, 1978, Properties of conflict-free and persistent Petri nets, J. ACM, 25, 352, 10.1145/322077.322079 Mayr, 1981, Persistence of vector replacement systems is decidable, Acta Informatica, 15, 309, 10.1007/BF00289268 Muller, 1980, Decidability of reachability in persistent vector replacement systems, 88, 426 Yamasaki, 1981, On weak persistency of Petri nets, Inform. Process. Lett., 13, 94, 10.1016/0020-0190(81)90117-4