A simple algorithm for sum of disjoint products

Ji Xing*, Changgen Feng, Xinming Qian, Pengfei Dai

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Citations (Scopus)

Abstract

The evaluation of network reliability and Fault Tree Analysis (FTA) is a NP-hard problem that is caused by sum-of-products. This paper presents a new algorithm for calculating system reliability by sum of disjoint products (SDP), based on Boolean algebra and generated from sum-of-products when minimal cut sets (MCS) are known. This algorithm could considerably reduce the number of disjoint (mutually exclusive) terms and save computation time with respect to top-event probability. Four major theorems of this algorithm are given, the use and correctness of which will be analyzed and proven. In addition, some examples for network reliability and FTA are illustrated to show the superiority and efficiency of the presented algorithm, which is not only easier to understand and implement but also better than the existing known SDP algorithm for large network and complex Fault Tree.

Original languageEnglish
Title of host publication2012 Annual Reliability and Maintainability Symposium, RAMS 2012 - Proceedings and Tutorials
DOIs
Publication statusPublished - 2012
Event2012 Annual Reliability and Maintainability Symposium, RAMS 2012 - Reno, NV, United States
Duration: 23 Jan 201226 Jan 2012

Publication series

NameProceedings - Annual Reliability and Maintainability Symposium
ISSN (Print)0149-144X

Conference

Conference2012 Annual Reliability and Maintainability Symposium, RAMS 2012
Country/TerritoryUnited States
CityReno, NV
Period23/01/1226/01/12

Keywords

  • Boolean algebra
  • Fault Tree Analysis
  • Minimal cut sets
  • Sum of disjoint products
  • System reliability

Fingerprint

Dive into the research topics of 'A simple algorithm for sum of disjoint products'. Together they form a unique fingerprint.

Cite this