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

  • Jan Grabowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    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
  2. /2/.
    Бирюков, А.П.: О некоторых алгорифмических эадачах для конечноопределенных коммутативных полугрупп. Сиб. мат. журнал III (1967) 525–534Google Scholar
  3. /3/.
    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
  4. /4/.
    Eilenberg, S., and M.P. Schützenberger: Rational sets in commutative monoids. Journal of Algebra 13 (1969) 173–191.Google Scholar
  5. /5/.
    Gold, E.M.: Language identification in the limit. Information and Control 10 (1967) 447–474.Google Scholar
  6. /6/.
    Grabowski, J.: The decidability of persistence for vector addition systems. Information Processing Letters 11 (1980) 20–23.Google Scholar
  7. /7/.
    Grabowski, J.: Linear methods in the theory of vector addition systems III. Submitted to Elektronische Informationsverarbeitung and Kybernetik.Google Scholar
  8. /8/.
    Hack, M.: Decision problems for Petri nets and vector addition systems. MAC-TM-59, Project MAC, M.I.T., Cambridge 1975.Google Scholar
  9. /9/.
    Jantzen, M., and R. Valk: Formal properties of place transition nets. In: Net Theory and Applications. LCS 84, Springer-Verlag 1980Google Scholar
  10. /10/.
    Karp, R.M., and R.E. Miller: Parallel program schemata. Journal of Computer and System Sciences 3 (1969) 167–195.Google Scholar
  11. /11/.
    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
  12. /12/.
    Mayr, E.W.: Ein Algorithmus für das allgemeine Erreichbarkeitsproblem bei Petrinetzen und damit zusammenhängende Probleme.Google Scholar
  13. /13/.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Jan Grabowski
    • 1
  1. 1.Sektion MathematikHumboldt-UniversitätBerlin

Personalised recommendations