Synthesis of scheduler automata guaranteeing stability and reliability of embedded control systems

Automata-based scheduling is a recent technique for pre-computed online scheduling of software control components in embedded systems. This paper studies an important aspect of automata-based scheduling that has not been addressed in the past, namely reliable control scheduling under the presence of permanent and/or transient failures in the applied control. The goal of the proposed technique is to create a scheduler automaton for every controller that recommends the scheduling patterns that are not only admissible with respect to the control performance requirements, but are also reliable with respect to the given permanent/transient failures. We conclude with a choice of admissible schedules from multiple scheduler automata, for a given set of controllers, under resource constrained environment. We illustrate the proposed approach over a case-study and present experimental results over the same.