Algebraic decision diagrams and their applications
Authors:
- R.I. BaharRBR.I. Bahar
- E.A. FrohmEFE.A. Frohm
- C.M. GaonaCGC.M. Gaona
- G.D. HachtelGHG.D. Hachtel
- E. MaciiEME. Macii
- A. PardoAPA. Pardo
- F. SomenziFSF. Somenzi
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 188-191
Abstract
In this paper we present theory and experiments on the algebraic decision diagrams (ADDs). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in Boolean algebras and discuss algorithms and results in applications like matrix multiplication and shortest path algorithms. Furthermore, we outline possible applications of ADD's to logic synthesis, formal verification, and testing of digital systems.Keywords
This publication has 6 references indexed in Scilit:
- Algebraic decision diagrams and their applications1993
- Spectral transforms for large boolean functions with applications to technology mapping1993
- Algorithms for approximate FSM traversal1993
- Boolean Reasoning1990
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986