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

Scheduling in hard real-time applications

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

4 Author(s)
Jiang Zhu ; Naval Postgraduate Sch., Monterey, CA, USA ; Lewis, T.G. ; Jackson, W. ; Wilson, R.L.

A major problem with hard real-time systems is how to be assured that they really work. The authors present theorems to extract timing information from a design diagram and then use it to analyze the feasibility that a uniprocessor system will meet its deadlines. Their work also involves the development of new graphical languages for the design of hard real-time systems

Published in:

Software, IEEE  (Volume:12 ,  Issue: 3 )

Date of Publication:

May 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.