Home > Research > Publications & Outputs > Designing efficient fail-safe multitolerant sys...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

Designing efficient fail-safe multitolerant systems

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter

Published

Standard

Designing efficient fail-safe multitolerant systems. / Jhumka, A.; Suri, Neeraj.
Formal Techniques for Networked and Distributed Systems - FORTE 2005 . Vol. 3731 LNCS Springer, 2005. p. 428-422.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter

Harvard

Jhumka, A & Suri, N 2005, Designing efficient fail-safe multitolerant systems. in Formal Techniques for Networked and Distributed Systems - FORTE 2005 . vol. 3731 LNCS, Springer, pp. 428-422. https://doi.org/10.1007/11562436_31

APA

Jhumka, A., & Suri, N. (2005). Designing efficient fail-safe multitolerant systems. In Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Vol. 3731 LNCS, pp. 428-422). Springer. https://doi.org/10.1007/11562436_31

Vancouver

Jhumka A, Suri N. Designing efficient fail-safe multitolerant systems. In Formal Techniques for Networked and Distributed Systems - FORTE 2005 . Vol. 3731 LNCS. Springer. 2005. p. 428-422 doi: 10.1007/11562436_31

Author

Jhumka, A. ; Suri, Neeraj. / Designing efficient fail-safe multitolerant systems. Formal Techniques for Networked and Distributed Systems - FORTE 2005 . Vol. 3731 LNCS Springer, 2005. pp. 428-422

Bibtex

@inbook{faff2d59ccc64cce969ef2b6b37301b5,
title = "Designing efficient fail-safe multitolerant systems",
abstract = "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. {\textcopyright} IFIP International Federation for Information Processing 2005.",
keywords = "Automation, Detectors, Fail-safe, Multitolerance, Program synthesis, Program transformation, Safety specification, Algorithms, Data processing, Fault tolerant computer systems, Finite automata, Systems analysis, Fault tolerance, Distributed computer systems, Fail safes, Program transformations, Safety specifications",
author = "A. Jhumka and Neeraj Suri",
year = "2005",
doi = "10.1007/11562436_31",
language = "English",
isbn = "354029189X ",
volume = "3731 LNCS",
pages = "428--422",
booktitle = "Formal Techniques for Networked and Distributed Systems - FORTE 2005",
publisher = "Springer",

}

RIS

TY - CHAP

T1 - Designing efficient fail-safe multitolerant systems

AU - Jhumka, A.

AU - Suri, Neeraj

PY - 2005

Y1 - 2005

N2 - 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. © IFIP International Federation for Information Processing 2005.

AB - 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. © IFIP International Federation for Information Processing 2005.

KW - Automation

KW - Detectors

KW - Fail-safe

KW - Multitolerance

KW - Program synthesis

KW - Program transformation

KW - Safety specification

KW - Algorithms

KW - Data processing

KW - Fault tolerant computer systems

KW - Finite automata

KW - Systems analysis

KW - Fault tolerance

KW - Distributed computer systems

KW - Fail safes

KW - Program transformations

KW - Safety specifications

U2 - 10.1007/11562436_31

DO - 10.1007/11562436_31

M3 - Chapter

SN - 354029189X

SN - 9783540291893

VL - 3731 LNCS

SP - 428

EP - 422

BT - Formal Techniques for Networked and Distributed Systems - FORTE 2005

PB - Springer

ER -