ITHEA International Scientific Society : SEARCH ALGORITHM FOR SHORTEST SYNCHRONIZING SEQUENCES USING BOOLEAN SATISFIABILI

ITHEA Classification Structure > B. Hardware > B.6 LOGIC DESIGN > B.6.2 Reliability and Testing

SEARCH ALGORITHM FOR SHORTEST SYNCHRONIZING SEQUENCES USING BOOLEAN SATISFIABILI
By: Liudmila Cheremisinova (4002 reads)

Rating:

(1.00/10)

Abstract: The problem under consideration is to find a synchronizing sequence for a logic network with memory. A novel method is proposed that is based on formulation of the task as the Boolean satisfiability problem solved with any standard SAT solver. The developed method allows creating a Boolean equation presenting the problem in conjunctive normal form.

Keywords: design automation, verification, testing.

ACM Classification Keywords: B.6.2 Logic Design: Reliability and Testing; B.6.2 Reliability and Testing: Error-checking.

Link:

SEARCH ALGORITHM FOR SHORTEST SYNCHRONIZING SEQUENCES USING BOOLEAN SATISFIABILITY

Liudmila Cheremisinova

http://foibg.com/ijitk/ijitk-vol05/ijitk05-4-p04.pdf