In many real-life problems, we are often faced with manipulating sets of combinations. In this article, we study a special type of ordered binary decision diagram (OBDD), called zero-suppressed BDDs (ZBDDs). This data structure represents sets of combinations more efficiently than using original OBDDs. We discuss the basic data structures and algorithms for manipulating ZBDDs in contrast with the original OBDDs. We also present some practical applications of ZBDDs, such as solving combinatorial problems with unate cube set algebra, logic synthesis methods, Petri net processing, etc. We show that a ZBDD is a useful option in OBDD techniques, suitable for a part of the practical applications.
展开▼
机译：在许多现实生活中，我们往往面临着操纵组合组。在本文中，我们研究了一种特殊类型的有序二进制决策图（OBDD），称为零抑制的BDD（ZBDD）。该数据结构表示比使用原始OBDD更有效的组合集。我们讨论与原始OBDD相比，用于操纵ZBDDS的基本数据结构和算法。我们还提供了ZBDDS的一些实际应用，例如使用One Sate Set代数，逻辑合成方法，Petri Net Process等解决组合问题。我们表明ZBDD是OBDD技术中的一个有用的选择，适用于实际的一部分应用程序。
展开▼
