Binary Decision Diagram. Formal methods binary decision diagrams bdds sanjit a. Binary decision diagrams bdds and their reļ¬nements are data structures for representing boolean functions that is functions that take booleans as inputs and produce a boolean as output.
Binary decision diagrams bdds have been a big deal in electronic design automation eda. Many of the bdd developments have happened as a result of the applications in eda. Seshia eecs uc berkeley.
Formal methods binary decision diagrams bdds sanjit a.
Other data structures used to represent boolean functions include negation normal form zhegalkin polynomials and propositiona. For a recent and comprehensive coverage you can check out d. Unlike other compressed representations operations are performed directly on the compressed representation i e. One application of bdds is in cad software and digital circuit analysis where they are an efficient way to represent and manipulate boolean functions.
