Structure theory of choice-free Petri nets based on eigenvalues

  • Amer-Yahia C
  • Zerhouni N
  • 1


    Mendeley users who have this article in their library.
  • 5


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Chérif Amer-Yahia

  • Noureddine Zerhouni

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free