Back to Search
Start Over
Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams.
- Source :
-
ACM Computing Surveys . Sep92, Vol. 24 Issue 3, p293-318. 26p. - Publication Year :
- 1992
-
Abstract
- Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satisfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD data structures. Using OBDDs, a wide variety of problems can be solved through symbolic analysis. First, the possible variations in system parameters and operating conditions are encoded with Boolean variables. Then the system is evaluated for all variations by a sequence of OBDD operations. Researchers have thus solved a number of problems in digital-system design, finite-state system analysis, artificial intelligence, and mathematical logic. This paper describes the OBDD data structure and surveys a number of applications that have been solved by OBDD-based symbolic analysis. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03600300
- Volume :
- 24
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- ACM Computing Surveys
- Publication Type :
- Academic Journal
- Accession number :
- 12126273
- Full Text :
- https://doi.org/10.1145/136035.136043