𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A decomposition algorithm for network reliability analysis

✍ Scribed by A. W. Shogan

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
945 KB
Volume
8
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Consider a directed, source‐sink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source to its sink, consisting only of functioning arcs. The decomposition algorithm, which can be used even after the network can undergo no further modular decomposition, is based on a partitioning of the nodes of the network into subsets that can be sequentially analyzed. The algorithm permits arbitrary dependence among arcs that terminate at nodes belonging to the same subset of the partition but requires two arcs terminating at nodes belonging to different subsets to be independent. Computational experience from a computer implementation of the algorithm is also reported.

πŸ“œ SIMILAR VOLUMES

A recursive decomposition algorithm for
A recursive decomposition algorithm for network seismic reliability evaluation
✍ Jie Li; Jun He πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 181 KB

## Abstract A new probabilistic analytical approach to evaluate seismic system reliability of large lifeline systems is presented in this paper. The algorithm takes the shortest path from the source to the terminal of a node weight or edge weight network as decomposition policy, using the Boolean l

Polynomial algorithms for estimating net
Polynomial algorithms for estimating network reliability
✍ Eitan Zemel πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 751 KB

## Abstract We consider the problem of calculating the best possible bounds on the reliability of a system given limited information about the joint density function of its components. We show that a polynomial algorithm for this problem exists iff such an algorithm exists for a certain related pro