Schedulability Analysis of Petri Nets Based on Structural Properties

  • Kondratyev A
  • Watanabe Y
  • Sangiovanni-Vincentelli A
 et al. 
  • 2


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterministic choices. Schedulability analysis for a given PN answers the question whether a schedule exists in the reacha- bility space of this net. This paper suggests a novel approach for schedulability analysis based solely on PN structure. It shows that unschedulability can be caused by a structural relation among tran- sitions modelling nondeterministic choices. A method based on linear programming for checking this relation is proposed. This paper also presents a necessary condition for schedulability based on the rank of the incidence matrix of the underlying PN. These results shed a light on the sources of unschedulability often found in PN models of embeddedmultimedia systems.

Author-supplied keywords

  • Petri net
  • quasi-static scheduling
  • structural property

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


  • a. Kondratyev

  • Y. Watanabe

  • A. Sangiovanni-Vincentelli

  • J. Desel

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free