Observability of Discrete Event Dynamic Systems. Revision

Abstract

A finite state automaton is adopted as a model for Discrete Event Dynamic Systems (DEDS). Observations are assumed to be a subset of the event alphabet. Observability is defined as having perfect knowledge of the current state at points in time seperated by bounded numbers of transitions. A polynomial test for observability is given. It is shown that an observer may be constructed and implemented in polynomial time and space. A bound on the cardinality of the observer state space is also presented. A notion of resiliency is defined for observers, and a test for resilient observability and a procedure for the construction of a resilient observer are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 27, 1989
Accession Number
ADA458896

Entities

People

  • Alan S. Willsky
  • Cuneyt M. Ozveren

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Automata
  • Closed Loop Systems
  • Communication Systems
  • Computational Complexity
  • Computations
  • Computer Science
  • Feedback
  • Language
  • Measurement
  • Observation
  • Observers
  • Polynomials
  • Sequences
  • Trajectories
  • Transitions

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Mathematical Modeling and Probability Theory.
  • Pavement Materials Engineering.

Technology Areas

  • Space
  • Space - Space Objects
  • Space - Spacecraft Maneuvers