Results 11  20
of
6,559
Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification
, 2006
"... Ordered Binary Decision Diagrams (OBDDs) have found ..."
Abstract

Cited by 121 (0 self)
 Add to MetaCart
Ordered Binary Decision Diagrams (OBDDs) have found
Approximation and Decomposition of Binary Decision Diagrams
, 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. ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
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
Resolution and Binary Decision Diagrams
, 2000
"... and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ..."
Abstract
 Add to MetaCart
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Binary Decision Diagrams on Network of Workstations
 Proc. of International Conference on Computer Design (ICCD'96
, 1996
"... 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). ANOW provides a colle ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
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). ANOW provides a
of Boolean functions. In contrast to Ordered Binary Decision Diagrams
"... Abstract: Free Binary Decision Diagrams (FBDDs) are a data structure for the representation ..."
Abstract
 Add to MetaCart
Abstract: Free Binary Decision Diagrams (FBDDs) are a data structure for the representation
Learning Ordered Binary Decision Diagrams
 In 6th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence No. 997, Jantke, Shinohara, Zeugmann (Eds
, 1995
"... This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomialtime algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a given ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomialtime algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering. We also prove that both types of queries and the restriction to a
Binary decision diagrams in theory and practice
, 2001
"... Decision diagrams (DDs) are the stateoftheart data structure in VLSI CAD and have been successfully applied in many other fields.DDs are widely used and are also integrated in commercial tools.This special section comprises six contributed articles on various aspects of the theory and application ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
and application of DDs.As preparation for these contributions, the present article reviews the basic definitions of binary decision diagrams (BDDs). We provide a brief overview and study theoretical and practical aspects.Basic properties of BDDs are discussed and manipulation algorithms are described
EDGE VALUED BINARY DECISION DIAGRAMS
"... We describe a canonical and compact data structure, called Edge Valued Binary Decision Diagrams (evbdd), for representing and manipulating pseudo Boolean functions (PBF). evbdds are particularly useful when both arithmetic and Boolean operations are required. We describe a general algorithm on evbd ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe a canonical and compact data structure, called Edge Valued Binary Decision Diagrams (evbdd), for representing and manipulating pseudo Boolean functions (PBF). evbdds are particularly useful when both arithmetic and Boolean operations are required. We describe a general algorithm
PolynomialSize Binary Decision Diagrams for
, 2004
"... Binary decision diagrams (BDDs) are graphbased data structures representing Boolean functions; `BDDs are BDDs with an additional restriction that each input bit can be tested at most ` times. A d uniform hypergraph H on N vertices is an exactly halfdhyperclique if N=2 of its vertices form a ..."
Abstract
 Add to MetaCart
Binary decision diagrams (BDDs) are graphbased data structures representing Boolean functions; `BDDs are BDDs with an additional restriction that each input bit can be tested at most ` times. A d uniform hypergraph H on N vertices is an exactly halfdhyperclique if N=2 of its vertices form
Factored edgevalued binarydecision diagrams
 Formal Methods in Systems Design
, 1997
"... In this paper we present a new data structure called EdgeValued BinaryDecision Diagrams ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a new data structure called EdgeValued BinaryDecision Diagrams
Results 11  20
of
6,559