Cycle Time
Philippe Declerck · 2012
This chapter enlarges the class of P-time event graphs by introducing interdependent residence durations. This new model is studied through a performance analysis. Considering a periodic behavior, the authors give conditions of existence of a trajectory and propose different techniques allowing the determination of extremal solutions. The cycle time of the generalized P-time event graph depends not only on the circuits of an associated graph but also on more complex structures. The chapter considers the problem of the maximization/minimization of the cycle time and of the residence duration of some tasks. It proposes a generalization of the P-time event graphs by introducing links between residence durations. The second objective is the performance analysis. A third objective is the optimization of the cycle time and of the residence duration of some tasks. A simple example illustrates the different concepts.