A practical comparison of methods to assess sum-of-products

Abstract Many methods have been proposed in the literature to assess the probability of a sum-of-products. This problem has been shown computationally hard (namely #P-hard). Therefore, algorithms can be compared only from a practical point of view. In this article, we propose first an efficient implementation of the pivotal decomposition method. This kind of algorithms is widely used in the Artificial Intelligence framework. It is unfortunately almost never considered in the reliability engineering framework, but as a pedagogical tool. We report experimental results that show that this method is in general much more efficient than classical methods that rewrite the sum-of-products under study into an equivalent sum of disjoint products. Then, we derive from our method a factorization algorithm to be used as a preprocessing method for binary decision diagrams. We show by means of experimental results that this latter approach outperforms the formers.

[1]  Tarek Bouhoufani.  Contribution à la construction et au traitement des arbres de défaillance , 1993 .

[2]  Lavon B. Page,et al.  Reliability of directed networks using the factoring theorem , 1989 .

[3]  Suresh Rai,et al.  Experimental results on preprocessing of path/cut terms in sum of disjoint products technique , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[4]  M. O. Locks,et al.  Note on disjoint products algorithms , 1992 .

[5]  Richard Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD.

[6]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[7]  Klaus D. Heidtmann,et al.  Smaller sums of disjoint products by subproduct inversion , 1989 .

[8]  Antoine Rauzy,et al.  A new methodology to handle Boolean models with loops , 2003, IEEE Trans. Reliab..

[9]  Kishor S. Trivedi,et al.  A survey of efficient reliability computation using disjoint products approach , 1995, Networks.

[10]  S. Kuo,et al.  Determining terminal-pair reliability based on edge expansion diagrams using OBDD , 1999 .

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  Olivier Coudert,et al.  Application of a new logically complete ATMS to digraph and network-connectivity analysis , 1994, Proceedings of Annual Reliability and Maintainability Symposium (RAMS).

[13]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[14]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[15]  Antoine Rauzy.  Polynomial Restrictions of SAT: What Can Be Done with an Efficient Implementation of the Davis and Putnam's Procedure? , 1995, CP.

[16]  Yves Dutuit,et al.  An optimized procedure to generate sums of disjoint products , 1999 .

[17]  Chun-Chang Liu,et al.  An improved minimizing algorithm for the summation of disjoint products by Shannon's expansion , 1993 .

[18]  Krishna B. Misra,et al.  New trends in system reliability evaluation , 1993 .

[19]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[21]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[22]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[23]  V. Vinay,et al.  Branching rules for satisfiability , 1995, Journal of Automated Reasoning.

[24]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[25]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .

[26]  Hans K. Buning,et al.  Propositional Logic: Deduction and Algorithms , 1999 .

[27]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[28]  Lavon B. Page,et al.  A practical implementation of the factoring theorem for network reliability , 1988 .

[29]  S. Rai,et al.  Experimental results on preprocessing of path/cut terms in sim of disjoint products technique , 1993 .

[30]  I. Wegener.  Branching Programs and Binary Deci-sion Diagrams-Theory and Applications , 1987 .

[31]  藤田 昌宏,et al.  Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams , 1988 .

[32]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[33]  Masahiro Fujita,et al.  Evaluation and improvement of Boolean comparison method based on binary decision diagrams , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.