UNSPECIFIED (2005) Designing efficient fail-safe multitolerant systems. In: 25th International Conference on Formal Techniques for Networked and Distributed Systems, OCT 02-05, 2005, Taipei, TAIWAN.

Full text not available from this repository.

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.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2005
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-29189-X
ISSN:	0302-9743
Editor:	Wang, F
Date:	2005
Volume:	3731
Number of Pages:	15
Page Range:	pp. 428-442
Publication Status:	Published
Title of Event:	25th International Conference on Formal Techniques for Networked and Distributed Systems
Location of Event:	Taipei, TAIWAN
Date(s) of Event:	OCT 02-05, 2005
URI:	http://wrap.warwick.ac.uk/id/eprint/34228

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item