Network Reliability Computation by using Different Binary Decision Diagrams

摘要

In this Paper we consider three different types of variable ordering; namely optimal ordering, good ordering and bad ordering for constructing the BDD of a given network by applying three different heuristics. This classification is based on the size of the BDD, because the size of the BDD strongly depends on the ordering of variables. After that we find the reliability of the given network by these different BDD. It is observed experimentally that the results (Reliability) of applying Classical Inclusionexclusion principle are the same as obtained by applying BDD for calculating reliability of a given network in each case. However the complexity of the BDD increases in bad ordering case