Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/72709
DC FieldValueLanguage
dc.contributor.authorGonzález, L.en_US
dc.contributor.authorGarcía, D.en_US
dc.contributor.authorGalván, B.en_US
dc.date.accessioned2020-05-21T14:08:11Z-
dc.date.available2020-05-21T14:08:11Z-
dc.date.issued2004en_US
dc.identifier.issn0018-9529en_US
dc.identifier.otherWoS-
dc.identifier.urihttp://hdl.handle.net/10553/72709-
dc.description.abstractA 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.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Reliabilityen_US
dc.sourceIEEE Transactions On Reliability [ISSN 0018-9529], v. 53 (3), p. 297-305, (Septiembre 2004)en_US
dc.subject110202 Algebra de Booleen_US
dc.subject.otherProbabilitiesen_US
dc.subject.otherFault tree evaluationen_US
dc.subject.otherIntrinsic orderen_US
dc.subject.other(Non) coherent fault treeen_US
dc.subject.otherProbability boundsen_US
dc.titleAn intrinsic order criterion to evaluate, large, complex fault treesen_US
dc.typeinfo:eu-repo/semantics/Articleen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TR.2004.833307en_US
dc.identifier.scopus4544358673-
dc.identifier.isi000223797500001-
dc.contributor.authorscopusid7202218949-
dc.contributor.authorscopusid36764332700-
dc.contributor.authorscopusid8704390300-
dc.identifier.eissn1558-1721-
dc.description.lastpage305en_US
dc.identifier.issue3-
dc.description.firstpage297en_US
dc.relation.volume53en_US
dc.investigacionCienciasen_US
dc.type2Artículoen_US
dc.contributor.daisngid1802854-
dc.contributor.daisngid5875012-
dc.contributor.daisngid1678121-
dc.description.numberofpages9en_US
dc.utils.revisionen_US
dc.contributor.wosstandardWOS:Gonzalez, L-
dc.contributor.wosstandardWOS:Garcia, D-
dc.contributor.wosstandardWOS:Galvan, B-
dc.date.coverdateSeptiembre 2004en_US
dc.identifier.ulpgces
dc.description.jcr0,828
dc.description.jcrqQ2
dc.description.scieSCIE
item.grantfulltextnone-
item.fulltextSin texto completo-
crisitem.author.deptDepartamento de Matemáticas-
crisitem.author.deptGIR Ingeniería Química y Tecnología-
crisitem.author.deptGIR SIANI: Computación Evolutiva y Aplicaciones-
crisitem.author.deptIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.parentorgDepartamento de Ingeniería de Procesos-
crisitem.author.parentorgIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.fullNameGonzález Sánchez, Luis-
crisitem.author.fullNameGarcía Vera,Diego-
crisitem.author.fullNameGalvan Gonzalez,Blas Jose-
Appears in Collections:Artículos
Show simple item record

Google ScholarTM

Check

Altmetric


Share



Export metadata



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