𝔖 Bobbio Scriptorium

✦ LIBER ✦

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

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 134 KB
Volume: 27
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(87)90780-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An algorithm for obtaining simplified pr

An algorithm for obtaining simplified prime implicant sets in fault-tree and event-tree analysis : K. Takaragi, R. Sasaki and S. Shingai. IEEE Trans Reliab.R-32, 386 (October 1983)

📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 128 KB

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

An algorithm for direct computation in c

An algorithm for direct computation in consecutive-k-out-of-n:F systems: Richard C. Bollinger. IEEE Trans. Reliab. R-35 (5), 611 (1986)

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