European Safety & Reliability Associaton (ESRA) and 17th Society for Risk Analysis Europe (SRA-E) Conferences (ESREL'08), Valencia (España). 22-25 Septiembre 2008
Resumen:
Binary Decision Diagrams (BDD) are a well-known alternative to the minimal cutsets approach to assess Fault Trees and Event Trees involved in the Probabilistic Safety Assessment studies of the nuclear industry. However, for many real PSA models the full conversion procedure remains out of reach in terms of computational resources. A potential solution to improve the quality of assessment methods is to design hybrid algorithms that combine the calculation of MCS with the BDD methodology. As a first step to develop this approach, in this article we explore the idea of reducing the fault tree model by considering only the domain of the most relevant MCS prior to the BDD conversion. The long term objective is to apply this reduction
procedure to quantify sequences of linked Fault Trees, both static and dynamic. We propose as well several ordering heuristics derived from the MCS and the structural information of the model, and we compare both its general performance and its sensitivity to the initial rewriting of the model.
Fecha de publicación: septiembre 2008.
Cita:
Ibáñez, C., Rauzy, A., Meléndez, E., Nieto, F., Variable Ordering techniques for the application of Binary Decision Diagrams on PSA linked Fault Tree models, European Safety & Reliability Associaton (ESRA) and 17th Society for Risk Analysis Europe (SRA-E) Conferences (ESREL'08), Valencia (España). 22-25 Septiembre 2008.
IIT-08-030A
