Schedulability criteria for age constraint processes in hard real-time systems. Abstract Real-time systems not only require the semantical correctness of their operations but also the availability of the computational results within some predefined time intervals.
Processes are responsible to carry out the different computations.
Depending on the application specific context they have to complete in time due to periodic contraints or age constraints. This approach is based on a transformation from age constraint processes to periodic processes and derives a least upper bounds for the achievable load for age constraint processes is derived.