Structure theory of choice-free Petri nets based on eigenvalues

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Amer-Yahia, C., & Zerhouni, N. (1999). Structure theory of choice-free Petri nets based on eigenvalues. Journal of the Franklin Institute, 336(5), 833–849.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free