Implementing fault-tolerance in real-time systems by automatic program transformations
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Disassembling real-time fault-tolerant programs
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Complexity results in revising UNITY programs
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Compositional verification of fault-tolerant real-time programs
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Automating the addition of fault tolerance with discrete controller synthesis
Formal Methods in System Design
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
Distributed synthesis of fault-tolerant programs in the high atomicity model
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Active fault tolerant control of discrete event systems using online diagnostics
Automatica (Journal of IFAC)
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Mechanical verification of automatic synthesis of fault-tolerant programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Designing efficient fail-safe multitolerant systems
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Revising UNITY programs: possibilities and limitations
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
We concentrate on automated synthesis of multitolerant programs,i.e., programs that tolerate multiple classes of faultsand provide a (possibly) different level of fault-tolerance toeach class. We consider three levels of fault-tolerance: (1)failsafe, where in the presence of faults, the synthesized programguarantees safety, (2) nonmasking, where in the presenceof faults, the synthesized program recovers to states fromwhere its safety and liveness are satisfied, and (3) maskingwhere in the presence of faults the synthesized program satisfiessafety and recovers to states from where its safety andliveness are satisfied.We focus on the automated synthesis of finite-state multitolerantprograms in high atomicity model where the programcan read and write all its variables in an atomic step. Weshow that if one needs to add failsafe (respectively, nonmasking)fault-tolerance to one class of faults and masking fault-toleranceto another class of faults then such addition canbe done in polynomial time in the state space of the fault-intolerantprogram. However, if one needs to add failsafefault-tolerance to one class of faults and nonmasking fault-toleranceto another class of faults then the resulting problemis NP-complete. We find this result to be counterintuitivesince adding failsafe and nonmasking fault-tolerance to thesame class of faults (which is equivalent to adding maskingfault-tolerance to that class of faults) can be done in polynomialtime, whereas adding failsafe fault-tolerance to oneclass of faults and nonmasking fault-tolerance to a differentclass of faults is NP-complete.