IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v223y2009i4p301-311.html
   My bibliography  Save this article

Minimal cutsets-based reduction approach for the use of binary decision diagrams on probabilistic safety assessment fault tree models

Author

Listed:
  • C Ibáñez-Llano
  • A Rauzy
  • E Meléndez
  • F Nieto

Abstract

Binary decision diagrams (BDDs) are a well-known alternative to the minimal cutsets (MCS) approach to assess Boolean reliability models. While the application of fault tree analysis can be considered to be consolidated, its application to the event trees involved in the probabilistic safety assessment (PSA) studies of the nuclear industry require extended efforts. For many real PSA models the full conversion procedure remains out of reach in terms of computational resources owing to their size, non-coherency, redundancy, and complexity. A potential solution to improve the quality of assessment methods is to design hybrid algorithms that combine the information derived from the calculation of MCS with the BDD methodology. As a first step to develop this new approach, this paper explores various procedures and strategies based on this principle. First, a method is presented to reduce the fault tree model by considering only the domain of the most relevant MCS of the system prior to the BDD conversion and the impact on the final probability of the model is analysed. Second, several ordering heuristics derived from the MCS and the structural information of the model are proposed and compared, both in terms of their general performance and their sensitivity to the initial rewriting of the model. This preliminary study is applied on a set of fault tree models belonging to a real PSA study. The results obtained lead to some promising conclusions: it is shown that the topological information proves to be essential for the ordering and conversion procedures; it is also revealed that the rewriting strategies should be considered when designing variable ordering methods; and, finally, it is demonstrated that the reduction procedure provides a faster computation process without affecting the final probability. The long-term objective, which has motivated this work, is to apply this reduction procedure to quantify sequences of linked fault trees, both static and dynamic, a task for which further work is required.

Suggested Citation

  • C Ibáñez-Llano & A Rauzy & E Meléndez & F Nieto, 2009. "Minimal cutsets-based reduction approach for the use of binary decision diagrams on probabilistic safety assessment fault tree models," Journal of Risk and Reliability, , vol. 223(4), pages 301-311, December.
  • Handle: RePEc:sae:risrel:v:223:y:2009:i:4:p:301-311
    DOI: 10.1243/1748006XJRR259
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1243/1748006XJRR259
    Download Restriction: no

    File URL: https://libkey.io/10.1243/1748006XJRR259?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ibáñez-Llano, Cristina & Rauzy, Antoine & Meléndez, Enrique & Nieto, Francisco, 2010. "A reduction approach to improve the quantification of linked fault trees through binary decision diagrams," Reliability Engineering and System Safety, Elsevier, vol. 95(12), pages 1314-1323.
    2. Nývlt, Ondřej & Rausand, Marvin, 2012. "Dependencies in event trees analyzed by Petri nets," Reliability Engineering and System Safety, Elsevier, vol. 104(C), pages 45-57.
    3. Ibáñez-Llano, Cristina & Rauzy, Antoine & Meléndez, Enrique & Nieto, Francisco, 2010. "Hybrid approach for the assessment of PSA models by means of binary decision diagrams," Reliability Engineering and System Safety, Elsevier, vol. 95(10), pages 1076-1092.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:risrel:v:223:y:2009:i:4:p:301-311. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.