A comment on "Graph-based algorithm for Boolean function manipulation"
L. Macchiarulo, Elena Dubrova · IEEE Transactions on Computers · 2000
In this paper, a slight error in the paper of Bryant (ibid., vol.35, no.8, p.677-691, Aug. 1986 is corrected: It was stated 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.