Partial equivalence checking for combinational circuits | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2025. № 71. DOI: 10.17223/19988605/71/13

Partial equivalence checking for combinational circuits

This paper suggests an algorithm for partial equivalence checking for combinational circuit with its specification. The algorithm is based on the intersection operations of single-root ROBDDs of multi-output sub-circuits, which depend on both the input and output variables of sub-circuits, as well as only the output variables of these sub-circuits. To provide fault detection within the sub-circuits that are parts of more complicate combinational circuit, an algorithm for generating test patterns depending on the input variables of the combinational circuit has been developed. The approach proposed eliminates the need for the necessity of employing Quantified Boolean Function (QBF) solvers or their modifications, which obviously entails more complex calculations than those associated with operations on ROBDDs. Contribution of the authors: the authors contributed equally to this article. The authors declare no conflicts of interests.

Download file
Counter downloads: 9

Keywords

combinational circuits, test patterns, ROBDDs

Authors

NameOrganizationE-mail
Matrosova Anzhela Yu.National Research Tomsk State Universitymau11@yandex.ru
Savenkova Marina M.National Research Tomsk State Universitymarina1412_11@mail.ru
Всего: 2

References

Матросова А.Ю., Савенкова М.М., Провкин В.А., Сухорученко К.А. Тестирование многовыходных схем // Вестник Том ского государственного университета. Управление, вычислительная техника и информатика. 2024. № 69. С. 134-143. doi: 10.17223/19988605/69/14.
Провкин В.А., Матросова А.Ю. Графовые представления множеств всех достижимых реакций комбинационной схемы // Вестник Томского государственного университета. Управление, вычислительная техника и информатика. 2022. № 61. С. 128-138. doi: 10.17223/19988605/61/13.
Scholl C., Becker B. Checking equivalence for circuits containing incompletely specified boxes // Int’l Conf. on Computer Design (ICCD). IEEE, 2002. P. 56-63.
Herbstritt M., Becker B., Scholl C. Advanced SAT-techniques for bounded model checking of blackbox designs // Int’l Workshop on Microprocessor Test and Verification (MTV). IEEE, 2006. P. 37-44.
Bryant R.E. Graph-Based Algorithms for Boolean Function Manipulation // IEEE Transactions on Computers. 1986. V. C-35, is. 8. P. 677-691.
dd package // Github.com. URL: https://github.com/tulip-control/dd (accessed: 25.04.2025).
The CUDD package, BDD, ADD Tutorial and examples // David Kebo Houngninou. URL: https://www.davidkebo.com/cudd#cudd1 (accessed: 25.04.2025).
 Partial equivalence checking for combinational circuits | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2025. № 71. DOI: 10.17223/19988605/71/13

Partial equivalence checking for combinational circuits | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2025. № 71. DOI: 10.17223/19988605/71/13

Download full-text version
Counter downloads: 43