Unrepariable Network Reliability Analysis

The network neliability , mainly used to evaluate the large , complex system's reliability , is an important branch of the reliability theory. It can be defined as : the ability to accomplish the required task under the given condition in the given time. For an unrepairable system, reliability is an important index.The minimal path sets and the minimal cut sets are the key tools to evaluate the network reliability,which divide the system states into two: success (S=1) and failure (S=0). In this article , the auther evaluated the mimimal path sets between two nodes with the conection matrix determinant, not the tranditional matrix square function, which greatly reduced the algorithm complexity. On this basis, this article dicussed how to evaluate the mimimal path sets between two nodes when a certain arc is sure to be involved. The reliability variation when a certain arc being added or moved away was also dicussed in this article.At the same time, the auther introduced the network reliability theory into a special complex network system-voting system. The connection matrix of a network is usually large and sparse . In this article, the auther brought forward a method to reduce the connection matrix order, Which was help for saving operation time and space when it is stored in computer .In addition, the network reliability predition was partly dicussed in this article , some precise reliability bouds were obtianed.