IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v43y1996i2p305-312.html
   My bibliography  Save this article

A compound measure of dependability for systems modeled by continuous‐time absorbing Markov processes

Author

Listed:
  • Attila Csenki

Abstract

The Markov analysis of reliability models frequently involves a partitioning of the state space into two or more subsets, each corresponding to a given degree of functionality of the system. A common partitioning is G ∪ B ∪ {o}, where G (good) and B (bad) stand, respectively, for fully and partially functional sets of system states; o denotes system failure. Visits to B may correspond to, for instance, reparable system downtimes, whereas o will stand for irrecoverable system failure. Let TG and NB stand, respectively, for the total time spent in G, and the number of visits to B, until system failure. Both TG and NB are familiar system performance measures with well‐known cumulative distribution functions. In this article a closed‐form expression is established for the probability Pr[TG t, NB ≤ n], a dependability measure with much intuitive appeal but which hitherto seems not to have been considered in the literature. It is based on a recent result on the joint distribution of sojourn times in subsets of the state space by a Markov process. The formula is explored numerically by the example of a power transmission reliability model. © 1996 John Wiley & Sons, Inc.

Suggested Citation

  • Attila Csenki, 1996. "A compound measure of dependability for systems modeled by continuous‐time absorbing Markov processes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 305-312, March.
  • Handle: RePEc:wly:navres:v:43:y:1996:i:2:p:305-312
    DOI: 10.1002/(SICI)1520-6750(199603)43:23.0.CO;2-E
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199603)43:23.0.CO;2-E
    Download Restriction: no

    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199603)43:23.0.CO;2-E?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
    ---><---

    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:wly:navres:v:43:y:1996:i:2:p:305-312. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.