Verification of schedulability of real-time systems with extended time Petri nets

Most verification algorithms for schedulability of real-time systems are based on an approximate computation which only considers worst cases. Although they always find correct schedulings, in which any task never violates its deadline, those schedulings are sometimes too strict. In this paper, in order to verify schedulability more precisely we propose a verification method based on the state space traversal of the time Petri net that models the given real-time system and the given scheduling. We also extend time Petri nets in order to model round-robin scheduling easily. Some experimental results obtained by the proposed method are shown.<
>