The Minimum Length of Complete Check of Asynchronous Automaton,
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 11, 1971
- Accession Number
- AD0736499
Entities
People
- Kh. L. Vange
Organizations
- National Air and Space Intelligence Center