Abstract
Choice-free are a class of Petri nets where structural conflicts 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 off-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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
