A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram

Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Quality and reliability engineering international 2024-07, Vol.40 (5), p.2904-2914
Hauptverfasser: Huang, Tudi, Zeng, Ying, Li, Yan‐Feng, Liu, Jun, Huang, Hong‐Zhong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches.
ISSN:0748-8017
1099-1638
DOI:10.1002/qre.3555