Parallel algorithm for finding modules of large-scale coherent fault trees
We propose a new parallel algorithm to find all modules of a large fault tree. An experiment is used to compare the linear time algorithm and parallel algorithm. The result shows that our method is efficient in handling large-scale fault trees.
parallel algorithm fault tree modularization directed acyclic graph