Bi-partition of shared binary decision diagrams
نویسندگان
چکیده
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 the node count. Among the benchmark functions tested, a node reduction of up to 16% is realized. Keyword: Shared binary decision diagram, SBDD, bipartition, multiple-output function, decomposition.
منابع مشابه
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, as its space requirement grows exponentially with the number of variables involved, computations may become prohibitive or even impossible for belief functions with larger domains. This paper proposes shared ordered b...
متن کاملCompact Representations of Logic Functions using Heterogeneous MDDs
In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable may take a different domain. By partitioning binary input variables and representing each partition as a single multi-valued variable, we can produce a heterogeneous MDD with smaller memory size than a Reduced Ordered ...
متن کاملRepresentations of Multiple-Output Functions Using Binary Decision Diagrams for Characteristic Functions
This paper proposes a method to construct smaller binary decision diagrams for characteristic functions (BDDs for CFs). A BDD for CF represents an n-input m-output function, and evaluates all the outputs in O(n+m) time. We derive an upper bound on the number of nodes of the BDD for CF of n-bit adders (adrn). We also compare complexities of BDDs for CFs with those of shared binary decision diagr...
متن کاملLex-Partitioning: A New Option for BDD Search
For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic functions. BDD partitioning is used to compute the image as the disjunction of smaller subimages. In this paper, we propose a novel BDD partitioning option...
متن کاملAn N Log N Algorithm for Online Bdd Reenement ?
Binary Decision Diagrams are in widespread use in veriica-tion systems for the canonical representation of nite functions. Here we consider multi-valued BDDs, which represent functions of the form ' : B ! L, where L is a nite set of leaves. We study a rather natural online BDD reenement problem: a partition of the leaves of several shared BDDs is gradually reened, and the equivalence of the BDD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000