A new decomposition algorithm for complex voting gates processing in qualitative fault tree analysis

Jin Wang, Shanqi Chen, Fang Wang and Liqin Hu

Journal of Risk and Reliability, 2015, vol. 229, issue 6, 568-575

Abstract: Fault tree analysis technique is one of the main methods of reliability analysis. In a fault tree, voting gate, namely k out of n ( k / n ) gate, is one of the standard Boolean logic constructs which can represent AND, OR and NOT gates. It is traditionally expanded into a combination of AND and OR gates, but such expansion results in combinatorial explosion problem in determining minimal cut sets of the fault tree for even a not very big n , especially when the voting gate inputs are complex sub-trees rather than basic events. In this article, a new decomposition algorithm based on expanded combination formula which can decompose the voting gates more quickly while the space and time complexity is lower than the traditional expansion was proposed. The results of experiments on fault trees with voting gates showed that this algorithm was more efficient than the traditional expansion method and the recursive decomposition method.

Keywords: Decomposition algorithm; voting gates; fault tree analysis; minimal cut sets; qualitative analysis (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1748006X15594488 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:risrel:v:229:y:2015:i:6:p:568-575

DOI: 10.1177/1748006X15594488

Access Statistics for this article

More articles in Journal of Risk and Reliability
Bibliographic data for series maintained by SAGE Publications ().