IDEAS home Printed from https://ideas.repec.org/a/wly/apsmda/v9y1993i3p251-265.html
   My bibliography  Save this article

Sojourn times with finite time‐horizon in finite semi‐markov processes

Author

Listed:
  • Attila Csenki

Abstract

Let Y = {Yt:t ≥ 0} be a semi‐Markov process with finite state space S. Assume that Y is either irreducible and S is then partitioned into two classes A and B, or, that Y is absorbing and S is partitioned into A, B and C, where C is the set of all absorbing states of Y. Denote by TA, m(t) the mth sojourn time of Y in A during [0, t]. TA, m(t) is thus defined as the duration in [0, t] of the mth visit of Y to A if A is visited by Y during [0, t] at least m times; TA, m(t) = 0 otherwise. We derive a recurrence relation for the vectors of double Laplace transforms gm**(T1,T2) = {gm**(T1, T2;S):sSC}, m = 1,2,… which are defined by \documentclass{article}\pagestyle{empty}\begin{document}$$ g_m ^{**} (\tau _1,\tau _2;s) = \;\int_0^\infty {\int_0^\infty {\exp (- \tau _1 t_1}} - \;\tau _2 t_2)p(T_{A, m} (t_1)\;\tau _2 \;|\;Y_0 \; = \;s)\;{\rm d}t_1 \;{\rm d}t_2 $$\end{document} with T1, T2, Re(T1), Re(T2) > 0. This result is then applied to alternating renewal processes. Symbolic Laplace transform inversion with MAPLE is used to obtain the first two moments of TA, m(t). The assumed holding time distributions are exponential and Erlang respectively. This paper is a continuation of some of the author's recent work on the distribution theory of sojourn times in a subset of the finite state space of a (semi‐)Markov process where the time horizon t = + ∞. The practical importance of considering a finite time horizon for semi‐Markov reliability models has been discussed recently by Jack (1991), Jack and Dagpunar (1992), and Christer and Jack (1991).

Suggested Citation

  • Attila Csenki, 1993. "Sojourn times with finite time‐horizon in finite semi‐markov processes," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 9(3), pages 251-265, September.
  • Handle: RePEc:wly:apsmda:v:9:y:1993:i:3:p:251-265
    DOI: 10.1002/asm.3150090306
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asm.3150090306
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asm.3150090306?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:apsmda:v:9:y:1993:i:3:p:251-265. 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)1099-0747 .

    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.