Results 11 to 20 of about 239 (84)
Approximate BDD Minimization by Weighted A* [PDF]
, 2008 Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e.
Rudiger Ebendt +3 more
core +1 more source
Learning Ordered Binary Decision Diagrams [PDF]
, 1995 This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering.
David Guijarro +2 more
core +4 more sources
Ordered Binary Decision Diagrams as Knowledge-Bases [PDF]
, 1999 We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model ...
Toshihide Ibaraki, Takashi Horiyama
core +1 more source
Size of ordered binary decision diagrams representing threshold functions [PDF]
, 1997 An ordered binary decision diagram (OBDD) is a graph representation of a Boolean function. In this paper, the size of ordered binary decision diagrams representing threshold functions is discussed. We consider two cases: the case when a variable ordering
Kaneda, T. +3 more
core +1 more source
Optimal Ordered Binary Decision Diagrams for Read-Once Formulas [PDF]
, 1999 In many applications like verification or combinatorial optimization, OBDDs (ordered binary decision diagrams) are used as a representation or data structure for Boolean functions.
Ingo Wegener +5 more
core +1 more source
Research on Key Technologies of Unit‐Based CNC Machine Tool Assembly Design
Mathematical Problems in Engineering, Volume 2014, Issue 1, 2014., 2014 Assembly is the part that produces the maximum workload and consumed time during product design and manufacturing process. CNC machine tool is the key basic equipment in manufacturing industry and research on assembly design technologies of CNC machine tool has theoretical significance and practical value.
Zhongqi Sheng +4 more
wiley +1 more source
Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams [PDF]
, 2018 Ordered Binary Decision Diagrams (OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satisfiability and equivalence straightforward.
Randal Bryant (3892378)
core +1 more source
Wu’s Characteristic Set Method for SystemVerilog Assertions Verification
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 We propose a verification solution based on characteristic set of Wu’s method towards SystemVerilog assertion checking over digital circuit systems. We define a suitable subset of SVAs so that an efficient polynomial modeling mechanism for both circuit descriptions and assertions can be applied.
Xinyan Gao +4 more
wiley +1 more source
Logic Circuit Equivalence Checking Using Haar Spectral Coefficients and Partial BDDs
VLSI Design, Volume 14, Issue 1, Page 53-64, 2002., 2002 A probabilistic equivalence checking method is developed based on the use of partial Haar Spectral Diagrams (HSDs). Partial HSDs are defined and used to represent a subset of Haar spectral coefficients for two Boolean functions. The resulting coefficients are then used to compute and to iteratively refine the probability that two functions are ...
M. A. Thornton +2 more
wiley +1 more source
Binary Decision Diagrams for Random Boolean Functions [PDF]
, 1999 Binary Decision Diagrams (BDDs) sind eine Datenstruktur für Boolesche Funktionen, die auch unter dem Namen branching program bekannt ist. In ordered binary decision diagrams (OBDDs) müssen die Tests einer festen Variablenordnung genügen.
Gröpl, C., Gröpl, Clemens
core +1 more source