Проверка схемной реализации частичных булевых функций

The task of logical verification is well studied for the case when both compared descriptions are completely specified and are given as structural representations. This case is reduced to checking on whether two combinational circuits are equivalent. In contrast to that, here the verification task is examined for a case, when desired functionality of the system under design is incompletely specified.