Fourty years ago Quine noted that finding a procedure that computes a minimal sum
products for a given propositional formula is very complex, even though propositional …

We propose a perspective on knowledge compilation which calls for analyzing different
compilation approaches according to two key dimensions: the succinctness of the target …

We present a network decomposition method using binary decision diagrams (BDD), a state-
of-the-art data structure to encode, and manipulate Boolean functions, for computing the …

Recently introduced implicit set manipulation techniques have made it possible to formally
verify nite state machines with state graphs too large to be built. This paper shows that these …

Since their introduction in the reliability field, binary decision diagrams have proved to be the
most efficient tool to assess Boolean models such as fault trees. Their success increases the …

Aralia is a Binary Decision Diagram (BDD) package extended to handle fault trees. It is
currently developed at the University of Bordeaux as a part of a partnership between …

The performances of almost all available fault tree analysis tools are limited by the
performance of the prime implicant computation procedure used. All these products …

Fault tree analysis is an important technique in determining the safety and dependability of
complex systems. Fault trees are used as a major tool in the study of system safety as well …

Synthesis of Finite State Machines: Functional Optimization is one of two monographs
devoted to the synthesis of Finite State Machines (FSMs). This volume addresses functional …

The performances of almost all available fault tree analysis tools are limited by the
performance of their prime implicant computation procedure. All these procedures …