Symbolic Boolean manipulation with ordered binary-decision diagrams

DMCA

Symbolic Boolean manipulation with ordered binary-decision diagrams (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Randal E Bryant

Venue:	ACM COMPUTING SURVEYS
Citations:	1036 - 13 self

BibTeX

@ARTICLE{Bryant92symbolicboolean,
    author = {Randal E Bryant},
    title = {Symbolic Boolean manipulation with ordered binary-decision diagrams},
    journal = {ACM COMPUTING SURVEYS},
    year = {1992},
    volume = {24},
    number = {3},
    pages = {293--318}
}

OpenURL

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 satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD

Keyphrases

symbolic boolean manipulation ordered binary-decision diagram boolean function canonical representation graph algorithm directed acyclic graph equivalence straightforward functional property binary-decision diagram

DMCA