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

SummaryA set K of integer vectors is called right-closed, if for any elementmε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 wich 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 [23] 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 [11] can be formulated as a right closed set, our method also gives a new general approach for „implementations” of facts.

[1]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[2]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[3]  Kurt Lautenbach,et al.  Facts in Place/Transition-Nets , 1978, MFCS.

[4]  Per Brinch Hansen,et al.  Operating System Principles , 1973 .

[5]  Rüdiger Valk,et al.  Infinite behaviour and fairness in Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[6]  Rüdiger Valk,et al.  Safe states in banker like resource allocation problems , 1985, Applications and Theory in Petri Nets.

[7]  Rüdiger Valk,et al.  Formal Properties of Place/Transition Nets , 1979, Advanced Course: Net Theory and Applications.

[8]  J. Conway Regular algebra and finite machines , 1971 .

[9]  Michel Hack,et al.  The Equality Problem for Vector Addition Systems is Undecidable , 1976, Theor. Comput. Sci..

[10]  Robert M. Keller Vector replacement systems: a formalism for modelling asynchronous systems , 1972 .

[11]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[12]  Edsger W. Dijkstra,et al.  Co-operating sequential processes , 1968 .

[13]  Lawrence H. Landweber,et al.  Decision problems forω-automata , 1969, Mathematical systems theory.

[14]  Michel Hack,et al.  The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems , 1974, SWAT.

[15]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[16]  Jan Grabowski,et al.  Linear Methods in the Theory of Vector Addition Systems I , 1980, J. Inf. Process. Cybern..

[17]  Hans-Dieter Burkhard Two Pumping Lemmata for Petri Nets , 1981, J. Inf. Process. Cybern..

[18]  R. Schroff Vermeidung von Verklemmungen in Bewerteten Petrinetzen , 1974, GI Jahrestagung.

[19]  Rüdiger Valk Infinite Behaviour of Petri Nets , 1983, Theor. Comput. Sci..

[20]  Rüdiger Valk,et al.  Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..