An Application of Graph Theory in Markov Chains Reliability Analysis

• DOI: 10.15598/aeee.v12i2.1037
• Publication Date: 2014-10-24T10:01:14Z
• Authors: Pavel Skalny
• Keywords: discrete time markov chain; reliability.; 0211 other engineering and technologies; flow in network; Electrical engineering. Electronics. Nuclear engineering; 02 engineering and technology; TK1-9971

The paper presents reliability analysis which was realized for an industrial company. The aim of the paper is to present the usage of discrete time Markov chains and the flow in network approach. Discrete Markov chains a well-known method of stochastic modelling describes the issue. The method is suitable for many systems occurring in practice where we can easily distinguish various amount of states. Markov chains are used to describe transitions between the states of the process. The industrial process is described as a graph network. The maximal flow in the network corresponds to the production. The Ford-Fulkerson algorithm is used to quantify the production for each state. The combination of both methods are utilized to quantify the expected value of the amount of manufactured products for the given time period.