On the complexity of dynamic tests for logic functions
A generalization of the concept of dynamic test is proposed for detecting logic and parametric faults at input / output terminals of logic networks realizing k— valued logic functions (k > 2). Upper and lower bounds on the complexity (i.e., length) of minimal dynamic tests are obtained for variou...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1994
|
| Sorozat: | Acta cybernetica
11 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12537 |
| LEADER | 01074nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12537 | ||
| 005 | 20220613122107.0 | ||
| 008 | 161015s1994 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Vardanân V. A. | |
| 245 | 1 | 3 | |a On the complexity of dynamic tests for logic functions |h [elektronikus dokumentum] / |c Vardanân V. A. |
| 260 | |c 1994 | ||
| 300 | |a 333-343 | ||
| 490 | 0 | |a Acta cybernetica |v 11 No. 4 | |
| 520 | 3 | |a A generalization of the concept of dynamic test is proposed for detecting logic and parametric faults at input / output terminals of logic networks realizing k— valued logic functions (k > 2). Upper and lower bounds on the complexity (i.e., length) of minimal dynamic tests are obtained for various classes of logic functions. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12537/1/cybernetica_011_numb_004_333-343.pdf |z Dokumentum-elérés |