An Experimental Evaluation of Algorithms for Computation of Internal Don’t-Cares in Boolean Networks
Alan Mishchenko · 2001
The goal of this study is to evaluate the efficiency of don’t-care computation in boolean networks using several algorithms. The algorithms are compared using the following three parameters: (1) the amount of don’t-cares generated for the nodes of the network; (2) the sum total of literal counts in the factored forms of all nodes after the generated don’t-cares have been used to simplify each node in the boolean network; and (3) the runtime requirements.