The residue of vector sets with applications to decidability problems in petri nets

  • Rüdiger Valk
  • Matthias Jantzen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 188)


A set K of integer vectors is called right-closed, if for any element m ε K all vectors m'm are also contained in K. In such a case K is a semilinear set of vectors having a minimal generating set res(K), called the residue of K. A general method is given for computing the residue set of a right-closed set, provided it satisfies a certain decidability criterion.

Various right-closed sets which are important for analyzing, constructing, or controlling Petri nets are studied. One such set is the set CONTINUAL (T) of all such markings which have an infinite continuation using each transition infinitely many times. It is shown that the residue set of CONTINUAL(T) can be constructed effectively, solving an open problem of Schroff. The proof also solves problem 24 (iii) in the EATCS-Bulletin. The new methods developed in this paper can also be used to show that it is decidable, whether a signal net is prompt [Patil] and whether certain ω-languages of a Petri net are empty or not.

It is shown, how the behaviour of a given Petri net can be controlled in a simple way in order to realize its maximal central subbehaviour, thereby solving a problem of Nivat and Arnold, or its maximal live subbehaviour as well. This latter approach is used to give a new solution for the bankers problem described by Dijkstra.

Since the restriction imposed on a Petri net by a fact [GL] can be formulated as a right closed set, our method also gives a new general approach for „implementations“ of facts.


Coverability Graph Firing Sequence Finite Representation Reachable Marking Boundedness Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [BH]
    P. Brinch Hansen: Operating System Principles, Prentice-Hall Inc, Englewood Cliffs (1973)Google Scholar
  2. [Br]
    G. W. Brams Réseaux de Petri: Théorie et pratique Masson, Paris (1983)Google Scholar
  3. [Bu]
    H. D. Burkhard: Two Pumping Lemmata for Petri nets, EIK, vol 17 (1981) 349–362Google Scholar
  4. [By]
    H. W. Byrn: Sequential processes, deadlocks and semaphere primitives, Havard Univ., Tech. Rep. 7-75, Cambridge 1975Google Scholar
  5. [Ca]
    H. Carstensen: Fairneß bei Petrinetzen mit unendlichem Verhalten. Univ. Hamburg, Fachbereich Informatik, Report B-93/82 (1982)Google Scholar
  6. [Con]
    J. H. Conway: Regular Algebra and Finite Machines, Chapman and Hall (1971)Google Scholar
  7. [CV]
    H. Carstensen, R. Valk: Infinite behaviour and fairness in Petri nets. Fourth European Workshop on Application and Theory of Petri Nets, Toulouse, France (1983)Google Scholar
  8. [Di]
    E. W. Dijkstra: Co-operating sequential Processes; in F. Genuys (ed): Programming Languages Academic Press, London (1968), 43–112Google Scholar
  9. [EATCS]
    E. Best/P. S. Thiagarajan, P24 (iii) in EATCS Bulletin 20 (1983) p 310Google Scholar
  10. [ES]
    S. Eilenberg, M. P. Schützenberger: Rational sets in communicative monoids, J. Algebra 13 (1969), 173–191CrossRefGoogle Scholar
  11. [GL]
    H. J. Genrich, K. Lautenbach: Facts in place/transition-nets; Lecture Notes in Computer Science No 64, Springer-Verlag, Berlin (1978), 213–231Google Scholar
  12. [Gra]
    J. Grabowski: Linear methods in the Theory of Vector addition systems I, EIK, vol 16 (1980) 207–236Google Scholar
  13. [Ha]
    M. Hack: Petri net languages, MIT, Proj. MAC, Comp. Struct. Group Memo 124 (1975)Google Scholar
  14. [Ha]
    M. Hack: The equality problem for vector addition systems is undecidable; Theoret. Computer Sci. 2 (1976), 77–95Google Scholar
  15. [JV]
    M. Jantzen, R. Valk: Formal properties of place/transition nets, in: W. Brauer (ed), Net Theory and Applications, Lecture Notes in Computer Science No 84, Springer Verlag, Berlin (1979), 165–212Google Scholar
  16. [Ke]
    R.M. Keller: Vector Replacement Systems: A Formalism for Modeling Asynchronous Systems, Comp. Sci. Lab., Princeton Univ., Techn. Rep. 117 (1972, revised 1974).Google Scholar
  17. [KM]
    R.M. Karp, R.E. Miller: Parallel Program Schemata. Journ. Computer Systems Sci.; 3 (1969), 147–195Google Scholar
  18. [La]
    L.H. Landweber: Decision problems for ω-automata, Math. Systems Theory 3 (1969), 376–384Google Scholar
  19. [Li]
    R.J. Lipton: The Reachability Problem Requires Exponential Space. Yale Univ., Dept. of Comp. Sci., Research Report # 62 (1976)Google Scholar
  20. [NA]
    M. Nivat, A. Arnold: Comportements de processur, Lab. Informatique Théor. et Programm., Univ. Paris 6 and 7, Paris (1982)Google Scholar
  21. [PT]
    S.S. Patil, P.S. Thiagarajan: unpublished manuscriptGoogle Scholar
  22. [Ra]
    C. Rackoff: The Covering and Boundedness Problems for Vector Addition Systems, Theoretical Comp. Sci. 6 (1978), 223–231Google Scholar
  23. [Sch]
    R. Schroff: Vermeidung von totalen Verklemmungen in bewerteten Petrinetzen, Ph.D. Theses, Techn. Univ. München (1974)Google Scholar
  24. [Sch 2]
    R. Schroff: Vermeidung von Verklemmungen in bewerteten Petrinetzen, Lecture Notes in Computer Sci. No. 26, Springer-Verlag, Berlin (1975), 316–325Google Scholar
  25. [Va 76]
    R. Valk: Prévention des bloquages aux systèmes paralleles, Lecture notes, Univ. Paris VI (1976)Google Scholar
  26. [Va 83]
    R. Valk: Infinite behaviour of Petri nets. Theor. Computer Sci. 25 (1983) 3, 311–341Google Scholar
  27. [VJ]
    R. Valk, M Jantzen: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets, Report IfI-HH-101/84, Fachbereich Informatik, Univ. Hamburg (1984)Google Scholar
  28. [VV]
    R. Valk, G. Vidal-Naquet: Petri Nets and Regular Languages, Journ. of Computer and System Sciences 23 (1981) 3, 299–325Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Rüdiger Valk
    • 1
  • Matthias Jantzen
    • 1
  1. 1.Fachbereich InformatikUniversität HamburgHamburg 13

Personalised recommendations