Self-testing automaton networks: Their design in programmable logical matrices

M. V. Astaf'ef*, I. S. Levin, A. Yu Matrosova, V. E. Sinel'nikov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


The design of self-testing synchronous automaton networks in a base of programmable logical matrices is studied. Self-testability of the network component is ensured by encoding the automaton internal states by equilibrium codes and elongating the input state codes. Therefore, the microprogram description of the operation of the component is transformed into a positive monotonic system of disjunctive normal forms, i.e., design specification for the component. Precisely monotonic disjunctive normal forms ensure the monotonic generation of solitary constant faults in programmable logical matrices and input poles of the automaton component at the component outputs and steady propagation of the aftereffects of a faults from its emergence point in some component up to the network outputs. Therefore, testers can be used only for external components, whose outputs are the network outputs, and only the output of these components can be observed without regard for their internal states.

Original languageEnglish
Pages (from-to)1637-1651
Number of pages15
JournalAutomation and Remote Control
Issue number10
StatePublished - 2002


Dive into the research topics of 'Self-testing automaton networks: Their design in programmable logical matrices'. Together they form a unique fingerprint.

Cite this