AN ALGORITHMIC METHOD FOR ORGANIZING CHECKING EXPERIMENTS.

Abstract

In this work an algorithm for organization of checking experiments for synchronous sequential machines possessing distinguishing sequences is given. The algorithm is based on the transition checking approach, and yields an upper bound on the length of the checking sequence smaller than those given in previous works. The actual length of the experiments is, in general, well under the bound. A method to further decrease the experiment length is described. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1968
Accession Number
AD0678158

Entities

People

  • Guney Gonenc

Organizations

  • New York University Tandon School of Engineering

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Sequences
  • Transitions

Fields of Study

  • Computer science

Readers

  • Artificial Intelligence
  • Radio communications and signal processing.