Graphical Analysis for k-out-of-n: G Repairable System and Its Application

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 1994-09-25

著者

• Kanagawa A

  Okayama Prefectural Univ. Soja‐shi Jpn

• Arizono Ikuo

  Department of Engineering, University of Osaka Prefecture

• Kanagawa Akihiro

  Faculty of Computer Science & System Engineering, Okayama Prefectural University

• Arizono Ikuo

  Department Of Engineering University Of Osaka Prefecture

関連論文

• Graphical Analysis for k-out-of-n: G Repairable System and Its Application

スポンサーリンク