基于generalized dominator的BDD布尔表达式优化分解

Analysis of BDD Decomposition Based on Generalized Dominator

BDD是布尔函数的一种图形表示方式,可以直观地反映出布尔函数的逻辑结构,利用BDD可以实现对布尔函数的分解和优化。针对BDD的数据结构和一种以generalizeddominators为基础的布尔表达式的优化方法进行研究,并且着重对其中的一种方法:连接的BDD分解方法(ConjunctiveBDDDecomposition)进行了详细的分析。

BDD is one of the graphic representations of Boolean functions, lt can directly reflect the logic structure of the Boolean expression. Using DBB,we can implement the decomposition and optimization of Boolean expressions.In this paper, the data structures of BDD and a BDD based Boolean expression decomposition that is based on Generalized Dominators will be introduced,And we will research one of these methods： Conjunctive BDD Decomposition.