Asynchronous Finite State Machines. Simulations with Imposed Processing Constraints.

Abstract

The action of computer control systems on continuous time discrete stots processes can be accurately represented by asynchronous finite stote machines, and, in particular, a subclass of these machines termed simple asynchronous machines, or SAMs. To understand the role that practical signal processing constraints may play in characterizing SAM behavior, a simulator capable of incorporating such constraints has been written. The architecture of this simulator and examples of its use are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1986
Accession Number
ADA170182

Entities

People

  • A. T. Miller
  • M. E. Koliski
  • S. Y. Kwonkam
  • T. L. Johnson

Organizations

  • Northeastern University

Tags

DTIC Thesaurus Topics

  • Air Force
  • Computers
  • Continents
  • Control Simulators
  • Control Systems
  • Electrical Engineering
  • Engineering
  • Geographic Regions
  • Intervals
  • New York
  • North America
  • Scientific Research
  • Signal Processing
  • Simulations
  • Simulators
  • United States

Readers

  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.
  • Systems Analysis and Design