A parallel algorithm for the manipulation of Zero-suppressed Binary Decision Diagrams (ZBDDs) on a shared memory multi-processor system was described. Theoretical analysis showed that parallel manipulation of ZBDD has a better time performance than the sequential operation of ZBDD. Since the parallel ZBDD algorithm uses much less time than the ordinary ZBDD algorithm, a real-time calculation ca...

The work deals with the problem of methods of synthesis of switching circuits with multiplexers and it is mainly focused on optimization and reduction of these circuits. It analyses and describes the state of art in optimization and reduction methods of multiplexer trees and also contains description of the justification for the use of multiplexers in the switching circuits. We design a novel m...

In this paper the new spectral method of the variable ordering in the Binary Decision Diagram (BDD) is introduced. The problem to find the best order is defined as NP-hard, and optimal solution can not be finding because optimizing algorithm is running in O(n!2n) time, and calculations can not be done for the large n. Such complexity was obviously improved in many algorithms but as will be demo...

Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems design, verification and testing, in mathematical logic, concurrent system design and in artificial intelligence. The OBDDs used in many of th...

The problem of finding an optimal variable ordering for Binary Decision Diagrams (BDD) or Multi-Valued Decision Diagrams (MDD) is widely known to be NP-Complete. This paper presents a survey of static heuristic techniques applied to ordering the variables of the BDD/MDD under construction in order to minimize the overall size of the resulting decision diagram.

In the context of knowledge compilation (KC), we study the effect of augmenting Ordered Binary Decision Diagrams (OBDD) with two kinds of decomposition nodes, i.e., AND-vertices and OR-vertices which denote conjunctive and disjunctive decomposition of propositional knowledge bases, respectively. The resulting knowledge compilation language is called Ordered {AND, OR}-decomposition and binary-De...

Binary Decision Diagrams are theoretical data structures used for formal verification of protocols and digital circuits. Previously, parallel computing algorithms designed to create these structures have experienced limited success due to their inability to exploit the inherent parallelism in the binary decision diagram creation problem. The CilkBDD algorithm uses Cilk, a C-based multithreaded ...

The Binary Decision Diagram (BDD) is used to represent in symbolic manner a set of states. It’s largely used in the field of formal checking. The variable ordering is a very important step in the BDD optimization process. A good order of variables will reduce considerably the size of a BDD. Unfortunately, the search for the best variables ordering has been showed NP-difficult. In this article, ...

Two-level logic minimization is a central problem in logic synthesis, and has applications in reliability analysis and automated reasoning. This paper represents a method of minimizing Boolean sum of products function with binary decision diagram and with disjoint sum of product minimization. Due to the symbolic representation of cubes for large problem instances, the method is orders of magnit...