RUS  ENG
Full version
JOURNALS // Problemy Upravleniya // Archive

Probl. Upr., 2014 Issue 6, Pages 68–76 (Mi pu891)

This article is cited in 5 papers

Information technologies controls

On diagnosing of digital systems with minimal quasicomplete graph structures by dimension $7\times7$

V. A. Vedeshenkov, E. A. Kurako, V. N. Lebedev

V. A. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow

Abstract: The problems of diagnosing of digital systems (DS) with minimal quasicomplete graph structures are considered. The estimates of quantity diagnosability of analysed DS are defined on the basis of the diagnosing results of faulty situations in the DS with $7$ abonents and $7$ commutators. It is shown that the analysed DS are no more than $1$-diagnosable for faulty abonents, no more than $2$-diagnosable for faulty commutators, and no more than $1,1$-diagnosable for faulty abonents and commutators on the selected tests. The example of diagnosing of malfunctioning abonent and 2 commutators is given.

Keywords: digital system, minimal quasicomplete graph, abonent, commutator, diagnosing, diagnosability, testing module, tested subsystem.

UDC: 004.942+519.172.5



© Steklov Math. Inst. of RAS, 2025