Schedulability Analysis Algorithm of Timing Constraint Petri Nets

Abstract

A novel approach to the schedulability analysis is presented in this paper for timing constraint Petri nets, which have wide applications in the workflow management, software engineering, reliability engineering, and so on. The analysis can be conducted in two phases: finding firing sequences and timing constraint analysis, among which the first one is to find the transition sequences that transform the initial marking to a certain marking by using incidence matrix in the underlying Petri net, and the second one is to verify whether the reachable marking found in the first step is reachable with the timing constraints. The proposed method is able to pinpoint out non-schedulable transitions and adjust the timing constraints to make all the transitions schedulable within complex task sequences, while meeting the needs of the managers to schedule the tasks.