Abstract
In order to obtain a short fault- detection sequence for a sequential machine, the concept of an easily testable machine is introduced. Such a machine is one which possesses a minimal- length homogeneous distinguishing sequence and requires no transfer sequences in the faultdetection sequence. A design procedure is presented in which an arbitrary machine is embedded in an easily testable machine by adding input lines to the original machine. The procedure also derives a fault- detection sequence for the easily testable machine.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Pages | 38-42 |
| Number of pages | 5 |
| State | Published - 1971 |
| Externally published | Yes |
| Event | IEEE Conf Rec 1971 12th annu symp on switching & automata theory - East Lansing, Mich Duration: Oct 13 1971 → Oct 15 1971 |
Other
| Other | IEEE Conf Rec 1971 12th annu symp on switching & automata theory |
|---|---|
| City | East Lansing, Mich |
| Period | 10/13/71 → 10/15/71 |
ASJC Scopus subject areas
- Engineering(all)