An Application of Graph theory in Markov chains reliability analysis
Identifikátory výsledku
Kód výsledku v 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>
Výsledek na webu
<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>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
An Application of Graph theory in Markov chains reliability analysis
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
An Application of Graph theory in Markov chains reliability analysis
Popis výsledku anglicky
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.
Klasifikace
Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BB - Aplikovaná statistika, operační výzkum
OECD FORD obor
—
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2014
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Advances in Electrical and Electronic Engineering
ISSN
1336-1376
e-ISSN
—
Svazek periodika
12
Číslo periodika v rámci svazku
2
Stát vydavatele periodika
CZ - Česká republika
Počet stran výsledku
6
Strana od-do
154-159
Kód UT WoS článku
—
EID výsledku v databázi Scopus
—