Graphical Analysis for k-out-of-n: G Repairable System and Its Application
Summary :
Kumar and Billinton have presented a new technique for obtaining the steady-state probabilities from a flow graph based on Markov model. By examining the graph and choosing suitable input and output nodes, the steady-state probabilities can be obtained directly by using the flow graph. In this paper this graphical technique is applied for a k-out-of-n: G repairable system. Consequently a new derivation way of the formulae for the steady-state availability and MTBF is obtained.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.9 pp.1560-1563
- Publication Date
- 1994/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Algorithms, Data Structures and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ikuo ARIZONO, Akihiro KANAGAWA, "Graphical Analysis for k-out-of-n: G Repairable System and Its Application" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 9, pp. 1560-1563, September 1994, doi: .
Abstract: Kumar and Billinton have presented a new technique for obtaining the steady-state probabilities from a flow graph based on Markov model. By examining the graph and choosing suitable input and output nodes, the steady-state probabilities can be obtained directly by using the flow graph. In this paper this graphical technique is applied for a k-out-of-n: G repairable system. Consequently a new derivation way of the formulae for the steady-state availability and MTBF is obtained.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_9_1560/_p
Copy
@ARTICLE{e77-a_9_1560,
author={Ikuo ARIZONO, Akihiro KANAGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Graphical Analysis for k-out-of-n: G Repairable System and Its Application},
year={1994},
volume={E77-A},
number={9},
pages={1560-1563},
abstract={Kumar and Billinton have presented a new technique for obtaining the steady-state probabilities from a flow graph based on Markov model. By examining the graph and choosing suitable input and output nodes, the steady-state probabilities can be obtained directly by using the flow graph. In this paper this graphical technique is applied for a k-out-of-n: G repairable system. Consequently a new derivation way of the formulae for the steady-state availability and MTBF is obtained.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Graphical Analysis for k-out-of-n: G Repairable System and Its Application
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1560
EP - 1563
AU - Ikuo ARIZONO
AU - Akihiro KANAGAWA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1994
AB - Kumar and Billinton have presented a new technique for obtaining the steady-state probabilities from a flow graph based on Markov model. By examining the graph and choosing suitable input and output nodes, the steady-state probabilities can be obtained directly by using the flow graph. In this paper this graphical technique is applied for a k-out-of-n: G repairable system. Consequently a new derivation way of the formulae for the steady-state availability and MTBF is obtained.
ER -
English
