Date of Original Version

7-1992

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

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. In most application, their size remains manageable. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD data structures. Using OBDDs, researchers have 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.

DOI

10.1145/136035.136043

Comments

CMU-CS-92-160

Share

COinS
 

Published In

ACM Computing Surveys, 24, 3, 293-318.