Bounds on the Reliability Polynomial for Shellable Independence Systems

Michael O. Ball; J. Scott Provan

doi:10.1137/0603016

A method of computing the coefficients of the network reliability polynomial

10.1109/glocom.1989.63991 ◽

2003 ◽

Cited By ~ 1

Author(s):

E. Ayanoglu ◽

Chih-Lin I

Keyword(s):

Network Reliability ◽

Reliability Polynomial

Download Full-text

A Recursive Formula for the Reliability of a r-Uniform Complete Hypergraph and Its Applications

Mathematical Problems in Engineering ◽

10.1155/2018/3131087 ◽

2018 ◽

Vol 2018 ◽

pp. 1-7

Author(s):

Ke Zhang ◽

Haixing Zhao ◽

Zhonglin Ye ◽

Lixin Dong

Keyword(s):

Recurrence Relations ◽

Recursive Formula ◽

Finite Graph ◽

Hard Problem ◽

Np Hard ◽

Spanning Subgraph ◽

Reliability Polynomial ◽

Np Hard Problem

The reliability polynomial R(S,p) of a finite graph or hypergraph S=(V,E) gives the probability that the operational edges or hyperedges of S induce a connected spanning subgraph or subhypergraph, respectively, assuming that all (hyper)edges of S fail independently with an identical probability q=1-p. In this paper, we investigate the probability that the hyperedges of a hypergraph with randomly failing hyperedges induce a connected spanning subhypergraph. The computation of the reliability for (hyper)graphs is an NP-hard problem. We provide recurrence relations for the reliability of r-uniform complete hypergraphs with hyperedge failure. Consequently, we determine and calculate the number of connected spanning subhypergraphs with given size in the r-uniform complete hypergraphs.

Download Full-text

Network s-t reliability bounds using a 2-dimensional reliability polynomial

IEEE Transactions on Reliability ◽

10.1109/24.285106 ◽

1994 ◽

Vol 43 (1) ◽

pp. 39-45 ◽

Cited By ~ 10

Author(s):

D. Bulka ◽

J.B. Dugan

Keyword(s):

Reliability Polynomial ◽

Reliability Bounds

Download Full-text

MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS

Probability in the Engineering and Informational Sciences ◽

10.1017/s0269964820000534 ◽

2020 ◽

pp. 1-18

Author(s):

Marilena Jianu ◽

Daniel Ciuiu ◽

Leonard Dăuş ◽

Mihail Jianu

Keyword(s):

Markov Chain ◽

Lower Bound ◽

Relative Error ◽

Fundamental Matrix ◽

Approximation Methods ◽

Arbitrary Length ◽

Reliability Polynomial ◽

Absorbing Markov Chain ◽

Markov Chain Method ◽

The Mean

In this paper, we develop a new method for evaluating the reliability polynomial of a hammock network. The method is based on a homogeneous absorbing Markov chain and provides the exact reliability for networks of width less than 5 and arbitrary length. Moreover, it produces a lower bound for the reliability polynomial for networks of width greater than or equal to 5. To investigate how sharp this lower bound is, we compare our method with other approximation methods and it proves to be the most accurate in terms of absolute as well as relative error. Using the fundamental matrix, we also calculate the average time to absorption, which provides the mean length of a network that is expected to work.

Download Full-text

Graphs models and algorithms for reliability assessment of coherent and non-coherent systems

Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk and Reliability ◽

10.1177/1748006x17744381 ◽

2018 ◽

Vol 232 (2) ◽

pp. 201-215

Author(s):

Nicolae Brînzei ◽

Jean-François Aubry

Keyword(s):

System Reliability ◽

Block Diagram ◽

Reliability Assessment ◽

Order Relation ◽

Hasse Diagram ◽

Coherent Systems ◽

Reliability Polynomial ◽

Formal Definitions ◽

Tree Models ◽

System States

In this article, we propose new models and algorithms for the reliability assessment of systems relying on concepts of graphs theory. These developments exploit the order relation on the set of system components’ states which is graphically represented by the Hasse diagram. The monotony property of the reliability structure function of coherent systems allows us to obtain an ordered graph from the Hasse diagram. This ordered graph represents all the system states and it can be obtained from only the knowledge of the system tie-sets. First of all, this model gives a new way for the research of a minimal disjoint Boolean polynomial, and, second, it is able to directly find the system reliability without resorting to an intermediate Boolean polynomial. Browsing the paths from the minimal tie-sets to the maxima of the ordered graph and using a weight associated with each node, we are able to propose a new algorithm to directly obtain the reliability polynomial by the research of sub-graphs representing eligible monomials. This approach is then extended to non-coherent systems thanks to the introduction of a new concept of terminal tie-sets. These algorithms are applied to some case studies, for both coherent and non-coherent real systems, and the results compared with those computed using standard reliability block diagram or fault tree models validate the proposed approach. Formal definitions of used graphs and of developed algorithms are also given, making their software implementation easy and efficient.

Download Full-text