Sciweavers

79 search results - page 2 / 16
» Efficient breadth-first manipulation of binary decision diag...
Sort
View
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 10 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
VOSS
2004
Springer
152views Mathematics» more  VOSS 2004»
13 years 11 months ago
Symbolic Representations and Analysis of Large Probabilistic Systems
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
Andrew S. Miner, David Parker
ENTCS
2006
174views more  ENTCS 2006»
13 years 5 months ago
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
Jörn Ossowski, Christel Baier
ISQED
2002
IEEE
175views Hardware» more  ISQED 2002»
13 years 10 months ago
On the Relation between SAT and BDDs for Equivalence Checking
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
Sherief Reda, Rolf Drechsler, Alex Orailoglu
DEXA
2004
Springer
83views Database» more  DEXA 2004»
13 years 9 months ago
Efficient Rule Base Verification Using Binary Decision Diagrams
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In t...
Christophe Mues, Jan Vanthienen