Genetic algorithms for the variable ordering problem of binary decision diagrams

Lecture Notes in Computer Science

Volumn 3469, Issue , 2005, Pages 1-20

  Lenders, Wolfgang ^a   Baier, Christel ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES; FUNCTIONS; GRAPH THEORY; PROBLEM SOLVING; SWITCHING FUNCTIONS;

BINARY DECISION DIAGRAMS (BDD); FITNESS EVALUATION; HYBRIDIZATION; INPUT VARIABLES;

GENETIC ALGORITHMS;

EID: 24944535437     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513575_1     Document Type: Conference Paper

References (48)

1. Akers, S.B., Binary Decision Diagrams, IEEE Trans. on Computers, Vol. C-27, 1978
2. Bahar, R.I., Algebraic Decision Diagrams and their Applications, Proceedings on the International Conference on Computer Aided Design, 1993
3. Baker, I.E., Balancing Diversity and Convergence in Genetic Search, Ph.D. Thesis, 1987
4. Baker, I.E., Reducing Bias and Inefficiency in the Selection Algorithm, Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms, 1987
5. Bollig, B., Löbbing, M., Wegener, I., Simulated Annealing to Improve Variable Orderings for OBDDs, Proceedings of the International Workshop on Logic Synthesis, 1995
6. Bollig, B., Wegener, I., Improving the Variable Ordering of OBDDs Is NP-Complete, IEEE Transactions on Computers, Volume 45, 1996
7. Bollig, B., Lobbing, M., Wegener, I., On the Effect of Local Changes in the Variable Ordering of Ordered Binary Decision Diagrams, Information Processing Letters, Volume 59, pp 233-239, 1996.
8. Bryant, R.E., Graph-Based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers - Vol. C-35, 1986
9. Bryant, R.E., On the complexity of VLSI implementations and graph representations of Boolean functions with applications to integer multiplication, IEEE Transactions on Computers, Vol. 40, pp 205-213, 1991.
10. Clarke, E., Grumberg, O., Peled, D., Model Checking, MIT Press, 1999
11. Clarke E., Fujita, M., Zhao, X., Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams, Representations of Discrete Functions, Kluwer Academic Publishers, 1996
12. Costa, U., Deharbe, D., Moreira, A., Advances in BDD reduction using parallel genetic algorithm, Proceedings of the 10 th International Workshop on Logic Synthesis (IWLS), 2001.
13. Davis, L., Applying Adaptive Algorithms to Epistatic Domains, Proceedings of the International Joint Conference on Artificial Intelligence, 1985
14. De Jong, K., Analysis of the behavior of a class of genetic adaptive systems, Ph.D. Thesis, University of Michigan, 1975
15. Drechsler, R., Becker, B., Göckel N., A Genetic Algorithm for Variable Ordering of OBDDs, IEEE Proceedings, 143(6), pp 363-368, 1996.
16. Drechsler, R., Göckel, N., Minimization of BDDs by Evolutionary Algorithms, International Workshop on Logic Synthesis (IWLS), Lake Tahoe, 1997
17. Drechsler, R., Becker, B., Göckel, N., Learning Heuristics for OBDD Minimization by Evolutionary Algorithms, Proceedings Parallel Problem Solving from Nature (PPSN), Lecture Notes in Computer Science 1141, pp. 730-739, 1996.
18. Drechsler, R., Becker, B., Binary Decision Diagrams: Theory and Implementation, Kluwer Academic Publishers, 1998
19. Enders, R., Filkorn, T., Taubner, D., Generating BDDs for Symbolic Model checking in CCS, Distributed Computing, Vol. 6, pp 155-164, 1993.
20. Friedman, S. J., Supowit, K. J., Finding the Optimal Variable Ordering for Binary Decision Diagrams, IEEE Transactions on Computers, Volume 39, 1990
21. Fujita, M., Matsunaga, Y., Kakuda, T., On Variable Orderings of Binary Decision Diagrams for the Application of Multi-Level Logic Synthesis, Proceedings of the European Conference on Design Automation, February 1991
22. Goldberg, D.E., Lingle, R., Alleles, Loci and the Traveling Salesman Problem, Proceedings of the International Conference on Genetic Algorithms and their Applications, 1985
23. Goldberg, D.E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, 1989
24. Günther, W., Drechsler, R., Improving EAs for Sequencing Problems, Proceedings of the Genetic and Evolutionary Computation Conference, 2000.
25. Hachtel, G., Somenzi, F., Logic Synthesis and Verification Algorithms, Kluwer Academic Publishers, 1996
26. Holland, J., Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975
27. Klüppelholz, S., Ossowski, J., Tietjen, J., JJS-BDD an object oriented c++ sobdd library, University of Bonn, http://jjs-bdd.sourceforge.net/
28. Lee, C.Y., Representation of switching circuits by binary decision programs, Bell Systems Technical Journal - Vol. 38, 1959
29. Lenders, W., Genetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams, Diploma Thesis, Institut für Informatik I, Universität Bonn, Germany, 2004.
30. Malik, S., Wang, A.R., Brayton, R.K., Sangiovanni-Vincentelli, A., Logic verification using binary decision diagrams in logic synthesis environment, Proceedings ICCAD, pp 6-9, 1988.
31. McElvain, K., LGSynth93 Benchmark Set: Version 4.0, obtainable at http://www.cbl.ncsu.edu/CBL_Docs/lgs93.html, 1993
32. McMillan, K. L., Symbolic Model Checking, Kluwer Academic Publishers, 1993
33. Meinel, C., Theobald, T., Algorithms and Data Structures in VLSI Design: OBDD-Foundations and Applications, Springer-Verlag, 1998
34. Mertens, S., TSP Algorithms in Action Animated Examples of Heuristic Algorithms, University of Magdeburg, 1999
35. Minato, S., Ishiura, N., Yajima, S., Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation, In Proceedings of the 27th ACM/IEEE Design Automation Conference (DAC'90), 1990
36. Minato, S., Binary Decision Diagrams and Applications for VLSI CAD, Kluwer Academic Publishers, 1996
37. Minato, S., Zero-Suppressed BDDs and Their Applications, International Journal on Software Tools for Technology Transfer - Vol. 3, 2001
38. Oliver, I.M., Smith, D.J., Holland, J.R.C., A Study of Permutation Crossover Operators on the Traveling Salesman Problem, Proceedings of the Second International Conference on Genetic Algorithms, 1987
39. Ossowski, J., Symbolic Representation and Manipulation of discrete Functions, Diploma Thesis, University of Bonn, 2004
40. Panda, S., Somenzi, F., Who are the Variables in your Neighborhood, Proceedings of the International Conference on Computer Aided Design, 1995
41. Rudell, R., Dynamic Variable Ordering for Ordered Binary Decision Diagrams, Proceedings of the International Conference on Computer-Aided Design, 1993
42. Somenzi, F., "CUDD: CU Decision Diagram Package", University of Colorado at Boulder, 1998
43. Spears, W.M., De Jong, K.A., Bäck, T., Fogel, D.B., de Garis, H., An Overview of Evolutionary Computation, Proceedings of the European Conference on Machine Learning, 1993
44. Spears, W.M., Crossover or Mutation ?, Foundations of Genetic Algorithms 2, Morgan Kaufmann, 1993
45. Tani, S., Hamaguchi, K., The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams, Proceedings of the 4th International Symposium on Algorithms and Computation, 1993
46. Thornton, M.A., Williams, J.P., Drechsler, R., Drechsler, N., Wessels, D.M., SBDD Variable Reordering based on Probabilistic and Evolutionary Algorithms, Proceedings IEEE Pacific Rim Conference (PACRIM), pp 381-387, 1999.
47. Vose, M.D., Liepins, G.E., Schema Disruption, Proceedings of the fourth International Conference on Genetic Algorithms, 1991
48. Wegener, I., Branching Programs and Binary Decision Diagrams. Theory and Applications, Monographs on Discrete Mathematics and Applications, SIAM, 2000