Генетические алгоритмы построения идентифицирующих последовательностей для цифровых схем с памятью

Abstract

In the life cycle of development of digital circuits developer need to solve the several problems of building of input sequences: test, initializing and verifying of equivalence. In this paper a generalized approach to solving this problem is presented. It based on the genetic algorithm and avoids some problems that are intrinsic to the traditional deterministic methods.