Some disturbing facts about depth-first left-most variable ordering heuristics for binary decision diagrams

Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability

Volumn 222, Issue 4, 2008, Pages 573-582

  Rauzy, A B ^a  

^a CNRS   (France)

Author keywords

binary decision diagrams; fault trees; variable ordering heuristics

Indexed keywords

EID: 84990342764     PISSN: 1748006X     EISSN: 17480078     Source Type: Journal    
DOI: 10.1243/1748006XJRR174     Document Type: Article

References (22)

1. Bryant R. Graph based algorithms for Boolean function manipulation. IEEE Trans. Comput., 1986, 35 (8), 677–691
2. Brace K. Rudell R. Bryant R. Efficient implementation of a BDD package. In Proceedings of the 27th ACM/IEEE Design automation conference, Orland, FL, USA, June 1990, pp. 40–45, (IEEE, Piscataway, NJ)
3. Coudert O. Madre J.-C. Fault tree analysis: 10 prime implicants and Beyond. The Annual reliability and maintainability symposium, ARMS'93, January 1993. Atlanta NC, USA
4. Rauzy A. New algorithms for fault trees analysis. Reliab. Engng Sys., Saf, 1993, 59 (2), 203–211
5. Bryant R. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv., 1992, 24, 293–218
6. Friedman S. J. Supowit K. J. Finding the optimal variable ordering for binary decision diagrams. IEEE Trans. Comput., 1990, 39 (5), 710–713
7. Bollig B. Wegener I. Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Softw. Engng., 1996, 45 (9), 993–1001
8. Aloul F. A. Markov I. L. Sakallah K. A. FORCE: a fast and easy-to-implement variable-ordering heuristic. In Proceedings of Great Lakes Symposium on VLSI, Washington DC, 2003, pp. 116–119
9. Fujita M. Fujisawa H. Kawato N. Evaluation and improvements of Boolean comparison method based on binary decision diagrams. In Proceedings of IEEE International Conference on Computer aided design, ICCAD'88, Santa Clara, CA, USA, November 1988, pp. 2–5 (IEEE)
10. Rudell R. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of IEEE International Conference on Computer aided design, ICCAD'93, Santa Clara, CA, USA, November 1993, pp. 42–47 (IEEE)
11. Panda S. Somenzi F. Who are the variables in your neighborhood. In Proceedings of IEEE International Conference on Computer aided design, ICCAD'95, San Jose, CA, USA, November 1995, pp. 74–77 (IEEE)
12. Nikolskaia M. Rauzy A. Fine-tuning of Boolean formulae preprocessing techniques. In Proceedings of the European safety and reliability association conference, ESREL'99, volume 2, Garching, September 1999, pp. 1027–1032 (A. A. Balkema)
13. Ibañez Llano C. Meléndez Asensio E. Nieto Fuentes F. Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment. In Proceedings of. ESREL'06, Estoril, Portugal, October 2006, pp. 1645–1652 (Taylor and Francis Group)
14. Bouissou M. Bruyère F. Rauzy A. BDD based fault-tree processing: a comparison of variable ordering heuristics. In Proceedings of the ESREL'97, volume 3, Lisbon, Portugal, June 1997, pp. 2045–2052 (Pergamon)
15. Minato S. Ishiura N. Yajima S. Shared binary decision diagrams with attributed edges for efficient Boolean function manipulation. In L. J. M Claesen, (Ed.), Proceedings of the 27th ACM/IEEE Design automation conference, DAC'90, Orlando, FL, USA, June 1990, pp. 52–57 (ACM).
16. Aloul F. Markov I. Sakallah K. Improving the efficiency of circuit-to-BDD conversion by gate and input ordering. In Proceedings of the International Conference on Computer design (ICCD), Freiburg, Germany, September 2002, pp. 64–69 (IEEE)
17. Aloul F. Markov I. Sakallah K. MINCE: A static global variable-ordering heuristic for SAT search and BDD manipulation. J. Univers. Comput. Sci., 2004, 10 (12), 1562–1596
18. Reay K. A. Andrews J. D. A fault tree analysis strategy using binary decision diagrams. Reliab. Engng Syst. Saf., 2002, 78 (1), 45–56
19. Epstein S. Rauzy A. Can we trust PRA? Reliab. Engng and Syst. Saf., 2005, 88 (3), 195–205
20. Fujita M. Fujisawa H. Matsugana Y. Variable ordering algorithm for ordered binary decision diagrams and their evaluation. IEEE Trans. Comput.-Aided Des., Integr. Circuits Syst., 1993, 12 (1), 6–12
21. Garey M. R. Johnson D. S. Computers and intractability: a guide to the theory of NP-completeness, 1979, (Freeman, San Fransisco, CA)
22. Horton S. B. Optimal linear arrangement problem: algorithms and approximation. Thesis, Georgia Institute of Technology, Atlanta, Georgia, USA, May 1997