Multi-Objective BDD Optimization with Evolutionary Algorithms
Saeideh Shirinzadeh, Mathias Soeken, Rolf Drechsler · 2015
Binary Decision Diagrams (BDDs) are widely used in electronic design automation and formal verification. BDDs are a canonical representation of Boolean functions with respect to a variable ordering. Finding a variable ordering resulting in a small number of nodes and paths is a primary goal in BDD optimization. There are several approaches minimizing the number of nodes or paths in BDDs, but yet no method has been proposed to minimize both objectives at the same time.