Using dynamic priority time Petri nets for scheduling analysis via earliest deadline first policy

States Graph Generation from dynamic Priority Time Petri Nets

“…The dPTPN is dedicated for analyzing the schedulability of Real-Time System (RTS) running on multiprocessor architecture [10,9]. Such systems are characterized with dynamic priority-driven scheduling where the dPTPN has proved its capacity to deal with it.…”

“…In previous research work [10,9], we modeled the internal behavior of a realtime task with dPTPN. In scheduling analysis, although the external behavior of task is an important key, it depends on analyzing the internal one.…”

“…After developing the RTS model with dPTPN, it is important to precise its initial marking as described in previous research works [9,8]. At this stage, the dPTPN RTS model is ready for execution to determine all its reachable states.…”

“…However, the LLF is not frequently used in practice because the cost of preemption is so high compared to the Earliest Deadline First (EDF) [12]. In the same vein, the authors have proven the capacity of the dPTPN to deal with EDF as well as with the dependent tasks in [9]. In this stage, the authors have proposed a Petri model for the scheduling analysis.…”

Transformation process of RTS scheduling analysis requirements from UML/MARTE to dynamic priority time Petri Nets

“…In previous research works [24,25], we have extended the Petri Nets to be dedicated to multiprocessor scheduling analysis. We have proposed the dynamic priority time Petri Nets (dPTPN) able to specify the dynamic calculation of priority.…”