DFT and DRBD in computing systems dependability analysis

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Distefano, S., & Puliafito, A. (2007). DFT and DRBD in computing systems dependability analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4680 LNCS, pp. 423–429). Springer Verlag. https://doi.org/10.1007/978-3-540-75101-4_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free