✦ LIBER ✦

A simple method to derive minimal cut sets for a non-coherent fault tree

✍ Scribed by Takehisa Kohda

Book ID: 107435597
Publisher: Institute of Automation, Chinese Academy of Sciences
Year: 2006
Tongue: English
Weight: 169 KB
Volume: 3
Category: Article
ISSN: 1476-8186
DOI: 10.1007/s11633-006-0151-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal cut sets of a coherent fault tre

Minimal cut sets of a coherent fault tree generation using reverse Petri nets

✍ Makajić-Nikolić, Dragana; Vujošević, Mirko; Nikolić, Nebojša 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 407 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 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