Identifying Legal and Illegal States in Synchronous Sequential Circuits Using Test Generation

Authors:
Eduardas Bareiša;Kęstutis Motiejūnas;Rimantas Šeinauskas
Affiliations:
Department of Software Engineering, Kaunas University of Technology, Studentų 50-406, LT-3028 Kaunas, Lithuania, e-mail: kestas@soften.ktu.lt;Department of Software Engineering, Kaunas University of Technology, Studentų 50-406, LT-3028 Kaunas, Lithuania, e-mail: kestas@soften.ktu.lt;Department of Software Engineering, Kaunas University of Technology, Studentų 50-406, LT-3028 Kaunas, Lithuania, e-mail: kestas@soften.ktu.lt
Venue:
Informatica
Year:
2003

Citing 9
Cited 2

The Multiple Observation Time Test Strategy

IEEE Transactions on Computers - Special issue on fault-tolerant computing
FILL and FUNI: algorithms to identify illegal states and sequentially untestable faults

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Current Directions in Automatic Test-Pattern Generation

Computer
Simulation-Based Engineering for Industrial Competitive Advantage

IEEE Design & Test
Classification of Faults in Synchronous Sequential Circuits

IEEE Transactions on Computers
Latch Redundancy Removal Without Global Reset

ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
Procedures for Identifying Undetectable and Redundant Faults In Synchronous Sequential Circuits

VTS '99 Proceedings of the 1999 17TH IEEE VLSI Test Symposium
On Finding Undetectable and Redundant Faults in Synchronous Sequential Circuits

ICCD '98 Proceedings of the International Conference on Computer Design
Combinational ATPG theorems for identifying untestable faults in sequential circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

The Realization-Independent Testing Based on the Black Box Fault Models

Informatica
Functional Test Generation Based on Combined Random and Deterministic Search Methods

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identifying legal and illegal states significantly reduces computational complexity of ATPG. A unified framework for identification of the legal and illegal states is presented. Most known methods for identification of the legal and illegal states are interpretable within this framework. New theorems and the resulting procedures for identifying exact collection of legal or illegal states of a circuit are presented. Experimental results demonstrate that exact collection of legal states for some circuits is significantly smaller than collections obtained by backward state search algorithm and by algorithm based on combinational ATPG theorems. The use of the exact collection of legal states allows identifying more undetectable faults. The proposed procedure for identifying of the exact collection of legal states starts from any state of the circuit, builds initially an enlarged collection of legal states and converges rapidly to the exact solution.