Cart (Loading....) | Create Account
Close category search window

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Okawa, Y. ; Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan ; Yoneda, T.

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

Published in:

Parallel and Distributed Real-Time Systems, 1995. Proceedings of the Third Workshop on

Date of Conference:

25 Apr 1995

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.