Accession Number : AD0736499

Title :   The Minimum Length of Complete Check of Asynchronous Automaton,

Corporate Author : FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO

Personal Author(s) : Vange,Kh. L.

Report Date : 11 NOV 1971

Pagination or Media Count : 15

Abstract : It is shown that a normal transition graph can be associated with a given asynchronous automaton. The minimum path in the graph which achieves the minimum length of the complete automation control is search. It is pointed out that for some limitations, of the graph minimum path, there result several linear independent mesh circuits in the graph. The analytical method of finding these circuits is given, and an illustrative example is provided. (Author)

Descriptors :   (*SWITCHING CIRCUITS, TEST METHODS), (*LOGIC CIRCUITS, TEST METHODS), GRAPHICS, MATRICES(MATHEMATICS), AUTOMATA, USSR

Subject Categories : Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE