New method for the failure probability of strict circular consecutive-k-out-of-n:F system

A recursive formula is given for calculating the failure probability for circular consecutive– k-out–of– n :F systems such that isolated strings of failures of length less than (which do not cause system failure) do not occur, or are immediately corrected; ie, when system failure occurs it is becaus...

Full description

Bibliographic Details
Main Authors: Higashiyama, Y., Rumchev, Ventsi
Format: Journal Article
Published: International Institute of Informatics and Cybernetics 2010
Online Access:http://www.iiisci.org/Journal/CV$/sci/pdfs/KS123OF.pdf
http://hdl.handle.net/20.500.11937/11196
_version_ 1848747740724461568
author Higashiyama, Y.
Rumchev, Ventsi
author_facet Higashiyama, Y.
Rumchev, Ventsi
author_sort Higashiyama, Y.
building Curtin Institutional Repository
collection Online Access
description A recursive formula is given for calculating the failure probability for circular consecutive– k-out–of– n :F systems such that isolated strings of failures of length less than (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. New method gives the failure probability function of circular strict system with time complexity O(nk 2).
first_indexed 2025-11-14T06:53:57Z
format Journal Article
id curtin-20.500.11937-11196
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T06:53:57Z
publishDate 2010
publisher International Institute of Informatics and Cybernetics
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-111962017-01-30T11:23:24Z New method for the failure probability of strict circular consecutive-k-out-of-n:F system Higashiyama, Y. Rumchev, Ventsi A recursive formula is given for calculating the failure probability for circular consecutive– k-out–of– n :F systems such that isolated strings of failures of length less than (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. New method gives the failure probability function of circular strict system with time complexity O(nk 2). 2010 Journal Article http://hdl.handle.net/20.500.11937/11196 http://www.iiisci.org/Journal/CV$/sci/pdfs/KS123OF.pdf International Institute of Informatics and Cybernetics restricted
spellingShingle Higashiyama, Y.
Rumchev, Ventsi
New method for the failure probability of strict circular consecutive-k-out-of-n:F system
title New method for the failure probability of strict circular consecutive-k-out-of-n:F system
title_full New method for the failure probability of strict circular consecutive-k-out-of-n:F system
title_fullStr New method for the failure probability of strict circular consecutive-k-out-of-n:F system
title_full_unstemmed New method for the failure probability of strict circular consecutive-k-out-of-n:F system
title_short New method for the failure probability of strict circular consecutive-k-out-of-n:F system
title_sort new method for the failure probability of strict circular consecutive-k-out-of-n:f system
url http://www.iiisci.org/Journal/CV$/sci/pdfs/KS123OF.pdf
http://hdl.handle.net/20.500.11937/11196