IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v82y2011i1p68-78.html
   My bibliography  Save this article

Computational algebraic algorithms for the reliability of generalized k-out-of-n and related systems

Author

Listed:
  • Sáenz-de-Cabezón, Eduardo
  • Wynn, Henry P.

Abstract

Identities and bounds for the reliability of coherent systems are analysed and computed using the techniques of commutative algebra. The techniques are applied to the analysis of some of the most relevant k-out-of-n class systems. The efficiency of the algebraic approach in obtaining exact identities, bounds and asymptotic formulas shows good performance when compared with results from the literature. The papers points to some new applications of these techniques that emphasize the connection of algebra and probability in this context.

Suggested Citation

  • Sáenz-de-Cabezón, Eduardo & Wynn, Henry P., 2011. "Computational algebraic algorithms for the reliability of generalized k-out-of-n and related systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 82(1), pages 68-78.
    • Handle: RePEc:eee:matcom:v:82:y:2011:i:1:p:68-78
    DOI: 10.1016/j.matcom.2010.07.028
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847541000265X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2010.07.028?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.

    References listed on IDEAS

    as
    1. Lou, W. Y. Wendy, 2003. "The exact distribution of the k-tuple statistic for sequence homology," Statistics & Probability Letters, Elsevier, vol. 61(1), pages 51-59, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohammadi, Fatemeh & Saenz-de-Cabezon, Eduardo & Wynn, Henry P., 2018. "Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems," LSE Research Online Documents on Economics 86460, London School of Economics and Political Science, LSE Library.
    2. Mohammadi, Fatemeh & Saenz-de-Cabezon, Eduardo & Wynn, Henry P., 2016. "Types of signature analysis in reliability based on Hilbert series," LSE Research Online Documents on Economics 67529, London School of Economics and Political Science, LSE Library.
    3. Bigatti, A.M. & Pascual-Ortigosa, P. & Sáenz-de-Cabezón, E., 2021. "A C++ class for multi-state algebraic reliability computations," Reliability Engineering and System Safety, Elsevier, vol. 213(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frosso Makri & Zaharias Psillakis, 2011. "On runs of length exceeding a threshold: normal approximation," Statistical Papers, Springer, vol. 52(3), pages 531-551, August.
    2. Serkan Eryilmaz, 2018. "Stochastic Ordering Among Success Runs Statistics in a Sequence of Exchangeable Binary Trials," Methodology and Computing in Applied Probability, Springer, vol. 20(2), pages 563-573, June.
    3. Anastasios N. Arapis & Frosso S. Makri & Zaharias M. Psillakis, 2017. "Joint distribution of k-tuple statistics in zero-one sequences of Markov-dependent trials," Journal of Statistical Distributions and Applications, Springer, vol. 4(1), pages 1-13, December.
    4. Donald E. K. Martin, 2005. "Distribution of the Number of Successes in Success Runs of Length at Least k in Higher-Order Markovian Sequences," Methodology and Computing in Applied Probability, Springer, vol. 7(4), pages 543-554, December.
    5. Arapis, Anastasios N. & Makri, Frosso S. & Psillakis, Zaharias M., 2016. "On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence," Statistics & Probability Letters, Elsevier, vol. 116(C), pages 45-54.
    6. Sotirios Bersimis & Athanasios Sachlas & Pantelis G. Bagos, 2017. "Discriminating membrane proteins using the joint distribution of length sums of success and failure runs," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 26(2), pages 251-272, June.
    7. M. Koutras & S. Bersimis & D. Antzoulakos, 2008. "Bivariate Markov chain embeddable variables of polynomial type," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 60(1), pages 173-191, March.
    8. Makri, Frosso S. & Psillakis, Zaharias M. & Arapis, Anastasios N., 2015. "Length of the minimum sequence containing repeats of success runs," Statistics & Probability Letters, Elsevier, vol. 96(C), pages 28-37.
    9. Donald E. K. Martin & Laurent Noé, 2017. "Faster exact distributions of pattern statistics through sequential elimination of states," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 69(1), pages 231-248, February.

    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:eee:matcom:v:82:y:2011:i:1:p:68-78. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.