disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time fault-tolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are designed from their fault-intolerant versions. Towards this end, motivated by the concepts of state predicate detection and state predicate correction , we identify three types of fault-tolerance components, namely, detectors , weak S-correctors, and strong S-correctors . We show that any hard-masking program can be decomposed into its fault-intolerant version plus a collection of detectors, and, weak and strong S -correctors. We argue that such decomposition assists in providing assurance about dependability and time-predictability of embedded systems.
real-time fault-tolerance decomposition formal methods bounded-time recovery component-based analysis