Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,361
Partial Binary Decision Diagrams
"... Abstract--Decision 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
Abstract--Decision 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 binary-decision diagrams
- ACM COMPUTING SURVEYS
, 1992
"... Ordered Binary-Decision 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 1036 (13 self)
- Add to MetaCart
Ordered Binary-Decision 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
Binary Decision Diagrams for Fault Tree Analysis
, 1996
"... Binary decision diagrams for fault tree analysis ..."
BDD Binary Decision Diagram
"... Abstract—This paper proposes efficient methods to assess the reliability of phased-mission systems (PMS) considering both im-perfect fault coverage (IPC), and common-cause 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, common-cause failure, fault tree, imperfect fault coverage, phased-mission reliability.
Factored edge-valued binary-decision diagrams
- Formal Methods in Systems Design
, 1997
"... In this paper we present a new data structure called Edge-Valued Binary-Decision Diagrams ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this paper we present a new data structure called Edge-Valued 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 EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs 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 EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satisfiability and tautology
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 time-space trade-offs. 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
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
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
Results 1 - 10
of
1,361
