Abstract
Ordered BDDs (OBDDs) are representations of Boolean functions which have found a lot of applications in hardware and software verification, model checking, and CAD. The reason is that OBDDs allow efficient algorithms for important operations like synthesis and equivalence check. Moreover, good variable orderings are constructed by heuristic algorithms like sifting. Here worst case examples for these operations and algorithms are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
