Least upper bounds on OBDD sizes

Least upper bounds on OBDD sizes

This paper derives exact equations for the maximum number of nonterminal vertexes in reduced and quasi-reduced ordered binary decision diagrams (OBDD's). A reduced OBDD is reduced by both merging and deleting vertices, and a quasi-reduced OBDD is reduced only by merging. These formulas are used...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 1994-06, Vol.43 (6), p.764-767
Hauptverfasser: Heap, M.A., Mercer, M.R.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Automata
Circuit testing
Computational modeling
Computer science
control theory
systems
Error correction
Error correction codes
Exact sciences and technology
Hardware
Iterative decoding
Logical, boolean and switching functions
Merging
Programmable logic arrays
Theoretical computing
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper derives exact equations for the maximum number of nonterminal vertexes in reduced and quasi-reduced ordered binary decision diagrams (OBDD's). A reduced OBDD is reduced by both merging and deleting vertices, and a quasi-reduced OBDD is reduced only by merging. These formulas are used to tighten Lee's original bounds, and to correct the bounds recently reported by H.T. Liaw and C.S. Lin (1992).< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.286311