Checking Experiments for Incompletely Specified Sequential Machines.

Abstract

Methods are given for designing checking experiments for incompletely specified sequential machines (ISSM's). The methods closely parallel the methods of designing checking experiments for completely specified sequential machines (CSSM's). Therefore, the basic concepts of all the important published methods of designing checking experiments for CSSM's are summarized and referenced. These concepts are modified where necessary and are then applied to ISSM's to find checking (sequences) experiments. To verify the proposed checking experiment the I/O sequence is reduced to the original machine by one of several machine identification algorithms which are also shown and referenced. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1974
Accession Number
AD0779080

Entities

People

  • Paul L. Hoke

Organizations

  • Air Force Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Identification
  • Sequences

Readers

  • Analytical Chemistry
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design