📞 +91-7667918914 | ✉️ ijarcce@gmail.com
IJARCCE Logo
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 6, ISSUE 12, DECEMBER 2017

Algorithms for Reducing Cut Sets in Fault Tree Analysis

Akinode, John Lekan, Oloruntoba S.A

DOI: 10.17148/IJARCCE.2017.61207

Abstract: Fault Tree Analysis is a graphical and analytical model for identifying and accessing the relevant causes of a system risk or fault or undesired event. it is used in process system for identifying basic events or causes of an event, identifying common-cause(Minimal cut sets) failures, displaying causes and consequence of undesired event, evaluating design and investigating process accidents/incidents. The main aim of any fault-tree algorithm is to compute the minimal cut sets as quickly as possible. A cut set is a collection of component failure modes that could lead to a system failure. Cut Set Analysis (CSA) is applied to critical systems to identify and rank system vulnerabilities at design time. This paper presents a critical review of the various quantitative fault tree analysis techniques and also provide a formal procedure of each of the techniques.



Keywords: Fault Trees, Cut sets, Algorithm, Fault Tree Analysis, Minimal Cut set.

How to Cite:

[1] Akinode, John Lekan, Oloruntoba S.A, “Algorithms for Reducing Cut Sets in Fault Tree Analysis,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2017.61207