DFT and DRBD in computing systems dependability analysis

Authors:
Salvatore Distefano;Antonio Puliafito
Affiliations:
University of Messina, Engineering Faculty, Messina, Italy;University of Messina, Engineering Faculty, Messina, Italy
Venue:
SAFECOMP'07 Proceedings of the 26th international conference on Computer Safety, Reliability, and Security
Year:
2007

Citing 3
Cited 0

Parametric Fault Tree for the Dependability Analysis of Redundant Systems and Its High-Level Petri Net Semantics

IEEE Transactions on Software Engineering
The Galileo Fault Tree Analysis Tool

FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Automatically Translating Dynamic Fault Trees into Dynamic Bayesian Networks by Means of a Software Tool

ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many alternatives are available for modeling reliability aspects, such as reliability block diagrams (RBD), fault trees (FT) or reliability graphs (RG). Since they are easy to use and to understand, they are widely spread. But, often, the stochastic independence assumption significantly limits the applicability of such tools. In particular this concerns complex systems such as computing systems. Also more enhanced formalisms as dynamic FT (DFT) could result not adequate to model dependent and dynamic aspects. To overcome this limitation we developed a new formalism derived from RBD: the dynamic RBD (DRBD). In this paper we compare the DFT and the DRBD approaches in the evaluation of a multiprocessor distributed computing system. Particular attention is given to the analysis phase, in order to highlight the capabilities of DRBD.