Institute of Information Theories and Applications FOI ITHEA
The problem of checking whether a system of incompletely specified Boolean functions is implemented
by the given combinational circuit is considered. The task is reduced to testing out if two given logical descriptions
are equivalent on the domain of one of them having functional indeterminacy. We present a novel SAT-based
verification method that is used for testing whether the given circuit satisfies all the conditions represented by the
system of incompletely specified Boolean functions.