Reasoning about Deadlines in Concurrent Real-Time Programs

We propose a method for the timing analysis of concur-rent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machine-dependent task. The latter takes into account the execution times of the program on a particular machine. Therefore, our goal is to make the machine-dependent phase of the analysis as simple as possible. We succeed in the sense that the machine-dependent phase remains the same as in the analysis of sequential pro-grams. We shift the complexity introduced by concurrency completely to the machine-independent phase.