✦ LIBER ✦

An Algorithm for Reducing Cut Sets in Fault-Tree Analysis

✍ Scribed by Limnios, N.; Ziani, R.

Book ID: 114668032
Publisher: IEEE
Year: 1986
Tongue: English
Weight: 710 KB
Volume: 35
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.1986.4335545

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for reducing cut sets in fa

An algorithm for reducing cut sets in fault-tree analysis : N. Limnios and R. Ziani. IEEE Trans. Reliab. R-35 (5), 559 (1986)

📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 134 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

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 for Obtaining Simplified Pr

An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis

✍ Takaragi, K.; Sasaki, R.; Shingai, S. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 800 KB

An Efficient Bottom-up Algorithm for Enu

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

✍ Nakashima, Kyoichi; Hattori, Yoshio 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 861 KB

An algorithm for exact fault-tree probab

An algorithm for exact fault-tree probabilities without cut sets : Lavon B. Page and Jo Ellen Perry. IEEE Trans. Reliab. R-35 (5), 544 (1986)

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