By Topic

A Stable Algorithm to Calculate Steady-State Probability & Frequency of a Markov System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kumar, S. ; Department of Electrical Engineering; University of Saskatchewan; Saskatoon, Saskatchewan, S7N 0W0 CANADA ; Grassmann, W. ; Billinton, R.

This paper presents a stable method to calculate the steady-state probability and frequency of encountering a state in a Markov system. The method modifies the state transition matrix by reducing one state in each iteration until the Markov system reduces to a 2-state model. An algorithm for computer implementation is developed to calculate the probability and frequency of each state. Systems with up to 64 Markov states were solved using the approach. In each case, the method gave accurate results. The method does not involve any subtraction, so the method eliminates a source of subtractive cancellation errors. In contrast, the standard Gauss-elimination or Gauss-Jordan techniques can be affected by cancellation errors. A numerical example illustrates our approach.

Published in:

Reliability, IEEE Transactions on  (Volume:R-36 ,  Issue: 1 )