Information Processing Letters
Theoretical Computer Science
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Masking Faults While Providing Bounded-Time Phased Recovery
FM '08 Proceedings of the 15th international symposium on Formal Methods
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Automated incremental synthesis of timed automata
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Incremental synthesis of fault-tolerant real-time programs
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Automated addition of fault recovery to cyber-physical component-based models
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
| Hi-index | 0.00 |
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between fault-tolerance requirements and timing constraints. In this paper, we address the problem of synthesizing two types of 2-phase recovery: relaxed and graceful. Intuitively, relaxed 2-phase recovery requires that in the presence of faults, the program recovers to an acceptable behavior within some time *** and recovers to ideal behavior within time *** . And, graceful 2-phase recovery allows us to capture a requirement that the time to recover from faults is proportional to the perturbation caused by that fault. We show that the problem of synthesizing relaxed bounded-time 2-phase recovery is NP-complete although a similar problem of graceful 2-phase recovery can be solved in polynomial-time both in the size of the input program's region graph. Finally, based on the results in this paper, we argue that the requirement of intermediate recording of a fault before reaching legitimate states can increase the complexity of adding fault-tolerance substantially.