Title :
Scheduling in hard real-time applications
Author :
Zhu, Jiang ; Lewis, Ted G. ; Jackson, Weldon ; Wilson, Russel L.
Author_Institution :
Naval Postgraduate Sch., Monterey, CA, USA
fDate :
5/1/1995 12:00:00 AM
Abstract :
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
Keywords :
diagrams; formal verification; processor scheduling; real-time systems; safety-critical software; specification languages; systems analysis; timing; visual languages; design diagram; feasibility analysis; graphical languages; hard deadlines; hard real-time applications; scheduling; timing information; uniprocessor system; Algorithm design and analysis; Automatic control; Control systems; Educational institutions; Optimal scheduling; Power generation; Processor scheduling; Real time systems; Timing; Welding;
Journal_Title :
Software, IEEE
