DocumentCode
1857739
Title
State Decision Diagram as the dual graphs of Binary Decision Diagrams and their applications
Author
Ghaznavi-Ghoushchi, M.B. ; Nabavi, A.R.
Author_Institution
Sch. of Eng., Tarbiat Modares Univ., Tehran, Iran
Volume
2
fYear
2002
fDate
2002
Firstpage
620
Abstract
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.
Keywords
Boolean functions; binary decision diagrams; directed graphs; duality (mathematics); state assignment; BDD; BDD graphs; Binary Decision Diagrams; Boolean functions; Rooted Directed Acyclic Graphs; graph duality; state decision diagram; Binary decision diagrams; Boolean functions; Circuit theory; Data structures; Graph theory; Metalworking machines; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2002. IEEE CCECE 2002. Canadian Conference on
ISSN
0840-7789
Print_ISBN
0-7803-7514-9
Type
conf
DOI
10.1109/CCECE.2002.1013013
Filename
1013013
Link To Document