نتایج جستجو برای: binary decision diagram

تعداد نتایج: 514783  

1994
C. A. J. van Eijk Geert Janssen

A major challenge in the area of hardware veriication is to devise methods that can handle circuits of practical size. This paper intends to show how the applicability of combinational circuit veriication tools based on binary decision diagrams (BDDs) can be greatly improved. The introduction of dynamic variable ordering techniques already makes these tools more robust; a designer no longer nee...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 1998
Petr Savický

Ordered binary decision diagrams (OBDDs) are a model for representing Boolean functions. There is also a more powerful variant called parity OBDDs. The size of the representation of a given function depends in both these models on an ordering of the variables. It is known that there are functions such that almost all orderings of its variables yield an OBDD of polynomial size, but there are als...

2012
Benjamin Matthes Christoph Zengler Wolfgang Küchlin

This paper is a case study on generating BDDs (binary decision diagrams) for propositional encodings of industrial configuration problems. As a testbed we use product configuration formulas arising in the automotive industry. Our main contribution is the introduction of a new improved constraint ordering heuristics incorporating structure-specific knowledge of the problem at hand. With the help...

2007
Osnat Keren Ilya Levin Radomir S. Stankovic

The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed techni...

1997
Takashi HORIYAMA Shuzo YAJIMA

An Ordered Binary Decision Diagram (OBDD) is a directed acyclic graph representing a Boolean function. The size of OBDDs largely depends on the variable ordering. In this paper, we show the size of the OBDD representing the i-th bit of the output of n-bit/n-bit integer division is (2 (n?i)=8) for any variable ordering. We also show that _-OBDDs, ^-OBDDs and-OBDDs representing integer division h...

Journal: :Inf. Comput. 1997
Stephan Waack

We present a data structure for Boolean functions, which we call Parity{OBDDs or { OBDDs, which combines the nice algorithmic properties of the well{known ordered binary decision diagrams (OBDDs) with a considerably larger descriptive power. Beginning from an algebraic characterization of the {OBDD complexity we prove in particular that the minimization of the number of nodes, the synthesis, an...

1998
Jan Behrens Stephan Waack

Ordered binary decision diagrams (OBDDs) have already proved useful for example in the veriication of combinational and sequential circuits. But the applications are limited, since the decriptive power of OBDDs is limited. Therefore several more general BDD models are studied. In this paper the so{called Parity{OBDDs are considered. The two polynomial time algorithms given are motivated by the ...

1996
Roberto Bagnara

The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis. Its (by now standard) implementation is based on reduced ordered binary-decision diagrams (ROBDDs), a well-known symbolic representation f...

Journal: :Discrete Mathematics 2006
Klaus Meer Dieter Rautenbach

We study the size of OBDDs (ordered binary decision diagrams) for representing the adjacency function fG of a graph G on n vertices. Our results are as follows: for graphs of bounded tree-width there is an OBDD of size O(logn) for fG that uses encodings of size O(logn) for the vertices; for graphs of bounded clique-width there is an OBDD of size O(n) for fG that uses encodings of size O(n) for ...

2003
Rune M. Jensen Manuela M. Veloso Randal E. Bryant

Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To date, however, no guided algorithms exist for synthesizing universal plans. In this paper, we introduce a general approach for guiding universal planning based on an existing method for heuristic symbolic search in deter...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید