In: Proc. 3-rd Workshop on Parallel and Distributed Real-Time Systems, 25 April 1995, Santa Barbara, CA, pages 185-192. 1995.
Abstract: 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, a verification method is proposed which is based on the state space traversal of the time Petri net that models the given real-time system and the given scheduling. Time Petri nets are also extended in order to model round-robin scheduling easily. Some experimental results obtained by the proposed method are shown in the paper.
Keywords: algorithm verification, extended time Petri nets, real-time systems.