The Use of Self Checks and Voting in Software Error Detection: An Empirical Study
IEEE Transactions on Software Engineering
Component Based Design of Multitolerant Systems
IEEE Transactions on Software Engineering
Executable Assertions for Detecting Data Errors in Embedded Control Systems
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Fail-Awareness: An Approach to Construct Fail-Safe Applications
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Detectors and Correctors: A Theory of Fault-Tolerance Components
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Automated Synthesis of Multitolerance
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
An approach for designing and assessing detectors for dependable component-based systems
HASE'04 Proceedings of the Eighth IEEE international conference on High assurance systems engineering
| Hi-index | 0.00 |
In this paper, we propose a method for designing efficient fail-safe multitolerant systems. A multitolerant system is one that is able to tolerate multiple types of faults, and a fail-safe multitolerant system handles the various fault types in a fail-safe manner. Efficiency issues of interest are fault tolerance-related, and they are: (i) completeness, and (ii) accuracy. Based on earlier work, this paper makes the following contributions: (i) We develop a theory for design of efficient fail-safe multitolerance, (ii) based on the theory, we present a sound and complete algorithm that automates the addition of efficient fail-safe multitolerance, and (iii) we develop the example of an efficient fail-safe multitolerant token ring to show the viability of our approach. Our approach works for finite state systems.