Prime implicants for modularised non-coherent fault trees using binary decision diagrams Online publication date: Thu, 13-Dec-2007
by Rasa Remenyte-Prescott, John D. Andrews
International Journal of Reliability and Safety (IJRS), Vol. 1, No. 4, 2007
Abstract: This paper presents an extended strategy for the analysis of complex fault trees. The method uses simplification rules, which are applied to the fault tree to reduce it to a series of smaller subtrees, whose solution is equivalent to the original fault tree. The smaller subtree units are less sensitive to the basic event ordering during Binary Decision Diagram (BDD) conversion. BDDs are constructed for every subtree. Qualitative analysis is performed on the set of BDDs to obtain the prime implicant sets for the original top event. It is shown how to extract the prime implicant sets from complex and modular events in order to obtain the prime implicant sets of the original fault tree in terms of basic events.
Online publication date: Thu, 13-Dec-2007
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reliability and Safety (IJRS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com