Calculation of Network System Reliability Based on Improved Disjointed Minimal Path Set

The solution of disjoint minimal path set of network system is an important approach for reliability analysis of network system. Based on disjointed algebra and BDD algorithm, an improved and simplified algorithm used to solute disjointed minimal path set is proposed. According to the different path length of minimal path set, two ways are introduced to disjoint: for the minimal path set whose length is n-1, keep the original arcs unchanged and add the inversion of those arcs which are not included in the network and get the disjointed result; disjoin the left minimal path set based on BDD algorithm and realize it through programming. It is shown that the method is efficient and accurate. It provides a new approach for reliability analysis of large scale network system.