Dependability Evaluation with Dynamic Reliability Block Diagrams and Dynamic Fault Trees

被引:64
作者
Distefano, Salvatore [1 ]
Puliafito, Antonio [2 ]
机构
[1] Univ Messina, Fac Engn, Mobile & Distributed Syst Lab, I-98166 Messina, Italy
[2] Univ Messina, Fac Engn, Dept Math, I-98166 Messina, Italy
关键词
Dynamic systems; reliability/availability; DFT; DRBD; Petri nets; PETRI NETS; PERFORMANCE; MODELS;
D O I
10.1109/TDSC.2007.70242
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Dependability evaluation is an important often-mandatory step in designing and analyzing (critical) systems. Introducing control and/or computing devices to automate processes increases the system complexity, with an impact on the overall dependability. This occurs as a consequence of interferences, dependencies, and other similar effects that cannot be adequately managed through formalisms such as reliability block diagrams (RBDs), fault trees (FTs), and reliability graphs (RGs), since the statistical independence assumption is not satisfied. In addition, more enhanced notations such as dynamic FTs (DFTs) might not be adequate to represent all the behavioral aspects of dynamic systems. To overcome these problems, we developed a new formalism derived from RBD: the dynamic RBD (DRBD). DRBD exploits the concept of dependence as the building block to represent dynamic behaviors, allowing us to compose the dependencies and adequately manage the arising conflicts by means of a priority algorithm. In this paper, we explain how we can use the DRBD notation by specifying a practical methodology. Starting from the system knowledge, the proposed methodology drives to the overall system reliability evaluation through the entire phases of modeling and analysis. Such a technique is applied to an example taken from the literature, consisting of a distributed computing system.
引用
收藏
页码:4 / 17
页数:14
相关论文
共 33 条
[1]  
[Anonymous], 2001, Probability and statistics with reliability, queueing, and computer science applications
[2]   Parametric fault tree for the dependability analysis of redundant systems and its high-level Petri Net semantics [J].
Bobbio, A ;
Franceschinis, G ;
Gaeta, R ;
Portinale, L .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2003, 29 (03) :270-287
[3]  
Bolch G., 2006, Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications
[4]   A new formalism that combines advantages of fault-trees and Markov models: Boolean logic driven Markov processes [J].
Bouissou, M ;
Bon, JL .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2003, 82 (02) :149-163
[5]  
BOYD MA, 1991, THESIS DUKE U
[6]  
CLARK G, 2001, P 9 INT WORKSH PETR
[7]  
DISTEFANO S, 2007, P 53 ANN REL MANT S
[8]  
DISTEFANO S, 2005, THESIS U MESSINA
[9]  
DISTEFANO S, 2006, P EUR SAF REL C ESRE
[10]  
DISTEFANO S, 2006, P 52 ANN REL MAINT S