Research of Simulation Algorithm for Computing Acyclic Directed Device Network Reliability
LI Dong-kui · Jisuanji fangzhen · 2010
There is a problem in BDD algorithm,that is the symbolic expressions of reliability have too many terms and reduces efficiency of the algorithm.In this paper,the series reduction and parallel reduction in BDD algorithm are introduced.The algorithm can't produce new nodes for series nodes or parallel nodes while generating branching tree and can't save node which has been stored in computer.A new algorithm is presented for computing the two-terminal reliability of 3-state acyclic directed device networks.An example of simulation shows that the algorithm eliminates redundant terms,the quantity of branching tree node significantly is reduced,the system reliability symbol expressions can be obtained at once,and the efficiency of the algorithm is increased.The algorithm on complex network system performance assessment and system design is of great significance for reference.