Abstract
We consider the problem of the verification of the implementability of a system of partially specified Boolean functions by a multiblock structure in which each block is also determined by a system of partially specified Boolean functions. A method for the solution of the problem by reducing it to the problem of the verification of the satisfiability of a conjunctive normal form that is the union of two the permissible conjunctive normal form of the multiblock structure with the prohibitive conjunctive normal form of the system of partially specified Boolean functions is proposed. Implicative methods for the construction of resolution conjunctive normal forms of multiblock structures with functional indeterminacy are proposed and studied.
Similar content being viewed by others
References
Drechsler, R., et al., Advanced Formal Verification, Kluwer, 2005.
Kuehlmann, A. and van Eijk Cornelis, A.J., Combinational and Sequential Equivalence Checking, in Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Eds., Kluwer, 2002, pp. 343–372.
Kunz, W., Marques-Silva, J., and Malik, S., SAT and ATPG: Algorithms for Boolean Decision Problems, in Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Eds., Kluwer, 2002, pp. 309–341.
Mishchenko, A., Chatterjee, S., Brayton, R., and Een, N., Improvements to Combinational Equivalence Checking, Proc. ICCAD’06, San Jose, CA, 2006, pp. 836–843.
Lam, W.K., Hardware Design Verification: Simulation and Formal Method-Based Approaches, New York: Prentice Hall, 2005.
Li, L., Thornton, M.A., and Szygenda, S.A., Integrated Design Validation: Combining Simulation and Formal Verification for Digital Integrated Circuits, J. Systemics, Cybernetics and Informatics, 2006, vol. 4, no. 2, pp. 22–30.
Cheremisinova, L. and Novikov, D.Ya., SAT-Based Approach to Verification of Logical Descriptions with Functional Indeterminacy, Proc. 8th Int. Workshop on Boolean Problems, Freiberg, 2008, pp. 59–66.
Cheremisinova, L.D. and Novikov, D.Ya., SAT-Based Formal Verification of Logical Descriptions with Functional Indeterminacy, Autom. Control Compt. Sci., 2010, vol. 44, no. 1, pp. 1–10.
Novikov, D.Ya. and Cheremisinova, L.D., Verification of Functional Descriptions with Indeterminacy on the Base of Paraphase Presentation of Boolean Functions, Informatika, 2010, no. 3, pp. 54–62.
Sorensson, N. and Een, N., MiniSat v1.13—A SAT Solver with Conflict-Clause Minimization, Proc. Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2005). http://www.lri.fr/~simon/contest/results/descriptions/solvers/minisat-static.pdf
Ganai, M.K., Zhang, L., Ashar, P., Gupta, A., and Malik, S., Combining Strengths of Circuit-Based and CNF-Based Algorithms for a High-Performance SAT Solver, Proc. ACM/IEEE Design Automation Conf., 2002, pp. 747–750.
Goldberg, E. and Novikov, D.Ya., BerkMin: A Fast and Robust SAT-Solver, Proc. European Design and Test Conf., 2002, pp. 142–149.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.Ya. Novikov, L.D. Cheremisinova, 2011, published in Avtomatika i Vychislitel’naya Tekhnika, 2011, No. 4, pp. 36–48.
About this article
Cite this article
Novikov, D.Y., Cheremisinova, L.D. Analysis of the implementability of descriptions with functional indeterminacy based on the verification of conjunctive normal form satisfiability. Aut. Conrol Comp. Sci. 45, 206–217 (2011). https://doi.org/10.3103/S0146411611040055
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411611040055