An improved algorithm for the symbolic reliability analysis of networks

Author

Veeraraghavan, M. ; Trivedi, K.S.

Author_Institution

AT&T Bell Lab., Columbus, OH, USA

fYear

1990

fDate

9-12 Oct 1990

Firstpage

34

Lastpage

43

Abstract

An efficient Boolean algebraic algorithm for the symbolic reliability and sensitivity analysis of coherent two-terminal networks with s independent components is described. The algorithm is also applicable to a fault tree model without NOT gates. The algorithm uses the concept originally proposed by A. Grnarov, L. Kleinrock, and M. Gerla (1979). After the algorithm is presented, the errors in the original technique are illustrated by two examples. The algorithm is extended t compute the reliability importance of a given component (sensitivity of system reliability to a given component´s reliability). A computer program implementing the modified algorithm is used to solve and obtain measured time complexities for a large set of network and fault tree models

Keywords

Boolean algebra; circuit analysis computing; fault tolerant computing; sensitivity analysis; trees (mathematics); Boolean algebraic algorithm; coherent two-terminal networks; computer program; fault tree model; sensitivity analysis; symbolic reliability analysis; time complexities; Algorithm design and analysis; Computer errors; Computer network reliability; Computer networks; Computer science; Fault trees; Maintenance; NASA; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Reliable Distributed Systems, 1990. Proceedings., Ninth Symposium on

Conference_Location

Huntsville, AL

Print_ISBN

0-8186-2081-1

Type

conf

DOI

10.1109/RELDIS.1990.93949

Filename

93949