Journal
Scientific and technical journal «Priborostroenie»
UDK004.056.53
Issue:1 (57)
Download PDF416 Kbyte
Verification of computational processes with graphical-analytical models driven by partially defined Boolean functions is considered. The problem under study consists in application of Boolean control box and cubic coatings to searching of undeclared capabilities and dead code as a result of don`t care. Examples of coatings for Boolean graph are presented, as well as verification of don`t care as a coating conjunction of relations-inequalities.