The multiple variable order problem for binary decision diagrams: theory and practical application

Authors:
Christoph Scholl;Bernd Becker;Andreas Brogle
Affiliations:
Institute of Computer Science, Albert-Ludwigs-University, D 79110 Freiburg im Breisgau, Germany;Institute of Computer Science, Albert-Ludwigs-University, D 79110 Freiburg im Breisgau, Germany;Institute of Computer Science, Albert-Ludwigs-University, D 79110 Freiburg im Breisgau, Germany
Venue:
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Year:
2001

Citing 15
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Fast discrete function evaluation using decision diagrams

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Fast functional simulation using branching programs

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Improving the Variable Ordering of OBDDs Is NP-Complete

IEEE Transactions on Computers
Improved reachability analysis of large finite state machines

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Interleaving based variable ordering methods for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Functional simulation using binary decision diagrams

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Reachability analysis using partitioned-ROBDDs

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Decision Trees and Diagrams

ACM Computing Surveys (CSUR)
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Solving the Multiple Variable Order Problem for Binary Decision Diagrams by Use of Dynamic Reordering Techniques

Solving the Multiple Variable Order Problem for Binary Decision Diagrams by Use of Dynamic Reordering Techniques
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis

EURO-DAC '91 Proceedings of the conference on European design automation

An efficient estimation of the ROBDD's complexity

Integration, the VLSI Journal
Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient estimation of the ROBDD's complexity

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.