Efficient ordered binary decision diagrams minimization based on heuristics of cover pattern processing

A metric of dynamic binateness for Boolean functions is introduced. Based on it and on an analogy between an ordered binary decision diagram (OBDD) of a function and the process of recognizing strings of patterns representing the function's cover, a near linear, efficient ordering heuristic for two-level form specified functions is developed. The algorithm stably achieves on average an improvement of over 600% in OBDD size in comparison to results from similar computation complexity heuristics. The results are comparable to those obtained using lexicographic order but are achieved in less CPU time.<
>