Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/72709
DC Field | Value | Language |
---|---|---|
dc.contributor.author | González, L. | en_US |
dc.contributor.author | García, D. | en_US |
dc.contributor.author | Galván, B. | en_US |
dc.date.accessioned | 2020-05-21T14:08:11Z | - |
dc.date.available | 2020-05-21T14:08:11Z | - |
dc.date.issued | 2004 | en_US |
dc.identifier.issn | 0018-9529 | en_US |
dc.identifier.other | WoS | - |
dc.identifier.uri | http://hdl.handle.net/10553/72709 | - |
dc.description.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. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Reliability | en_US |
dc.source | IEEE Transactions On Reliability [ISSN 0018-9529], v. 53 (3), p. 297-305, (Septiembre 2004) | en_US |
dc.subject | 110202 Algebra de Boole | en_US |
dc.subject.other | Probabilities | en_US |
dc.subject.other | Fault tree evaluation | en_US |
dc.subject.other | Intrinsic order | en_US |
dc.subject.other | (Non) coherent fault tree | en_US |
dc.subject.other | Probability bounds | en_US |
dc.title | An intrinsic order criterion to evaluate, large, complex fault trees | en_US |
dc.type | info:eu-repo/semantics/Article | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/TR.2004.833307 | en_US |
dc.identifier.scopus | 4544358673 | - |
dc.identifier.isi | 000223797500001 | - |
dc.contributor.authorscopusid | 7202218949 | - |
dc.contributor.authorscopusid | 36764332700 | - |
dc.contributor.authorscopusid | 8704390300 | - |
dc.identifier.eissn | 1558-1721 | - |
dc.description.lastpage | 305 | en_US |
dc.identifier.issue | 3 | - |
dc.description.firstpage | 297 | en_US |
dc.relation.volume | 53 | en_US |
dc.investigacion | Ciencias | en_US |
dc.type2 | Artículo | en_US |
dc.contributor.daisngid | 1802854 | - |
dc.contributor.daisngid | 5875012 | - |
dc.contributor.daisngid | 1678121 | - |
dc.description.numberofpages | 9 | en_US |
dc.utils.revision | Sí | en_US |
dc.contributor.wosstandard | WOS:Gonzalez, L | - |
dc.contributor.wosstandard | WOS:Garcia, D | - |
dc.contributor.wosstandard | WOS:Galvan, B | - |
dc.date.coverdate | Septiembre 2004 | en_US |
dc.identifier.ulpgc | Sí | es |
dc.description.jcr | 0,828 | |
dc.description.jcrq | Q2 | |
dc.description.scie | SCIE | |
item.grantfulltext | none | - |
item.fulltext | Sin texto completo | - |
crisitem.author.dept | Departamento de Matemáticas | - |
crisitem.author.dept | GIR Ingeniería Química y Tecnología | - |
crisitem.author.dept | GIR SIANI: Computación Evolutiva y Aplicaciones | - |
crisitem.author.dept | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.parentorg | Departamento de Ingeniería de Procesos | - |
crisitem.author.parentorg | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.fullName | González Sánchez, Luis | - |
crisitem.author.fullName | García Vera,Diego | - |
crisitem.author.fullName | Galvan Gonzalez,Blas Jose | - |
Appears in Collections: | Artículos |
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.