Compatible observability don´t cares revisited

CODCs stands for compatible observability don´t cares. We first examine the definition of compatibility and when a set of CODCs is compatible. We then discuss Savoj´s CODC computation for propagating CODCs from a node´s output to its fanins, and show by example, that the results can depend on the current implementation of the node. Then we generalize the computation so that the result is independent of the implementation at the node. The CODCs propagated by this computation are proved to be maximal in some sense. Local don´t cares (LDCs) are CODCs of a node, pre-imaged to the primary inputs and then imaged and projected to the local fanins of the node. LDCs combine CODCs with SDCs (satisfiability don´t cares), but only the CODC part is propagated to the fanin network. Another form of local don´t cares, propagates both the CODC and SDC parts to the fanin network. Both are shown to be compatible in some sense, but conservative. We give a method for updating both kinds of local don´t cares incrementally when other nodes in the network are changed.