Measured Performance of a Programmed Implementation of the Subscripted D-Algorithm
暂无分享,去创建一个
[1] Prabhakar Goel,et al. An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.
[2] J. Paul Roth,et al. Diagnosis of automata failures: a calculus and a method , 1966 .
[3] John P. Hayes. TEST GENERATION USING EQUIVALENT NORMAL FORMS. , 1979 .
[4] Se June Hong,et al. Cause-Effect Analysis for Multiple Fault Detection in Combinational Networks , 1971, IEEE Transactions on Computers.
[5] L. H. Goldstein,et al. Controllability/observability analysis of digital circuits , 1978 .
[6] Jon G. Bredeson,et al. Comments on "Cause-Effect Analysis for Multiple Fault Detection in Combinational Networks" , 1974, IEEE Trans. Computers.
[7] Douglas B. Armstrong,et al. On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets , 1966, IEEE Trans. Electron. Comput..
[8] Cherif Benmehrez. Controllability/observability concepts in the subscripted d-algorithm , 1983 .
[9] J. Paul Roth,et al. Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits , 1967, IEEE Trans. Electron. Comput..
[10] P. Dorato,et al. State variables for engineers , 1967 .