Please use this identifier to cite or link to this item:
Title: An intrinsic order criterion to evaluate, large, complex fault trees
Authors: González, L. 
García, D. 
Galván, B. 
UNESCO Clasification: 110202 Algebra de Boole
Keywords: Probabilities
Fault tree evaluation
Intrinsic order
(Non) coherent fault tree
Probability bounds
Issue Date: 2004
Journal: IEEE Transactions on Reliability 
Abstract: A new efficient algorithm is introduced to evaluate (non) coherent fault trees, obtaining exact lower & upper bounds on system unavailability, with a prespecified maximum error. The algorithm is based on the canonical normal form of the Boolean function, but overcomes the large number of terms needed, by using an intrinsic order criterion (IOC) to select the elementary states to evaluate. This intrinsic order implies lexicographic (truth table) order. The criterion guarantees a priori that the probability of a given elementary system state is always greater than or equal to the probability of another state, for any set of basic probabilities. IOC is exclusively based on the positions of 0 & 1 in the binary n-tuples defining the elementary states. The algorithm does not require any qualitative analysis of the fault tree. The computational cost mainly depends on the basic event probabilities, and is related to system complexity, only because the Boolean function must be evaluated.
ISSN: 0018-9529
DOI: 10.1109/TR.2004.833307
Source: IEEE Transactions On Reliability [ISSN 0018-9529], v. 53 (3), p. 297-305, (Septiembre 2004)
Appears in Collections:Artículos
Show full item record

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.