Maximum projections of don't care conditions in a Boolean network

The ma.ximumjlexibility of a function at a nook in a Boolean network is described by the incompletely specijied function formed using the union of the satisjiability don ‘t care set (SDC) and observability don ‘t care set (ODC) of the node. The normal representation of these sets depends on eve~ variable in the network, can be quite large and may be hard to compute. Usually, we are only interested in the don ‘t care set when restricted to a certain set of variables. We give a formulation for the don ‘t care set of a no& in terms of a pre-specifzd set of variables and prove that this formulation is, the maximum projection of the entire aim ‘t care set onto the chosen set of variables. This formulation allows computation to start at the target node andproceed by traversing the network outwards. The computation rnQy be stopped at any time yielding a valid subset of the don ‘t care set.