A simple algorithm for sum of disjoint products

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

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

12 引用 (Scopus)

摘要

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.

源语言英语
主期刊名2012 Annual Reliability and Maintainability Symposium, RAMS 2012 - Proceedings and Tutorials
DOI
出版状态已出版 - 2012
活动2012 Annual Reliability and Maintainability Symposium, RAMS 2012 - Reno, NV, 美国
期限: 23 1月 201226 1月 2012

出版系列

姓名Proceedings - Annual Reliability and Maintainability Symposium
ISSN(印刷版)0149-144X

会议

会议2012 Annual Reliability and Maintainability Symposium, RAMS 2012
国家/地区美国
Reno, NV
时期23/01/1226/01/12

指纹

探究 'A simple algorithm for sum of disjoint products' 的科研主题。它们共同构成独一无二的指纹。

引用此