✦ LIBER ✦

An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees

✍ Scribed by Nakashima, Kyoichi; Hattori, Yoshio

Book ID: 117934048
Publisher: IEEE
Year: 1979
Tongue: English
Weight: 861 KB
Volume: R-28
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.1979.5220639

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient bottom-up algorithm for enu

An efficient bottom-up algorithm for enumerating minimal cut sets of fault trees: Kyoichi Nakashima and Yoshio Hattori. IEEE Trans. Reliab., R-28, (5) 353 (December 1979)

📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Algorithm for finding minimal cut sets i

Algorithm for finding minimal cut sets in a fault tree

✍ Ladislav Rosenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorit

An Algorithm for Reducing Cut Sets in Fa

An Algorithm for Reducing Cut Sets in Fault-Tree Analysis

✍ Limnios, N.; Ziani, R. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 710 KB

Comment on: An Algorithm for Exact Fault

Comment on: An Algorithm for Exact Fault-Tree Probabilities without Cut Sets

✍ Patterson-Hine, F. A.; Koen, B. V. 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 344 KB

An algorithm to find minimal cuts of coh

An algorithm to find minimal cuts of coherent fault-trees with event-classes, using a decision tree

✍ Carrasco, J.A.; Sune, V. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 956 KB

Evaluation of large fault-trees with rep

Evaluation of large fault-trees with repeated events using an efficient bottom-up algorithm : Karl Stecher. IEEE Trans. Reliab.R-35, 51 (1986)

📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 131 KB