Please use this identifier to cite or link to this item:
Title: Intrinsic ordering, combinatorial numbers and reliability engineering
Authors: González Sánchez, Luis 
UNESCO Clasification: 120199 Otras (especificar)
120715 Fiabilidad de sistemas
Keywords: Reliability engineering modelling
Fault tree analysis
Top event probability
Intrinsic order
Intrinsic order graph
Hamming weight
Issue Date: 2013
Project: Avances en Simulación de Campos de Viento y Radiación Solar. 
Journal: Applied Mathematical Modelling 
Abstract: A new algorithm for evaluating the top event probability of large fault trees (FTs) is presented. This algorithm does not require any previous qualitative analysis of the FT. Indeed, its efficiency is independent of the FT logic, and it only depends on the number n of basic system components and on their failure probabilities. Our method provides exact lower and upper bounds on the top event probability by using new properties of the intrinsic order relation between binary strings. The intrinsic order enables one to select binary n-tuples with large occurrence probabilities without necessity to evaluate them. This drastically reduces the complexity of the problem from exponential (2n binary n-tuples) to linear (n Boolean variables)...
ISSN: 0307-904X
DOI: 10.1016/j.apm.2012.09.038
Source: Applied Mathematical Modelling [ISSN 0307-904X], v. 37 (6), p. 3944-3958, (Marzo 2013)
Rights: by-nc-nd
Appears in Collections:Artículos
Show full item record

Page view(s)

checked on Feb 27, 2021

Google ScholarTM




Export metadata

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