Talk abstract:

Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams

Randall E. Bryant
Carnegie Mellon University
randy.bryant@cs.cmu.edu

Ordered Binary Decision Diagrams (OBDDs) provide an effective means of representing and manipulating Boolean functions symbolically. Functions are represented as graphs, and operations such as functional application, composition, and equation solution are implemented using graph algorithms. OBDDs are used as the underlying representation for a wide variety of tasks in digital system synthesis and verification, finite-state system analysis, and finite logic. In many cases, they have enabled the solution of much larger and more complex problems than was previously considered possible. This talk provides an introduction to BDDs, plus a survey of some of their applications.

Material used used during the talk

Back to Codes, Systems and Graphical Models

1998-1999 Mathematics in Biology