We consider an explicit boolean function depending on n = (i + 1) j variables encoding 2-level cascade redundancies in critical systems. We establish lower and upper bounds on the size of its OBDD representation. The exact lower bound of this function is comprised between (2min( i 2 ; j 2 )) and O(2min(i;j)). The upper bound is (2i(j 2log2i)). We further show that, when one of the parameters i ...

We study the length of polynomials over nite simple non-Abelian groups needed to realize Boolean functions. We apply the results for bounding the length of 5-permutation branching programs recognizing a Boolean set. Moreover, for Boolean and general functions on these groups, we present upper bounds on the length of shortest polynomials computing an arbitrary nary Boolean or general function, o...

iv Inhaltsverzeichnis 1 Einleitung 1 1.

In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable may take a different domain. By partitioning binary input variables and representing each partition as a single multi-valued variable, we can produce a heterogeneous MDD with smaller memory size than a Reduced Ordered ...

This paper deals with the utilizing of Binary Decision Diagrams built on the Bayes-Dirichlet metric for representation of logic functions. In the first phase the Binary Decision Tree is built followed by a reduction process resulted in binary decision diagram (BDD). The BDDs are also used as a probabilistic model for advanced Bayesian decomposer for digital circuit partitioning. It is shown tha...

There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally different, in the sense that their performance can differ very much on benchmarks [14]...

We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new method. We brieey discuss the ...