O-line computation of real-time schedules using Petri nets

Abstract. We present a methodology of o-line analysis of real-time systems, composed of periodic, synchronous or asynchronous precedence and resource con-strained real-time tasks. As there is no polynomial optimal scheduling technique for such tasks sets, we present an enumerative method based on the construction of the state graph of a Petri net. The time is modeled by the Petri net through the earliest ring rule