An Application of Graph theory in Markov chains reliability analysis

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27600%2F14%3A86093303" target="_blank" >RIV/61989100:27600/14:86093303 - isvavai.cz</a>
Result on the web
<a href="http://advances.utc.sk/index.php/AEEE/article/viewFile/1037/970" target="_blank" >http://advances.utc.sk/index.php/AEEE/article/viewFile/1037/970</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.15598/aeee.v12i2.1037" target="_blank" >10.15598/aeee.v12i2.1037</a>

Result language
angličtina
Original language name
An Application of Graph theory in Markov chains reliability analysis
Original language description
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 mod- elling 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 cor- responds to the production. The Ford-Fulkerson algorithm is used to quantify the production for each state. The combination of both methods are utilized to quan- tify the expected value of the amount of manufactured products for the given time period.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)