Graph-Based Algorithms for Boolean Function Manipulation

@article{citeulike:130315, abstract = {In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical...}, author = {Bryant, Randal E. }, citeulike-article-id = {130315}, comment = {The standard reference for reduced ordered binary decision diagrams.}, journal = {\# ieeetc}, keywords = {bdd, logic, verification}, month = {\# aug}, number = {\# 8}, pages = {677--691}, posted-at = {2005-03-16 23:04:53}, priority = {0}, title = {Graph-Based Algorithms for Boolean Function Manipulation}, url = {http://citeseer.ist.psu.edu/bryant86graphbased.html}, volume = {C-35}, year = {\# 1986} }

TY - JOUR ID - citeulike:130315 L3 - citeulike-article-id:130315 TI - Graph-Based Algorithms for Boolean Function Manipulation JF - # ieeetc VL - C-35 IS - # 8 SP - 677 EP - 691 N2 - In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical... KW - bdd KW - logic KW - verification N1 - The standard reference for reduced ordered binary decision diagrams. AU - Bryant, Randal PY - # 1986/# aug// UR - http://citeseer.ist.psu.edu/bryant86graphbased.html ER -