A major problem with hard real-time systems is how to be assured that
they really work. The authors present theorems to extract timing infor
mation from a design diagram and then use it to analyze the feasibilit
y that a uniprocessor system will meet its deadlines.