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

A time Petri net approach for finding preruntime schedules in embedded hard real-time systems

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

3 Author(s)
Barreto, R. ; DCC, Univ. Fed do Amazonas, Manaus, Brazil ; Cavalcante, S. ; Maciel, P.

There are two general approaches for scheduling tasks in real-time systems: runtime and preruntime scheduling. However, there are several situations where the runtime approach does not find a feasible schedule even when such a schedule exists. However, finding a feasible schedule is not trivial, because this problem is NP-hard in its general form. The proposed method finds a preruntime scheduling, when one exists, using state space exploration starting from a system formal model. Despite this technique being not new, at the best of our present knowledge, no one tried to use it for finding preruntime scheduling. The main problem with this approach is the space size, which can grow exponentially. This article shows how to minimize this problem. Additionally, the proposed algorithm is a depth-first search method on a labeled transition system derived from a time Petri net model. It is verified through real-world experimental results that the schedule is found examining a reduced number of states.

Published in:

Distributed Computing Systems Workshops, 2004. Proceedings. 24th International Conference on

Date of Conference:

23-24 March 2004

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.