✦ LIBER ✦

Algorithm for finding minimal cut sets in a fault tree

✍ Scribed by Ladislav Rosenberg

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 286 KB
Volume: 53
Category: Article
ISSN: 0951-8320
DOI: 10.1016/0951-8320(96)00034-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 algorithm for finding the minimal cut sets enables one to do so by defined requirements-according to the order of minimal cut sets, or to the number of minimal cut sets, or both. This algorithm is from three to six times faster when compared with the primary version of the CARA algorithm.

📜 SIMILAR VOLUMES

Finding minimal cut sets in a fault tree

✍ Jørn Vatn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 234 KB

This paper presents a new method for identification of minimal cut sets in a fault tree. The (non-minimal) cut sets are found by a modification of the well-known MOCUS algorithm. These cut sets are stored in a virtual tree structure which requires far less core space than the MOCUS cut set matrix. T

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

A Faster Algorithm for Finding the Minim

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

✍ J.X. Hao; J.B. Orlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

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

A hybrid algorithm for finding minimal u

A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs

✍ I. Shah 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

Minimal Unsatisfiable Subsets (MUSes) are the subsets of constraints of an overconstrained constraint satisfaction problem (CSP) that cannot be satisfied simultaneously and therefore are responsible for the conflict in the CSP. In this paper, we present a hybrid algorithm for finding MUSes in overco

A self-stabilizing algorithm for finding

A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

✍ Tetz C. Huang; Ji-Cherng Lin; Chih-Yuan Chen; Cheng-Pin Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 202 KB

A 2-dominating set in a distributed system is a set of processors such that each processor outside the set has at least two neighbors in the set. In applications, a 2-dominating set can be considered as an ideal place in the system for allocating resources, and a minimal 2-dominating set allows for