The multiple variable order problem for binary decision diagrams

Christoph Scholl, Bernd Becker, Andreas Brogle
2001 Proceedings of the 2001 conference on Asia South Pacific design automation - ASP-DAC '01  
¢ ¤ £ ¦ ¥ § © ¦ § Reduced Ordered Binary Decision Diagrams (ROBDDs) gained widespread use in logic design verification, test generation, fault simulation, and logic synthesis [17, 7]. Since the size of an ROBDD heavily depends on the variable order used, there is a strong need to find variable orders that minimize the number of nodes in an ROBDD. In certain applications we have to cope with ROBDDs with different variable orders, whereas further manipulations of these ROBDDs require common
more » ... equire common variable orders. In this paper we give a theoretical background for this "Multiple Variable Order problem". Moreover, we solve the problem to transform ROBDDs with different variable orders into a good common variable order using dynamic variable ordering techniques.
doi:10.1145/370155.370284 dblp:conf/aspdac/SchollBB01 fatcat:46k3gtcw3rhlvbatv7gixy7xfq