This paper presents a theory for (disjunctive and nondisjunctive) function decomposition using the BDD representation of Boolean functions.

No abstract

No abstract

No abstract

In this paper we present a new data structure called Edge-Valued Binary-Decision Diagrams (evbdd). An evbdd is a directed acyclic graph, that provides a canonical and compact representation of functions that involve both Boolean and integer quantities. In general, evbdds p r o vide a more versatile and powerful representation that Ordinary Binary Decision Diagrams. We rst describe the structure and properties of evbdds, and present a general algorithm for performing a variety of binary operations. Next, we describe an important extension of evbdds, called Structural evbdds, and show h o w t h e y c a n b e u s e d for hierarchical veri cation.