Aggregation and Time Scale Analysis of Perturbed Markov Systems.

Abstract

Analysis of systems with many time scales is important in many engineering applications. This thesis addresses the approximation and decomposition of Markov processes which exhibit such multiple time scales. An algorithm is presented for the decomposition of explicitly perturbed, finite state, continuous time Markov processes. An approximation of the probability transition function which converges uniformly to zero over T greater than or equal to O is obtained. The algorithm extends previous work by providing a straightforward algorithm which has a direct probabilistic interpretation, particularly with respect to the role played by transient states. This result is then extended to consider semi Markov and discrete time Markov processes as well. Decomposition of perturbed positive systems is also addressed. Finally, the Markov process decomposition algorithm is expressed in graphical terms and applied to a problem of determining the multiple time scale structure of a fault-tolerant system model.

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA190247

Entities

People

  • Alan S. Willsky
  • Jan R. Rohlicek

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Decomposition
  • Engineering
  • Markov Processes
  • Mathematics
  • Probability
  • Transitions

Readers

  • Parallel and Distributed Computing.
  • Statistical inference.