Time complexity of recursive methods for computing the reliability of strict consecutive-k-out-of-n:F systems

スポンサーリンク

概要

• 論文の詳細を見る

• A method is given for calculating the failure probability function for circular consecutive-k-out-of-n:F systems which operate in such a way that isolated strings of failures of length less than k (which do not cause system failure) do not occur, or are immediately corrected! ie, when system failure occurs it is because all failures present are in strings of length at least k. This paper estimate the time complexity of Papastavidis's recursive formula for computing the linear system failure probability and gives a recursive method to compute the circular consecutive-k-out-of-n:F systems

• 愛媛大学の論文

著者

• Higashiyama Y

  Department Of Electrical And Electronic Engineering Faculty Of Engineering Ehime University

• Ohkura Tatsunari

  Department of Electrical and Electronic Engineering, Faculty of Engineering, Ehime University

• Rumchev Ventsi

  Department of Mathematics and Statistics, Faculty of Science, Curtin University of Technology

• Rumchev Ventsi

  Department Of Mathematics And Statistics Faculty Of Science Curtin University Of Technology

• Ohkura Tatsunari

  Department Of Electrical And Electronic Engineering Faculty Of Engineering Ehime University

• Higashiyama Y.

  Department of Electrical and Electronic Engineering, Faculty of Engineering, Ehime University

関連論文

• Time complexity of recursive methods for computing the reliability of strict consecutive-k-out-of-n:F systems

スポンサーリンク