Santhosh Prabhu, M ; Hazra, Aritra ; Dasgupta, Pallab (2013) Reliability guarantees in automata-based scheduling for embedded control software IEEE Embedded Systems Letters, 5 (2). pp. 17-20. ISSN 1943-0663
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/6472271/
Related URL: http://dx.doi.org/10.1109/LES.2013.2250479
Abstract
Automata-based scheduling is a recent technique for online scheduling of software control components in embedded systems. This letter studies one important aspect of automata-based scheduling that has not been studied in the past, namely resilience to faults. The goal of the proposed technique is to create an automaton that recommends the scheduling patterns that are admissible with respect to control performance requirements, when the state of the system has been mutated by faults. The problem has been formulated as a game between the scheduler and the (possibly faulty) system, where a winning strategy of the scheduler prevents the system from reaching bad states forever. We present a method for analyzing the structure of the game and extracting an automaton that captures the winning strategies of the scheduler, namely the automaton to be used for automata-based scheduling.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| Keywords: | Reliable Scheduling; Automata-Based Scheduling; Embedded Control Systems; Fault-Tolerant System |
| ID Code: | 100846 |
| Deposited On: | 09 Mar 2018 10:16 |
| Last Modified: | 09 Mar 2018 10:16 |
Repository Staff Only: item control page
