In the binary decision diagram–based terminal-pair network reliability analysis, the size of binary decision diagram heavily depends on the chosen edge ordering. From a theoretical point of view, finding the best ordering is an intractable task. Therefore, heuristics have been used to obtain reasonably good orderings. Among them, the breadth-first search heuristic typically outperforms other he...

In this paper we consider the applicability of multi-rooted binary decision diagrams for the probabilistic model checking. The symbolic probabilistic model checking involves manipulation of functions and matrices with the values in [0, 1], and multi-terminal binary decision diagrams, sparse matrices, and combinations thereof are used to represent these objects. We propose algorithms for represe...

Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...

Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...

New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular their application to the construction of binary decision diagrams and the implementation of Boolean functions.

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 notion of weighted decision diagrams that captures many of them and present criteria for canonicity. As a special instance of such weighted diagrams, we introduce a new BDD-variant for real-valued functions, called normaliz...

This papers presents extensions of Binary Decision Diagrams to represent some infinitary relations (coded as infinite boolean functions). Four classes of infinitary relations are presented, and their representations are discussed. The widest class is closed under all boolean operations. The three others give rise to a canonical representation, which, when restricted to finite relations, are the...

We present a new automated proof method for rst-order classical logic, aimed at limiting the combinatorial explosion of the search. It is non-clausal, based on BDDs (binary decision diagrams) and on new strategies that control the size and traversal of the search space by controlling the amount of information, in Shannon's sense, gained at each step of the proof. Our prover does not search blin...