Observability don't care sets and Boolean relations
M. Damiani, Giovanni De Micheli · 2002
An algorithm is presented that computes exact or approximate observability don't care (ODC) sets for a multiple-level combinatorial network. The proposed algorithms are efficient because they use only local information. A method for deriving the equivalence classes of a Boolean relation from the ODC sets is then proposed. Experimental results on computing ODC sets are reported.>