The residue of vector sets with applications to decidability problems in petri nets
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.
KeywordsCoverability Graph Firing Sequence Finite Representation Reachable Marking Boundedness Problem
Unable to display preview. Download preview PDF.
- [BH]P. Brinch Hansen: Operating System Principles, Prentice-Hall Inc, Englewood Cliffs (1973)Google Scholar
- [Br]G. W. Brams Réseaux de Petri: Théorie et pratique Masson, Paris (1983)Google Scholar
- [Bu]H. D. Burkhard: Two Pumping Lemmata for Petri nets, EIK, vol 17 (1981) 349–362Google Scholar
- [By]H. W. Byrn: Sequential processes, deadlocks and semaphere primitives, Havard Univ., Tech. Rep. 7-75, Cambridge 1975Google Scholar
- [Ca]H. Carstensen: Fairneß bei Petrinetzen mit unendlichem Verhalten. Univ. Hamburg, Fachbereich Informatik, Report B-93/82 (1982)Google Scholar
- [Con]J. H. Conway: Regular Algebra and Finite Machines, Chapman and Hall (1971)Google Scholar
- [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
- [Di]E. W. Dijkstra: Co-operating sequential Processes; in F. Genuys (ed): Programming Languages Academic Press, London (1968), 43–112Google Scholar
- [EATCS]E. Best/P. S. Thiagarajan, P24 (iii) in EATCS Bulletin 20 (1983) p 310Google Scholar
- [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
- [Gra]J. Grabowski: Linear methods in the Theory of Vector addition systems I, EIK, vol 16 (1980) 207–236Google Scholar
- [Ha]M. Hack: Petri net languages, MIT, Proj. MAC, Comp. Struct. Group Memo 124 (1975)Google Scholar
- [Ha]M. Hack: The equality problem for vector addition systems is undecidable; Theoret. Computer Sci. 2 (1976), 77–95Google Scholar
- [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
- [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
- [KM]R.M. Karp, R.E. Miller: Parallel Program Schemata. Journ. Computer Systems Sci.; 3 (1969), 147–195Google Scholar
- [La]L.H. Landweber: Decision problems for ω-automata, Math. Systems Theory 3 (1969), 376–384Google Scholar
- [Li]R.J. Lipton: The Reachability Problem Requires Exponential Space. Yale Univ., Dept. of Comp. Sci., Research Report # 62 (1976)Google Scholar
- [NA]M. Nivat, A. Arnold: Comportements de processur, Lab. Informatique Théor. et Programm., Univ. Paris 6 and 7, Paris (1982)Google Scholar
- [PT]S.S. Patil, P.S. Thiagarajan: unpublished manuscriptGoogle Scholar
- [Ra]C. Rackoff: The Covering and Boundedness Problems for Vector Addition Systems, Theoretical Comp. Sci. 6 (1978), 223–231Google Scholar
- [Sch]R. Schroff: Vermeidung von totalen Verklemmungen in bewerteten Petrinetzen, Ph.D. Theses, Techn. Univ. München (1974)Google Scholar
- [Sch 2]R. Schroff: Vermeidung von Verklemmungen in bewerteten Petrinetzen, Lecture Notes in Computer Sci. No. 26, Springer-Verlag, Berlin (1975), 316–325Google Scholar
- [Va 76]R. Valk: Prévention des bloquages aux systèmes paralleles, Lecture notes, Univ. Paris VI (1976)Google Scholar
- [Va 83]R. Valk: Infinite behaviour of Petri nets. Theor. Computer Sci. 25 (1983) 3, 311–341Google Scholar
- [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
- [VV]R. Valk, G. Vidal-Naquet: Petri Nets and Regular Languages, Journ. of Computer and System Sciences 23 (1981) 3, 299–325Google Scholar