Representation of Boolean functions with ROBDDs
This paper describes data structures and algorithms for representation of Boolean functions with reduced ordered binary decision diagrams (ROBDDs). A hash table is used for quick search. Additional information about variables and functions is stored in binary trees. Manipulations on functions are based on a recursive algorithm of ITE operation. The primary goal of this article is describe programming technics needed to realize the idea. For the first time here recursive algorithms for composing functions and garbage collection with a formulae counter are presented. This is better than garbage collection in other known implementations. The results of the tests show that the described representation is very efficient in applications which operate with Boolean functions.
0
2017-08-02 11:40:20
1033
Reduced Ordered Binary Decision Diagram, Boolean function, logic functions, logic design verification, hash table
Boolove funkcije, algoritmi, binarni odločitveni diagram, struktura podatkov
r6
Aleš
Časar
70
Robert
Meolic
70
UDK
4
004:519.2
OceCobissID
13
6991894
COBISS_ID
3
6992150
NUK URN
18
URN:SI:UM:DK:SESLSZ31
robdd-casar-meolic.pdf
331077
Predstavitvena datoteka
2017-08-02 11:41:52