Journal
Scientific and technical journal «Priborostroenie»
UDK004.056.53
Issue:12 (52)
Download PDF411 Kbyte
Verification of calculation processes based on graph-analytic models governed by partially determined Boolean functions is considered. The problem is analyzed of retrieval of undeclared capabilities and open-circuits resulting from don`t care values with the use of Boolean control graph and cubical covering. Results are presented of cover construction for a Boolean graph and verification of don`t care values in the form of a cover for conjunction of identically zero relations-inequalities.