Scientific Library of Tomsk State University

   E-catalog        

Normal view MARC view

BDD and DNF based algorithms for constructing all testability functions of combinational circuit O. Golubeva

By: Golubeva, OlgaMaterial type: ArticleArticleContent type: Текст Media type: электронный Subject(s): SAT-решатели | комбинационные схемы | булевы разности | функции уравляемостиGenre/Form: статьи в сборниках Online resources: Click here to access online In: International Siberian Conference on Control and Communications, May 13-15, 2021, Kazan, Russia P. [1-6]Abstract: Constructing testability functions of a combinational circuit line, such as: the controllability, observability and stuck-at fault detection functions, as well as the complement of the observability function is considered. Methods and algorithms for constructing testability functions based on Binary Decision Diagram (BDD) and Disjunctive Normal Form (DNF), as well as methods for constructing Conjunctive Normal Form (CNF) and obtaining testability functions using a SAT solver are proposed. Methods and algorithms for constructing testability functions for all and a subset of lines of a circuit are also proposed. Proposed methods and algorithms make it possible to significantly reduce the computational costs for constructing testability functions of a combinational circuit.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Библиогр.: 17 назв.

Constructing testability functions of a combinational circuit line, such as: the controllability, observability and stuck-at fault detection functions, as well as the complement of the observability function is considered. Methods and algorithms for constructing testability functions based on Binary Decision Diagram (BDD) and Disjunctive Normal Form (DNF), as well as methods for constructing Conjunctive Normal Form (CNF) and obtaining testability functions using a SAT solver are proposed. Methods and algorithms for constructing testability functions for all and a subset of lines of a circuit are also proposed. Proposed methods and algorithms make it possible to significantly reduce the computational costs for constructing testability functions of a combinational circuit.

There are no comments on this title.

to post a comment.
Share