States Graph Generation from dynamic Priority Time Petri Nets

Abstract

dynamic Priority Time Petri Nets (dPTPN) is a mathematical formalism dedicated to modeling Real-Time System (RTS) and checking its schedulability. The present paper proposes a states graph generation from a reduced dPTPN model in order to deal with the scheduling analysis. Based on hierarchical modeling, the present model presents only the interaction between all RTS components and excluding their internal behavior. According to this reduction, a new denition of state is given. Hence, all reachable states and edges connecting between them are generated to show a prediction of the RTS scheduling. Thus, the resulting graph gives birth to an open research area in the purpose of checking its properties and deducing the schedulability.