Results 271 to 280 of about 65,002 (306)

Verifying Integrity of Decision Diagrams

Integration, 1998
Summary: Decision Diagrams (DDs) are the state-of-the-art data structure in CAD of integrated circuits. They are used in many safety critical applications, like verification. In this paper security aspects of implementation techniques of DDs are discussed. A recursive checksum technique is presented for on- and off-line checks.
openaire   +3 more sources

Decision diagrams for linear arithmetic

2009 Formal Methods in Computer-Aided Design, 2009
Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checking techniques (e.g., predicate abstraction). We present a new data structure, Linear Decision Diagrams (LDDs), to represent formulas in LA and its fragments, which has certain ...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman   +2 more
openaire   +1 more source

Layer Compression in Decision Diagrams

2008 20th IEEE International Conference on Tools with Artificial Intelligence, 2008
A number of compact representation forms that are investigated in the knowledge compilation community are utilized in interactive product configuration and other forms of decision support. Multi-valued decision diagrams (MDDs) are particularly well suited for interactive configuration. However, for large variable domains MDDs can be unnecessarily large
Tarik Hadzic, Esben Rune Hansen, Barry O'Sullivan   +2 more
openaire   +1 more source

Timed binary decision diagrams

Proceedings International Conference on Computer Design VLSI in Computers and Processors, 1997
The paper presents an extension to OBDDs with timing information, called timed binary decision diagrams (TBDDs). TBDDs are also canonical and allow the symbolic manipulation of Boolean functions with timing information. A TBDD software package is implemented based on the existing CMU BDD package.
Zhongcheng Li, Yuhong Zhao, Yinghua Min, Robert K. Brayton   +3 more
openaire   +1 more source

Automata and Binary Decision Diagrams

1999
We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.
Jean-Francis Michon, Jean-Marc Champarnaud   +1 more
openaire   +1 more source

Superset Generation on Decision Diagrams

2015
Generating all supersets from a given set family is important, because it is closely related to identifying cause-effect relationship. This paper presents an efficient method for superset generation by using the compressed data structures BDDs and ZDDs effectively. We analyze the size of a BDD that represents all supersets. As a by-product, we obtain a
Takahisa Toda, Shogo Takeuchi, Koji Tsuda, Shin-ichi Minato   +3 more
openaire   +1 more source

Complex spectral decision diagrams

Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96), 2002
Different decision diagrams for representations of binary and multiple-valued functions in the form of Complex Hadamard Transforms and Spectra are introduced in this paper. Since Complex Hadamard Transform matrix can be recursively expanded through Kronecker products, complex hybrid decision diagrams can be easily derived.
Bogdan J. Falkowski, Susanto Rahardja
openaire   +1 more source

Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams

1996
Functions that map vectors with binary values into the integers are important for the design and verification of arithmetic circuits. We demonstrate how multi-terminal binary decision diagrams (MTBDDs) can be used to represent such functions concisely.
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao   +2 more
openaire   +1 more source

A characterization of binary decision diagrams

IEEE Transactions on Computers, 1993
Binary decision diagrams (BDDs) are a representation of Boolean functions. Its use in the synthesis, simulation, and testing of Boolean circuits has been proposed by various researchers. In all these applications of BDDs solutions to some fundamental computational problems are needed.
openaire   +1 more source

An approach to minimization of decision diagrams

Proceedings Euromicro Symposium on Digital Systems Design, 2002
One of the most promising concepts which has been developed for efficient representation functions is Linearly Transformed Binary Decision Diagram (LTBDD). We present extensions to LTBDDs called Function-driven Decision Diagrams (fDDs). The notion of fDDs is based on using simple balanced (including nonlinear) Boolean functions for defining ...
openaire   +1 more source