Scheduling real-time systems with periodic tasks using a model-checking approach

Scheduling theory presents analytical solutions for different scheduling schemes, most of which based on necessary or sufficient conditions only. Available methods based on graphs use quantitative temporal reasoning to answer about decidability and to find feasible schedules. In this paper we present an alternative technique based on model-checking approach that uses only qualitative temporal reasoning with periodic tasks only. That technique gives a necessary and sufficient condition for decidability and assists the design of feasible static or quasistatic offline schedulers. Prospective results are illustrated by an example where a feasible solution can be reached dealing with aceptable computational complexity.