IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v43y2014i10-12p2406-2418.html
   My bibliography  Save this article

Birnbaum Reliability Importance for (n,f,k) and ⟨n,k,f⟩ System

Author

Listed:
  • K. K. Kamalja

Abstract

The ( n, f, k): F/⟨ n, k, f ⟩: F system is the combination of most popular consecutive-k-out-of-n and f-out-of-n system and its failure is caused by two different failure criteria. The ( n, f, k): F (⟨ n, k, f ⟩: F) system consists of n components ordered in a line or circle, while the system fails if and only if there exist at least f failed components or (and) at least k consecutive failed components. In this paper, we consider the sequence {Xu, u ⩾ 1} of {0, 1}-valued Markov Bernoulli trials (MBT) and study the Birnbaum reliability importance for components of ( n, f, k): F(G), and ⟨ n, k, f ⟩: F(G) system through the conditional joint distribution of X_n0Xu=l$\underline{\bm X} _n^0 \left| {X_u = l} \right. $ X_n1Xu=ll=0,1$\left({\underline{\bm X} _n^1 \left| {X_u = l} \right.} \right)l = 0,1 $ , where X_ni=Xn,1i,Xn,kii$\underline{\bm X} _n^i = \left({X_{n,1}^i,X_{n,k_i }^i } \right) $ and Xn,kii$X_{n,k_i }^i $ is the number of non overlapping occurrences of i-runs of length ki(i = 0, 1) in n MBT. The formula for evaluation of exact Birnbaum reliability importance is developed and the results are demonstrated numerically. We also bring out the important inter-relations between the reliability and reliability importance of four systems as f-out-of-n: F, consecutive-k-out-of-n: F, ( n, f, k): F and ⟨ n, k, f ⟩: F systems.

Suggested Citation

  • K. K. Kamalja, 2014. "Birnbaum Reliability Importance for (n,f,k) and ⟨n,k,f⟩ System," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 43(10-12), pages 2406-2418, May.
  • Handle: RePEc:taf:lstaxx:v:43:y:2014:i:10-12:p:2406-2418
    DOI: 10.1080/03610926.2012.749285
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2012.749285
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2012.749285?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:43:y:2014:i:10-12:p:2406-2418. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.