Design and Implementation of OBDD Variable Ordering/ Reordering Methods

本研究是关于有序二叉决策图（OBDD）变量排序与重排序方法的设计与实现。 这项工作探讨了使用内存效率的数据结构，称为决策图（DD），来描述布尔函数的行为。 正在开发的是一种方法，找到一个顺序的布尔函数变量，使DD具有最小的大小。 这项研究利用条件概率的变量排序和动态重新排序的目的。 使用其OBDD表示作为输入的布尔函数的谱的计算的有效技术正在被使用。 正在开发软件来操纵OBDD以及计算概率值。

This research is on the design and implementation of ordered binary decision diagram (OBDD) variable ordering and reordering methods. The work explores the use of memory-efficient data structures, called Decision Diagrams (DD), to describe the behavior of Boolean functions. Being developed is a methodology for finding an ordering of the Boolean function variables so that the DD has minimal size. This research exploits the use of conditional probabilities for the purposes of variable ordering and dynamic reordering. Efficient techniques for computation of the spectrum of a Boolean function using its OBDD representation as input are being used. Software is being developed to manipulate OBDDs as well as compute the probability values.