VERIFICATION OF INITIALIZATION SEQUENCES FOR SEQUENTIAL CIRCUITS BY USING DEPENDENCY MATRIXES

This article suggests an approach to the verification of initializing sequences for sequential circuits. A software prototype emulating an actual circuit is used. Using a software prototype allows for an early test case generation. Initialization sequences search and multiple verification methods are explained. Approaches like using binary and ternary logics, matrixes, and random search are discussed, results are compared and differences are explained. Other researchers experimental results based on different methods yet same circuits are included as well. Results are based on ISCAS'89 benchmarks. Experimental results show, as-good-as, or better results for same benchmark circuits compared to other methods.