For critical operations, a real-time system must be tested and verified for performance.
[1] Modeling and evaluation of a real-time scheduling system concern is on the analysis of the algorithm capability to meet a process deadline.
In general terms, in the algorithm for a real-time scheduling system, each task is assigned a description, deadline and an identifier (indicating priority).
The selected scheduling algorithm determines how priorities are assigned to a particular task.
For a static scheduler, task priorities are determined before the system runs.
It is not always possible to meet the required deadline; hence further verification of the scheduling algorithm must be conducted.
Another faster and more economical method is a risk based approach where representative critical inputs are selected for testing.
This method is more economical but could result in less than optimal conclusions over the validity of the system if the incorrect approach is used.