摘要
The directed acyclic network (DAN) is a directed network without directed cycles and is always modeled various information, processes, and events or potential events of systems. Network reliability has been a popular tool to evaluate and validate the performance of DAN. In this study, a new simple algorithm is proposed to find all minimal paths to evaluate the DAN reliability. The proposed algorithm outperforms the existing known algorithms in calculating the DAN reliability from both theoretical and experimental aspects. The correctness and time complexity of the proposed algorithm are demonstrated and analyzed. The proposed algorithm is demonstrated on a benchmark DAN and tested its efficiency by applying it to another 20 randomly generated networks.