Results 261 to 270 of about 11,440 (300)

Dynamically resizable binary decision diagrams

Proceedings of the 20th symposium on Great lakes symposium on VLSI, 2010
We present the architecture of a new Ordered Binary Decision Diagram library that is designed from the ground up to be space efficient. The main novelty lies in the library's node structure, which is modified at run-time to closely follow the variations in size of the stored OBDDs.
Stergios Stergiou, Jawahar Jain
openaire   +1 more source

Binary Decision Diagrams and neural networks

The Journal of Supercomputing, 2007
This paper describes a neural network approach that gives an estimation method for the space complexity of Binary Decision Diagrams (BDDs). A model has been developed to predict the complexity of digital circuits. The formal core of the developed neural network model (NNM) is a unique matrix for the complexity estimation over a set of BDDs derived from
P. W. Chandana Prasad, Ali Assi 0001, Azam Beg   +2 more
openaire   +1 more source

Factorization using binary decision diagrams

Cryptography and Communications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Håvard Raddum, Srimathi Varadharajan
openaire   +1 more source

Approximation and decomposition of binary decision diagrams

Proceedings of the 35th annual conference on Design automation conference - DAC '98, 1998
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs.
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple, Fabio Somenzi   +3 more
openaire   +1 more source

Binary decision diagrams and integer programming

2007
In dieser Arbeit zeigen wir, wie Binary Decision Diagrams (BDDs) als ein mächtiges Werkzeug für die 0/1 Ganzzahlige Programmierung (0/1 IP) und zugehörige polyedrische Probleme eingesetzt werden können. Wir entwickeln einen output-sensitiven Algorithmus zum Bauen eines Threshold BDDs, der die zulässigen 0/1 Lösungen einer linearen Ungleichung darstellt,
openaire   +3 more sources

Binary decision diagrams on network of workstations

Proceedings International Conference on Computer Design. VLSI in Computers and Processors, 2002
The success of all binary decision diagram (BDD) based synthesis and verification algorithms depend on the ability to efficiently manipulate very large BDDs. We present algorithms for manipulation of very large Binary Decision Diagrams (BDDs) on a network of workstations (NOW).
Rajeev K. Ranjan 0001, Jagesh V. Sanghavi, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli   +3 more
openaire   +1 more source

Synthesis for Testability: Binary Decision Diagrams

1992
We investigate the testability properties of Boolean circuits derived from (Reduced Ordered) Binary Decision Diagrams. It is shown that BDD-cirucits (or at least) BDD-like circuits are easily testable with respect to different fault models (cellular, stuck-at and path delay fault model).
openaire   +1 more source

Comments on "A characterization of binary decision diagrams"

IEEE Transactions on Computers, 1994
Chakravarty presents a characterization of BDD's in terms of the complexity of some computational problems, ibid., vol. 42, p. 129-137, Feb. 1993. In these comments, some incorrectly stated restrictions on the "number of repeated variables" are corrected and results on the translation problem (to include EXOR and NEXOR gates) are generalized. >
openaire   +1 more source

Distributed binary decision diagrams for symbolic reachability

Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017
Decision diagrams are used in symbolic verification to concisely represent state spaces. A crucial symbolic verification algorithm is reachability: systematically exploring all reachable system states. Although both parallel and distributed reachability algorithms exist, a combined solution is relatively unexplored.
Wytse Oortwijn, Tom van Dijk, Jaco van de Pol   +2 more
openaire   +2 more sources

Binary superposed quantum decision diagrams

Quantum Information Processing, 2009
The key theme of this work is the binary superposed decision diagrams or BSQDDs for short. The basic idea that lies behind BSQDDs is to represent a quantum superposition as a decision diagram where each node on each branch of a BSQDD corresponds to a gate.
openaire   +1 more source