Scheduling in hard real-time applications
Jiang Zhu, Tyree Lewis, W.C. Jackson, Russel L. Wilson · IEEE Software · 1995
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.>