A Comment on 'Graph-Based Algorithm for Boolean Function Manipulation'

Authors:
Elena Dubrova;Luca Macchiarulo
Affiliations:
Royal Institute of Technology, Kista, Sweden;Politecnico di Torino, Turine, Italy
Venue:
IEEE Transactions on Computers
Year:
2000

Citing 4
Cited 1

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
Binary decision diagrams and their applications to implicit enumeration techniques in logic synthesis

Binary decision diagrams and their applications to implicit enumeration techniques in logic synthesis
Functional Decomposition through Structural Analysis of Decision Diagrams - the Binary and Multiple-Valued Cases

VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'

Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper, a slight error in the paper of Bryant [1] is corrected. It was stated in [1] that, under a certain ordering restriction, composition of two Reduced Ordered Binary Decision Diagrams (ROBDDs) results in a reduced OBDD. We show a counterexample and explore under which conditions this statement is incorrect.