A unifying theoretical background for some BDD-based data structures

In the paper, we propose a general concept (in what follows denoted by TBDD) for Boolean functions manipulation that is based on cube transformations. The basic idea is to manipulate a Boolean function by converting it by means of a cube transformation into a function that can be efficiently represented and manipulated in terms of ordered binary decision diagrams (OBDD's). We show that the new concept unifies and simplifies known BDD-based data structures considerably, and allows to work in all cases with the simple-structured and well-comprehended data structure of OBDD's (what is especially important from the point of practical applications). Further, to give an example how TBDD's open new ways in the search for efficient data structures for Boolean functions, we discuss the data structure of typed kFBDD's. (orig.)Available from TIB Hannover: RR 1843(94-17) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

A Unifying Theoretical Background for Some BDD-based Data Structures

In the paper, we propose a general concept (in what follows denoted by TBDD) for Boolean functions manipulation that is based on cube transformations. The basic idea is to manipulate a Boolean function by converting it by means of a cube transformation into a function that can be efficiently represented and manipulated in terms of ordered binary decision diagrams (OBDD's). We show that the new concept unifies and simplifies known BDD-based data structures considerably, and allows to work in all cases with the simple-structured and well--comprehended data struture of OBDD's (what is especially important from the point of practical applications.) Further, to give an example how TBDD's open new ways in the search for efficient data structures for Boolean functions, we discuss the data structure of typed kFBDD's