ÐIn this paper, a slight error in the paper of Bryant [1] is corrected. It was stated in [1] that, under a certain ordering restriction, composition of two Reduced Ordered Binary Decision Diagrams (ROBDDs) results in a reduced OBDD. We show a counterexample and explore under which conditions this statement is incorrect. Index TermsÐBoolean function, Binary Decision Diagram, composition.

Pattern mining is a knowledge discovery task which is useful for finding interesting data characteristics. Existing mining techniques sometimes suffer from limited performance in challenging situations, such as when finding patterns in high-dimensional datasets. Binary Decision Diagrams and their variants are a compact and efficient graph data structure for representing and manipulating boolean...

We review Binary Decision Diagrams presenting the properties and algorithms that are most relevant to their application to the verification of sequential systems.

Reliability importance analysis is usually used to detect design weakness, to identify which components contribute the most to the failure of a system, and thus to help find the most cost-effective way for upgrading the system. In this paper, we consider the reliability importance analysis of components in a generalized phased-mission system using the Birnbaum’s measure. Our method is based on ...

Binary decision diagrams have been shown as a powerful paradigm in handling Boolean functions and have been applied to many fields such as VLSI CAD, AI, combinatorics, etc. This paper proposes a new operation on an ordered binary decision diagram (OBDD), called reordering, and demonstrates its usefulness with presenting an extended algorithmic framework of applying OBDDs to combinatorial graph ...

We compute phase diagrams for diblock copolymers in the mean-field weaksegregation regime as a function of the fraction f of A-monomers and the repulsive interaction XN. We include the ordered bicontinuous double-diamond (OBDD) phase [space

A shared binary decision diagram (SBDD) represents a multiple-output function, where nodes are shared among outputs. A partitioned SBDD usually consists of two or more SBDDs that often share nodes. The separate SBDDs are optimized independently, often resulting in a reduction in the number of nodes over a single SBDD. We show a method for partitioning a single SBDD into two parts that reduces t...

This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don't care sets. Speciically, given an incompletely speciied function g and a xed ordering of the variables, we propose an exact algorithm for selecting f such that f is a cover for g and the binary decision diagram for f is of minimum size. We proved that this problem is NP-complete. Here we show ...

A multiple-output function can be represented by a binary decision diagram for characteristic function (BDD for CF). This paper presents a method to represent multiple-output incompletely specified functions using BDD for CFs. An algorithm to reduce the widths of BDD for CFs is presented. This method is useful for decomposition of incompletely specified multiple-output functions. Experimental r...

This paper outlines the method of constructing singleelectron logic circuits based on the binary decision diagram (BDD), a graphical representation of digital functions. The circuit consists of many unit devices, BDD devices, cascaded to build the tree of a BDD graph. Each BDD device corresponds to a node of the BDD graph and operates as a two-way switch for the transport of a single electron. ...