Fault Detection in Sequential Machines.

Abstract

Sequences and techniques useful in the design of checking experiments are examined. Necessary and sufficient conditions are formulated for a machine to possess distinguishing and synchronizing sequences. Characterizing sequences are examined in detail and a previous bound is reduced by 50 percent to obtain the least upper bound on their total length. Better use is made of the strong connectedness of tested machines to achieve a 50 percent reduction over previous bounds on the length of transfer sequences. Both the reduced bounds on characterizing and on transfer sequences are used to derive a bound smaller than those published on the length of checking for a machine possessing a simple I/O sequence and a valid homing sequence. Both resettable and non-resettable machines are examined to determine the effect of the reset feature upon the length of checking experiments. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 14, 1972
Accession Number
AD0750266

Entities

People

  • Theodore T. Tylaska

Organizations

  • Naval Undersea Warfare Center

Tags

DTIC Thesaurus Topics

  • Sequences

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Calculus or Mathematical Analysis
  • Computer Programming and Software Development.