An algorithm to identify slices, with applications to vector replacement systems

Araki, T., and T. Kasami: Decidable properties on the strong connectivity of Petri net reachability sets, Theoretical Computer Science 4 (1977) 99–119.Google Scholar

Бирюков, А.П.: О некоторых алгорифмических эадачах для конечноопределенных коммутативных полугрупп. Сиб. мат. журнал III (1967) 525–534Google Scholar

Crespi-Reghizzi, S., and D. Mandrioli: A decidability theorem for a class of vector addition systems. Information Processing Letters 3 (1975) 78–80.Google Scholar

Eilenberg, S., and M.P. Schützenberger: Rational sets in commutative monoids. Journal of Algebra 13 (1969) 173–191.Google Scholar

Gold, E.M.: Language identification in the limit. Information and Control 10 (1967) 447–474.Google Scholar

Grabowski, J.: The decidability of persistence for vector addition systems. Information Processing Letters 11 (1980) 20–23.Google Scholar

Grabowski, J.: Linear methods in the theory of vector addition systems III. Submitted to Elektronische Informationsverarbeitung and Kybernetik.Google Scholar

Hack, M.: Decision problems for Petri nets and vector addition systems. MAC-TM-59, Project MAC, M.I.T., Cambridge 1975.Google Scholar

Jantzen, M., and R. Valk: Formal properties of place transition nets. In: Net Theory and Applications. LCS 84, Springer-Verlag 1980Google Scholar

Karp, R.M., and R.E. Miller: Parallel program schemata. Journal of Computer and System Sciences 3 (1969) 167–195.Google Scholar

Landweber, L.H., and E.L. Robertson: Properties of conflict-free and persistent Petri nets. Journal of the ACM 25 (1978) 352–364.Google Scholar

Mayr, E.W.: Ein Algorithmus für das allgemeine Erreichbarkeitsproblem bei Petrinetzen und damit zusammenhängende Probleme.Google Scholar

Müller, E.: Decidability of reachability in persistent vector replacement systems. In: Mathematical Foundations of Computer Science 1980. LCS 88, Springer-Verlag 1980, 426–438.Google Scholar