Structure theory of choice-free petri nets based on eigenvalues

✍ Scribed by Chérif Amer-Yahia; Noureddine Zerhouni

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 184 KB
• Volume: 336
• Category: Article
• ISSN: 0016-0032
• DOI: 10.1016/s0016-0032(99)00008-3

✦ Synopsis

Choice-free are a class of Petri nets where structural con#icts are forbidden. They are well-suited for modeling concurrent systems with bulk services and arrivals. A new approach, based on eigenvalues, for the study of some structural properties of Choice-free Petri nets is given in this paper. The structural results follow from the computation of eigenvalues of a square matrix with nonnegative o!-diagonal elements, known as an M-matrix, obtained by a transformation of the classical incidence matrix. Theorems on M-matrices are used in this paper to prove structural boundedness, liveness, repetitiveness, conservativeness, consistency, and well-formedness of Choice-free Petri nets.