New Algorithm for Computing Network Reliability Using Matrix Column-Transformation

In this paper, we give out some new concepts of 0-column transformation, 1-column transformation and addition of two columns. Using these transformations and network topology , combing with DFS and OBDD technology, we start from last column of the connection matrix, build a OBDD branching tree, which make use of logical expand branching condition, and last, end nodes of branching tree with 1 or some variable logical expression. With branching tree nodes, we can write out factored expression of s-t reliability of network G. This method, combining with [9] technique, can make the obtained OBDD branching tree compacted, and execution by computers may use little memory and avoid sub-graph redundancy.