Results 1  10
of
684,681
Partial Binary Decision Diagrams
"... AbstractDecision diagrams provide compact representations for discrete functions. There are some functions for which binary decision diagrams reach exponential size. Presented here is a method of representing Boolean functions as multiple partial decision diagrams. Index Terms binary decision di ..."
Abstract
 Add to MetaCart
AbstractDecision diagrams provide compact representations for discrete functions. There are some functions for which binary decision diagrams reach exponential size. Presented here is a method of representing Boolean functions as multiple partial decision diagrams. Index Terms binary decision
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1035 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
Compressing Binary Decision Diagrams
"... Abstract. The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the ..."
Abstract
 Add to MetaCart
Abstract. The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size
BDD Binary Decision Diagram
"... Abstractâ€”This paper proposes efficient methods to assess the reliability of phasedmission systems (PMS) considering both imperfect fault coverage (IPC), and commoncause failures (CCF). The IPC introduces multimode failures that must be considered in the accurate reliability analysis of PMS. Anoth ..."
Abstract
 Add to MetaCart
/or CCF appear as special cases of the approaches. Index Termsâ€”Binary decision diagram, commoncause failure, fault tree, imperfect fault coverage, phasedmission reliability.
Binary Decision Diagrams
"... Decision diagrams are a natural representation of finite functions. The obvious complexity measures are length and size which correspond to time and space of computations. Decision diagrams are the right model for considering space lower bounds and timespace tradeoffs. Due to the lack of powerfu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of powerful lower bound techniques, various types of restricted decision diagrams are investigated. They lead to new lower bound techniques and some of them allow efficient algorithms for a list of operations on boolean functions. Indeed, restricted decision diagrams like ordered binary decision diagrams
Equational Binary Decision Diagrams
 LOGIC FOR PROGRAMMING AND REASONING, LPAR2000, VOLUME 1955 OF LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 2000
"... We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQBDDs. A straightforward notion of ordered EQBDDs (EQOBDD) is defined, and it is proved that each EQBDD is logically equivalent to an EQOBDD. Moreover, on EQOBDDs satisfiability and tautology checki ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQBDDs. A straightforward notion of ordered EQBDDs (EQOBDD) is defined, and it is proved that each EQBDD is logically equivalent to an EQOBDD. Moreover, on EQOBDDs satisfiability and tautology
Binary Decision Diagrams for Fault Tree Analysis
, 1996
"... Binary decision diagrams for fault tree analysis ..."
An introduction to Binary Decision Diagrams
 Lecture Notes, http://www.cs.auc.dk/~kgl/VERIFICATION99/mm4.html
, 1997
"... x ..."
Optimal Free Binary Decision Diagrams
, 2002
"... Free binary decision diagrams (FBDDs) are graph{based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested during the computation at most once. The function EARn is a Boolean function on n n Boolean matrices; EARn ..."
Abstract
 Add to MetaCart
Free binary decision diagrams (FBDDs) are graph{based data structures representing Boolean functions with a constraint (additional to binary decision diagrams) that each variable is tested during the computation at most once. The function EARn is a Boolean function on n n Boolean matrices
Binary Decision Diagrams and automated
, 2004
"... Abstract This report serves as an overview of the use of Ordered Binary/Boolean Decision Diagrams (OBDDs) in automated verification. The history, key developments and current state of the problems involved will be discussed. 1 BDDs: An overview There are many ways of representing an arbitrary boolea ..."
Abstract
 Add to MetaCart
Abstract This report serves as an overview of the use of Ordered Binary/Boolean Decision Diagrams (OBDDs) in automated verification. The history, key developments and current state of the problems involved will be discussed. 1 BDDs: An overview There are many ways of representing an arbitrary
Results 1  10
of
684,681