Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Network reliability and algebraic structures
Network reliability and algebraic structures
Search for MC in modified networks
Computers and Operations Research
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Computers and Operations Research
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
COMPSAC '03 Proceedings of the 27th Annual International Conference on Computer Software and Applications
A BDD-Based Algorithm for Analysis of Multistate Systems with Multistate Components
IEEE Transactions on Computers
The Universal Generating Function in Reliability Analysis and Optimization (Springer Series in Reliability Engineering)
A Heuristic Algorithm for Reliability Modeling and Analysis of Grid Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Special Issue on Critical Reliability Challenges and Practices [Guest Editorial]
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Recent Advances in Optimal Reliability Allocation
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Automating Scenario Analysis of Human and System Reliability
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
An Efficient Binary-Decision-Diagram-Based Approach for Network Reliability and Sensitivity Analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
Evaluating network reliability is an important topic in planning, designing, and control of systems, and the minimal-path (MP) set is one of the fundamental tools for evaluating network reliability. A straightforward and simple algorithm is presented here for finding all MPs before calculating the binary-state network reliability between the source node and the sink node (i.e., one-to-one reliability). It is based on the universal generating function method (UGFM) and a generalized composition operator. The computational complexity of the proposed algorithm is also analyzed. Finally, an example is given to illustrate how all MPs are generated using the proposed UGFM.