Advanced Search
MyIDEAS: Login to save this article or follow this journal

An algorithm for the estimation of minimal cut and path sets from field failure data

Contents:

Author Info

  • Dharmadhikari, Avinash
  • Kulathinal, S. B.
  • Mandrekar, Vidyadhar
Registered author(s):

    Abstract

    The problem of analyzing the field failure data generated through non-repairable systems is age old and faced by all industries. Current practice, in most of the industries, is to disassemble the failed system, and observe the failed components. Based on such a list generally percentages are computed to summarize the data and technical actions are taken on a component which has higher percentage of failures, without paying any attention to the technical configuration of the system. Such an approach may be misleading. It is known that a system as a coherent structure of the components, fails as soon as all the components in a specific cut set fail. In this paper, we propose an algorithmic approach to identify minimal cut sets of the system which in turn identifies the critical cut set where technical action is necessary. We establish the consistency of the estimators of minimal cut sets and path sets. Lastly, the algorithm is illustrated by a suitable example.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6V1D-45W36XR-2/2/14667a2d89a5f0f3f5d2a699a731c555
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Statistics & Probability Letters.

    Volume (Year): 58 (2002)
    Issue (Month): 1 (May)
    Pages: 1-11

    as in new window
    Handle: RePEc:eee:stapro:v:58:y:2002:i:1:p:1-11

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
    Web: https://shop.elsevier.com/order?id=505573&ref=505573_01_ooc_1&version=01

    Related research

    Keywords: Coherent systems Consistency of the estimators Cut sets Fatal sets Symbolic computing;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:58:y:2002:i:1:p:1-11. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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