A sequential machine for which any input sequence of a specified length is a distinguishing sequence is said to be definitely diagnosable. A method is developed to obtain for any arbitrary sequential machine a corresponding machine which contains the original one and which is definitely diagnosable. Similarly, these techniques are applied to embed machines which are not information lossless of finite order, or which do not have the finite-memory property, into machines which contain either of these properties. Simple and systematic techniques are presented for the construction, and the determination of the length, of the distinguishing sequences of these machines. Efficient fault-detection experiments are developed for machines possessing certain special distinguishing sequences. A procedure is proposed for the design of sequential machines such that they will possess these special sequences, and for which short fault-detection experiments can be constructed.
[1]
George H. Mealy,et al.
A method for synthesizing sequential circuits
,
1955
.
[2]
Charles R. Kime.
An organization for checking experiments on sequential circuits
,
1966,
IEEE Trans. Electron. Comput..
[3]
Zvi Kohavi.
Secondary State Assignment for Sequential Machines
,
1964,
IEEE Trans. Electron. Comput..
[4]
F. C. Hennine.
Fault detecting experiments for sequential circuits
,
1964,
SWCT 1964.
[5]
Shimon Even.
On Information Lossless Automata of Finite Order
,
1965,
IEEE Trans. Electron. Comput..
[6]
D. A. Huffman.
Canonical forms for information-lossless finite-state logical machines
,
1959
.