State Decision Diagram as the dual graphs of Binary Decision Diagrams and their applications

Binary Decision Diagrams (BDD) are Rooted Directed Acyclic Graphs. BDD graphs are canonical forms of representation for Boolean functions. In this paper we proposed a new graph derived from BDD by making graph duality on it. This new graph is differs from classical dual graphs. The new graph is cyclic and its nodes represent the states of the Boolean function. Basic definitions and algorithms of SDD are represented Two applications of the proposed graph are included too.