Skip to main content
SpringerLink
Log in

Semi-markov processes and their applications

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature cited

  1. V. V. Anisimov, “Multidimensional limit theorems for semi-Markov processes with a countable set of states,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 3, 3–15 (1970).

    Google Scholar 

  2. V. V. Anisimov, “Limit theorems for semi-Markov processes. I, II,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 2, 3–21 (1970).

    Google Scholar 

  3. V. V. Anisimov, “Limit theorems for semi-Markov processes with a countable set of states,” Dokl. Akad. Nauk SSSR,193, No. 3, 503–505 (1970).

    Google Scholar 

  4. V. V. Anisimov, “Limiting distributions of functionals of a semi-Markov process defined on a fixed set of states up to the first exit time,” Dokl. Akad. Nauk SSSR,193, No. 4, 743–745 (1970).

    Google Scholar 

  5. V. V. Anisimov, “Limit theorems for sums of random variables defined on a subset of the states of a Markov chain up to the first exit time in the series scheme,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 4, 18–26 (1971).

    Google Scholar 

  6. V. V. Anisimov, “Limit theorems for sums of random variables on a Markov chain related to exit from a set formed in the limit,” Teor. Veriyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 4, 3–17 (1971).

    Google Scholar 

  7. V. V. Anisimov, “Deyaki teoremi pro granichi razpodili sum vipadkovikh velichin, zv'yazanikh v odnoridnii lantsyug Markova,” Dopovidi Akad. Nauk URSR,A, No. 2, 99–103 (1970).

    Google Scholar 

  8. V. V. Anisimov, “Multidimensional limit theorems for Markov chains with a finite number of states,” Dokl. Akad. Nauk SSSR,204, No. 3, 519–521 (1972).

    Google Scholar 

  9. V. V. Anisimov, “Some limit theorems for semi-Markov process with a countable set of states in the series scheme,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 6, 3–13 (1972).

    Google Scholar 

  10. V. V. Anisimov, “On the limiting behavior of a semi-Markov process with a decomposable set of states,” Dokl. Akad. Nauk SSSR,206, No. 4, 777–779 (1972).

    Google Scholar 

  11. G. L. Arsenishvili, “Deyaki pitaniya teorii skladnikh napivmarkovs'kikh protsesiv,” Abstr. of Proc. of the 5th Sci. Tech. Conf. of Young Mathematicians of the Ukraine [in Russian], Kiev (1970).

  12. G. L. Arsenishvili, “Certain questions from the theory of semi-Markov processes of r-th order,” in: Questions in the Development and Introduction of Facilities for Computer Techniques [in Russian], Tbilisi (1970), pp. 128–132.

  13. G. L. Arsenishvili, “Some questions in the theory of semi-Markov processes of the r-th order,” Proc. of the 3rd Conf. of Young Scientists and Aspirants [in Russian], TNIISA (1970).

  14. G. L. Arsenishvili, “On a certain class of functionals for complex semi-Markov processes with discrete mixing of occurrence,” Sakartveloc SSR Metsnierebata Akademiis Moambe, Soobshch. Akad. Nauk GrusSSR,58, No. 1, 25–28 (1970).

    Google Scholar 

  15. G. L. Arsenishvili and I. I. Ezhov, “On a limit theorem for semi-Markov processes of r-th order,” Sakartvelos SSR Metsnierebata Akademiis Moambe, Soobshch. Akad. Nauk GruzSSR,53, No. 1, 25–28 (1969).

    Google Scholar 

  16. G. L. Arsenishvili and I. I. Ezhov, “On a generalization of Markov chains with semi-Markov mixing of occurrence,” Sakartvelos SSR Metsnierebata Akademiis Moambe, Soobshch. Akad. Nauk GruzSSR,54, No. 2, 285–288 (1969).

    Google Scholar 

  17. G. L. Arsenishvili and I. I. Ezhov, “On the distribution of the sojourn time in a region given by a semi-Markov process of r-th order,” Tbilisis Universiteti Gamokkhenibiti Matematikis Instituti. Shromebi, Tr. Inst. Prikl. Mat., Tbilic. In-ta., No. 2, 151–157 (1969).

    Google Scholar 

  18. V. V. Baklan, “An ergodic theorem for Markov processes with discrete mixing of occurrence,” Ukr. Mat. Zh.,19, No. 5, 123–126 (1967).

    Google Scholar 

  19. Yu. K. Belyaev, “Ruled Markov processes and their application to problems of reliability theory,” Proc. of the 6th All-Union Conf. on Theory of Probability and Mathematical Statistics, Vilnius, 1960 [in Russian], Gos. Izd. Polit. i Nauch. Lit. LitSSR (1962), pp. 309–323.

  20. S. M. Brodi, “On a limit theorem in the theory of bulk servicing,” Ukr. Mat. Zh.,15, No. 1, 76–79 (1963).

    Google Scholar 

  21. S. M. Brodi, “Investigation of systems of bulk servicing by means of semi-Markov processes,” Kibernetika, No. 6, 55–58 (1965).

    Google Scholar 

  22. S. M. Brodi and O. N. Vlasenko, “Reliability of systems with several working regimes,” in: Theory of Reliability and Bulk Servicing [in Russian], Nauka, Moscow (1969), pp. 165–171.

    Google Scholar 

  23. S. M. Brodi, O. N. Vlasenko, and V. G. Marchenko, Estimation and Planning of Reliability Tests of Systems, Nauk. Dumka, Kiev (1970).

    Google Scholar 

  24. S. M. Brodi and V. D. Shpak, “Application of associated semi-Markov processes in the analysis of system reliability. I,” Kibernetika, No. 5, 90–96 (1970).

    Google Scholar 

  25. V. Ya. Valakh and V. S. Korolyuk, “Stochastic automata with random reaction time and their functioning in random media,” in: Automata, Hybridized and Control Machines [in Russian], Nauka, (1972) Moscow (1972) 38–45.

    Google Scholar 

  26. O. P. Vinogradov, “The problem of the distribution of maximum line length and its application,” Teor. Veroyatn. i Primen.,13, No. 2, 366–375 (1968).

    Google Scholar 

  27. O. P. Vinogradov, “Limiting distributions for the moment of first demand loss in a bulk servicing queue with a restricted number of waiting sites,” Matem. Zemetki,3, No. 5, 541–546 (1968).

    Google Scholar 

  28. O. P. Vinogradov, “The distribution of maximum line length in a bulk servicing queue,” Aikakan SSR Gitutyunneri Akademiai Tegekagir. Matematika, Izv. Akad. Nauk ArmSSR,3, No. 3, 257–262 (1969).

    Google Scholar 

  29. O. V. Viskov, “On a bulk servicing system with Markovian dependence between arrival of demands,” Trans. 4th Prague Conf. Inform. Theory, Statist. Decis. Funct. Random Process., 1965, Prague (1967), pp. 627–634.

  30. O. V. Viskov, “Two asymptotic formulas in the theory of bulk servicing,” Teor. Veroyatn. i Primen.,9, No. 1, 177–178 (1964).

    Google Scholar 

  31. O. V. Viskov, “On the waiting time in a mixed system of bulk servicing,” Tr. Matem. Inst. Akad. Nauk SSSR,71, 26–34 (1964).

    Google Scholar 

  32. O. V. Viskov and A. I. Ismailov, “A system of bulk servicing with restricted line length,” Nauch. Tr. Tashkent. Univ., No. 402, 17–29 (1972).

    Google Scholar 

  33. T. Gergei, I. I. Ezhov, and I. N. Tskukanov, “Markov chains governing complex renewal process,” in: Theory of Optimal Solutions, Proc. of the Seminar [in Russian], No. 1, Kiev (1969), pp. 93–109.

    Google Scholar 

  34. T. Gergei, I. I. Ezhov, and I. N. Tskukanov, “Pro stataionarnii rozpodil staniv odniei sistemi masovogo obslugovuvaniya,” Dopovidi Akad. Nauk URSR,A, No. 10, 876–878, 955 (1971).

    Google Scholar 

  35. I. B. Gertsbakh, “Formulation of certain optimal problems in reliability theory,” LatvRSR Zinātnu Akad. Vestis, Izv. Akad. Nauk LatvSSR, No. 8, 25–31 (1963).

    Google Scholar 

  36. I. B. Gertsbakh, Models of Prophylaxis (Theoretical Foundations of Planning Prophylactic Work) [in Russian], Sov. Radio, Moscow (1969).

    Google Scholar 

  37. I. B. Gertsbakh, “Optimal control of a semi-Markov process with restrictions on the probability of states,” Kibernetika, No. 5, 56–61 (1970).

  38. B. V. Gnedenko, “On unloaded duplication,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 3–12 (1964).

    Google Scholar 

  39. B. V. Gnedenko and I. N. Kovalenko, Introduction to the Theory of Bulk Servicing, Nauka, Moscow (1966).

    Google Scholar 

  40. L. G. Gubenko and É. S. Shtatland, “On controllable semi-Markov processes,” Kibernetika, No. 2, 26–29 (1972).

    Google Scholar 

  41. D. V. Gusak and V. S. Korolyuk, “The asymptotic behavior of semi-Markov processes with a decomposable set of states,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 5, 43–50 (1971).

    Google Scholar 

  42. V. E. Dikarev, “Investigation of reliability of renewal systems by the method of Markov processes with discrete mixing of occurrence,” in: Complex Systems and Modeling, Proc. of the Seminar [in Russian], No. 2, Kiev (1969), pp. 22–32.

    Google Scholar 

  43. V. E. Dikarev, “Servicing a set of complex systems,” in: Teor. Kibernetika, No. 3, Kiev (1970), pp. 80–97.

    Google Scholar 

  44. V. E. Dikarev, “Strategies for prophylactic servicing of a system with incomplete checking of its working capability,” in: Mathematical Methods of Investigating and Optimizing Systems [in Russian], No. 4, Kiev (1970), pp. 25–36.

    Google Scholar 

  45. V. A. Dobryden', “Optimal observation of a semi-Markov process,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 47–49 (1971).

    Google Scholar 

  46. I. I. Ezhov, “On the time of reaching a given region in the case of a Markov chain with discrete incidence of occurrence,” Dopovidi Akad. Nauk URSR, No. 7, 851–854 (1966).

    Google Scholar 

  47. I. I. Ezhov, “Markov chains with discrete incidence of occurrence forming a semi-Markov process,” Ukr. Mat. Zh.,18, No. 1, 48–65 (1966).

    Google Scholar 

  48. I. I. Ezhov, “An ergodic theorem for Markov processes describing general systems of bulk servicing,” Kibernetika, No. 5, 79–81 (1966).

    Google Scholar 

  49. I. I. Ezhov, “Ergodic theorems for Markov processes with discrete incidence of occurrence,” Dopovidi Akad. Nauk URSR, No. 5, 579–582 (1966).

    Google Scholar 

  50. I. I. Ezhov, “On a generalization of renewal processes,” Visnik Kiev Univ., Ser. Mat. Mekh., No. 10, 55–59 (1968).

    Google Scholar 

  51. I. I. Ezhov, “On the distribution of the minimum of a semi-Markov process describing a queue with waiting time,” in: Reliability and Effectiveness of Discrete Systems [in Russian], Zinatne, Riga (1968), pp. 27–45.

    Google Scholar 

  52. I. I. Ezhov, “An ergodic theorem for stochastic processes with semi-Markov incidence occurrence,” Ukr. Mat. Zh.,20, No. 3, 384–388 (1968).

    Google Scholar 

  53. I. I. Ezhov, “On the distribution of the quantity of skipping a given level by the sequence of maxima of random variables governed by a Markov chain,” Ukr. Mat. Zh.,21, No. 6, 831–836 (1969).

    Google Scholar 

  54. I. I. Ezhov, T. Gergei, and I. N. Tsukanov, “The sojourn times of Markov chains governing a complex renewal process in a given region,” in: Theory of Optimal Solutions, Proc. of the Seminar [in Russian], No. 2, Kiev (1969), pp. 99–108.

    Google Scholar 

  55. I. I. Ezhov and V. S. Korolyuk, “Semi-Markov processes and their Applications,” Kibernetika, No. 5, 58–65 (1967).

    Google Scholar 

  56. I. I. Ezhov and G. I. Prizva, “On a generalization of Markov chains with continuous time,” Visnik Kiev Univ., Ser. Mat. Mekh., No. 5, 145–152 (1966).

    Google Scholar 

  57. I. I. Ezhov and G. I. Prizva, “Some limit theorems for functions of sums of random variables governing a Markov chain,” Kibernetika, No. 3, 63–67 (1969).

    Google Scholar 

  58. I. I. Ezhov and A. V. Skorokhod, “Markov processes homogeneous in the second component. I,” Teor. Veroyatn. i Primen.,14, No. 1, 3–14 (1969).

    Google Scholar 

  59. I. I. Ezhov and A. V. Skorokhod, “Markov processes homogeneous in the second component. II,” Teor. Veroyatn. i Primen.,14, No. 4, 679–692 (1969).

    Google Scholar 

  60. O. K. Zakusilo, “Sparse semi-Markov processes,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 6, 54–59 (1972).

    Google Scholar 

  61. A. F. Zubova, “On cold reserve with renewal,” Avtomatika i Telemekhanika,26, No. 10, 1800–1808 (1965).

    Google Scholar 

  62. L. M. Kovaleva, “On the sojourn time of two independent semi-Markov processes in a given state,” Ukr. Mat. Zh.,20, No. 6, 837–841 (1968).

    Google Scholar 

  63. L. M. Kovaleva, “On the sojourn time in a given state of the simplest semi-Markov system,” Teoriya Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 1, 100–108 (1970).

    Google Scholar 

  64. V. S. Korolyuk, “Sojourn times of a semi-Markov process in a fixed set of states,” Ukr. Mat. Zh.,17, No. 3, 123–128 (1965).

    Google Scholar 

  65. V. S. Korolyuk, “On the asymptotic behavior of the sojourn time of a semi-Markov process in a subset of states,” Ukr. Mat. Zh.,21, No. 6, 842–845 (1969).

    Google Scholar 

  66. V. S. Korolyuk, L. I. Polishchuk, and A. A. Tomusyak, “On a limit theorem for semi-Markov processes,” Kibernetika, No. 4, 144–145 (1969).

    Google Scholar 

  67. V. S. Korolyuk and A. A. Tomusyak, “Description of the functioning of reserve systems by means of semi-Markov processes,” Kibernetika, No. 5, 55–59 (1965).

    Google Scholar 

  68. V. S. Korolyuk and A. A. Tomusyak, “On certain stationary characteristics of semi-Markov processes,” Kibernetika, No. 5, 65–68 (1971).

    Google Scholar 

  69. V. S. Korolyuk and A. F. Turbin, “On the asymptotic behavior of the sojourn time of a semi-Markov process in a reducible subset of states,” Teor. Veroyatn. i Mat. Stat., Mezhved. Nauch. Sb., No. 2, 133–143 (1970).

    Google Scholar 

  70. V. S. Korolyuk and A. F. Turbin, “On a method of proving limit theorems for certain functionals of semi-Markov processes,” Ukr. Mat. Zh.,24, No. 2, 234–240 (1972).

    Google Scholar 

  71. B. P. Kredentser, “On the optimal loading of a two-priority system of servicing with waiting time,” Avtomatika i Telemekhanika, No. 9, 145–150 (1970).

    Google Scholar 

  72. B. P. Kredentser, “Estimates of the reliability of systems with unit and time surpluses and instantaneous detection of failures,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 58–69 (1971).

    Google Scholar 

  73. T. K. Kukjta, “Determination of the probability of loss by means of semi-Markov processes,” in: Complex Systems and Modeling, Proc. of the Seminar [in Russian], No. 1, Kiev (1968), pp. 67–73.

    Google Scholar 

  74. G. Sh. Lev, “On the convergence of semi-Markov multiplication processes with drift to a diffusion process,” Teor. Veroyatn. i Primen.,17, No. 3, 583–588 (1972).

    Google Scholar 

  75. G. Sh. Lev, “Semi-Markov multiplication processes with drift,” Teor. Veroyatn. i Primen.,17, No. 1, 160–166 (1972).

    Google Scholar 

  76. Ya. A. Matviishin and L. N. Suchkov, “On a problem of optimal control of a semi-Markov object,” in: Complex Systems and Modeling, Proc. of the Seminar [in Russian], No. 2, Kiev (1969), pp. 42–49.

    Google Scholar 

  77. V. G. Morozov, “On topological methods of studying finite semi-Markov automata,” in: Automata, Hybridized and Control Machines, [in Russian], Nauka, Moscow (1972), pp. 50–59.

    Google Scholar 

  78. P. I. Popov and A. P. Cherenkov, “An asymptotic method of estimating the reliability of Markov systems,” in: Theory of Reliability and Bulk Servicing [in Russian], Nauka, Moscow (1969), pp. 178–183. 183.

    Google Scholar 

  79. E. L. Presman, “The sojourn time of a certain system in an improper state,” Tr. Matem. Inst., Akad. Nauk SSSR,71, 78–81 (1964).

    Google Scholar 

  80. G. I. Prizva, “On the distribution of some functionals of sums of random variables controlled by a Markov chain,” Reports of the All-Union Inter-Institutional Symposium on Applied Mathematics and Cibernetics, Gor'kii (1967).

  81. G. I. Prizva, “On a limit theorem for a semi-Markov process,” Dopovidi Akad. Nauk URSR,A, No. 9, 820–824 (1967).

    Google Scholar 

  82. G. I. Prizva, “On a generalization of renewal functions,” Proc. of the IV Republic Conference of Young Ukrainian Mathematicians, Kiev (1968).

  83. G. I. Prizva, “An ergodic theorem for a class of Markov processes,” Dopovidi Akad. Nauk URSR,A, No. 8, 720–723 (1968).

    Google Scholar 

  84. G. I. Prizva and S. N. Simonova, “On the distribution of the first jump,” Ukr. Mat. Zh.,19, No. 3, 117–121 (1967).

    Google Scholar 

  85. V. V. Rykov and M. A. Yastrebenetskii, “Regenerative processes with several types of regeneration points,” in: Large Servicing, Reliability [in Russian], Nauka, Moscow (1970), pp. 203–208.

    Google Scholar 

  86. V. V. Rykov and M. A. Yastrebenetskii, “On regenerative processes with several types of regeneration points,” Kibernetika,3, 82–86 (1971).

    Google Scholar 

  87. I. Sapagovas, “On the convergence of sums of Markov renewal processes to a Poisson process,” Lit. Matem. Sb.,6, No. 2, 271–277 (1966).

    Google Scholar 

  88. I. Sapagovas, “On the convergence of sums of Markov renewal processes to a multi-dimensional Poisson process,” Lit. Matem. Sb.,9, No. 4, 817–826 (1969).

    Google Scholar 

  89. D. S. Silvestrov, “The asymptotic behavior of the attainment time for sums of random variables controlled by a regular semi-Markov process,” Dokl. Akad. Nauk SSSR,189, No. 5, 949–951 (1969).

    Google Scholar 

  90. D. S. Silvestrov, “Granichni rozpodili dlya vipadkovogo blukaniya na pryamii zv'yazanogo v lantsyug Markova,” Dopovidi Akad. Nauk URSR,A, No. 4, 326–329 (1970).

    Google Scholar 

  91. D. S. Silvestrov, “Limit theorems for a discrete random walk on a half line controlled by a Markov chain. I,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 1, 193–204 (1970).

    Google Scholar 

  92. D. S. Silvestrov, “Limit theorems for a discrete random walk on a half line controlled by a Markov chain. II,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 2, 158–166 (1970).

    Google Scholar 

  93. D. S. Silvestrov, “Limit theorems for a continuous random walk on a half line controlled by a Markov process with two states in the series scheme. I,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 1, 205–215 (1970).

    Google Scholar 

  94. D. S. Silvestrov, “Limit theorems for a continuous random walk on a half line controlled by a Markov process with two states in the series scheme. II,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 2, 167–171 (1970).

    Google Scholar 

  95. D. S. Silvestrov, “Limit theorems for semi-Markov processes and their applications. I,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 3, 155–172 (1970).

    Google Scholar 

  96. D. S. Silvestrov, “Limit theorems for semi-Markov processes and their applications. II,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 3, 173–194 (1970).

    Google Scholar 

  97. D. S. Silvestrov, “Limit theorems for functionals of processes of partial sums of random variables defined by a semi-Markov process with a finite set of states,” Dokl. Akad. Nauk SSSR,195, No. 5, 1036–1038 (1970).

    Google Scholar 

  98. D. S. Silvestrov, “Limit theorems for semi-Markov processes,” Dopovidi Akad. URSR,A, No. 11, 987–989 (1971).

    Google Scholar 

  99. D. S. Silvestrov, Semi-Markov Processes with a Discrete Set of States, Izd. Kiev. Univ., Kiev (1971).

    Google Scholar 

  100. D. S. Silvestrov, “Limit theorems for semi-Markov schemes of summation. I,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 4, 153–170 (1971).

    Google Scholar 

  101. D. S. Silvestrov, “On the convergence of weakly dependent processes in the uniform topology. I,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 6, 109–117 (1972).

    Google Scholar 

  102. D. S. Silvestrov, “On the convergence of weakly dependent processes in the uniform topology. II,” Teor. Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 7, 132–145 (1972).

    Google Scholar 

  103. S. N. Simonova, “On a multi-line system with losses and an incoming semi-Markov flow of demands,” Kibernetika, No. 6, 48–53 (1967).

    Google Scholar 

  104. A. D. Solov'ev, “Asymptotic distribution of the life time of a duplicated element,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 119–121 (1964).

    Google Scholar 

  105. A. D. Solov'ev, “Reserve with rapid renewal,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 1, 56–71 (1970).

    Google Scholar 

  106. L. N. Suchkov, “Optimization of the reliability characteristics of complex systems by means of controlling semi-Markov processes,” in: Materials of the 4th Republic Scientific Conference of Young Researchers in System Techniques, 1969 [in Russian], Vol. 2, Kiev (1969), pp. 89–92.

    Google Scholar 

  107. L. N. Suchkov, “Optimization of the sojourn time of a semi-Markov process in a fixed set of states,” in: Complex Systems and Modelling, Proc. of the Seminar [in Russian], No. 1, Kiev (1969), pp. 67–73.

    Google Scholar 

  108. L. N. Suchkov, “Optimization of the reliability indices of complex systems whose functioning is representable by semi-Markov processes,” in: Complex Systems and Modelling, Proc. of the Seminar [in Russian], No. 2, Kiev (1969), pp. 33–41.

    Google Scholar 

  109. M. G. Teplitskii, “Finding the optimum servicing discipline for a system of bulk servicing with a controlled working regime of the units,” Avtomatika i Vychisl. Tekhn., No. 6, 61–65 (1968).

    Google Scholar 

  110. A. A. Tomusyak, Pro dostatni umovi i sposib znakhodzhennya ergodichnogo rozpodilu napivmar-kovs'kogo protsesu. Zvitno-naukova konferentsiya kafedr Kiivs'kogo pedinstitutu. Tezi depofidei, Kiev (1966).

    Google Scholar 

  111. A. A. Tomusyak, Chas perebuvannya napivmarkovs'kogo protsesu na zchislenii mnozhini staniv. Zvitno-naukova konferentsiya kafedr Kiivs'kogo pedinstitutu. Tezi dopovidei, Kiev (1967).

    Google Scholar 

  112. A. A. Tomusyak, “Computation of the ergodic distribution of Markov and semi-Markov processes,” Kibernetika, No. 1, 68–71 (1969).

    Google Scholar 

  113. A. A. Tomusyak, “Pro odnu zadacy proektuvannya reservovanik sistem z vidnovlennyam,” Visnik Kiiv. Univ., Ser. Mat. Mekh., No. 12, 96–99 (1970).

    Google Scholar 

  114. A. F. Turbin, “Application of the perturbation theory of linear operators to solution of some problems related to Markov chains and semi-Markov processes,” Teor. Veroyatn. i Mat, Stat. Mezhved. Nauch. Sb., No. 6, 118–128 (1972).

    Google Scholar 

  115. A. F. Turbin, “On the asymptotic behavior of the sojourn time of a semi-Markov process in a reducible subset of states. The linear case,” Teor, Veroyatn. i Mat. Stat. Mezhved. Nauch. Sb., No. 4, 179–194 (1971).

    Google Scholar 

  116. I. A. Ushakov, “On the calculation of the average stationary sojourn time of a semi-Markov process in a subset of states,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 62–65 (1969).

    Google Scholar 

  117. P. Franken, “Refinement of a limit theorem for the superposition of independent renewal processes,” Teor. Veroyatn. i Primen.,8, No. 3, 341–349 (1963).

    Google Scholar 

  118. Z. S. Khalil', “On a problem of reserve with renewal,” Elektron. Informationsverarh und Kybernet.,4, No. 5, 327–340 (1968).

    Google Scholar 

  119. M. A. Yastrebenetskii, “On a class of regenerative random processes,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 50–60 (1969).

    Google Scholar 

  120. M. A. Yastrebenetskii, “On the convergences of sums of Markov renewal processes to a branching Poisson process,” Kibernetika, No. 1, 95–98 (1972).

    Google Scholar 

  121. P. M. Anselone, “Ergodic theory for discrete semi-Markov chains,” Duke Math. J.,27, No. 1, 33–40 (1960).

    Google Scholar 

  122. R. E. Barlow, “Applications of semi-Markov processes to counter problems,” Studies in Appl. Prob. and Manag. Sci., Stanford Univ. Press, Stanford, Calif. (1962), pp. 34–62.

    Google Scholar 

  123. R. E. Barlow and F. Proschan, Mathematical Theory of Reliability, Wiley, New York (1965).

    Google Scholar 

  124. S. M. Berman, “Note on extreme values, competing risks, and semi-Markov processes,” Ann. Math. Stat.,34, No. 3, 1104–1106 (1963).

    Google Scholar 

  125. Bhat U. Narayan, “Imbedded Markov chain analysis of a single server bulk queue,” J. Austral. Math. Soc.,4, No. 2, 244–263 (1964).

    Google Scholar 

  126. V. R. Cane, “Behavior sequences as semi-Markov chains,” J. Roy. Statist. Soc.,B21 (1959).

  127. C. K. Cheong, “Geometric convergence of semi-Markov transition probabilities,” Z. Wahrschenlich-keitstheor. Verw. Geb.,7, No. 2, 122–130 (1967).

    Google Scholar 

  128. C. K. Cheong, “Ergodic and ratio limit theorems forα-recurrent semi-Markov processes,” Z. Wahrscheinlichkeitstheor. Verw. Geb.,9, No. 4, 270–286 (1968).

    Google Scholar 

  129. C. K. Cheong, “Quasi-stationary distributions in semi-Markov processes,” J. Appl. Probab., No. 2, 388–399 (1970).

    Google Scholar 

  130. C. K. Cheong, “Quasi-stationary distributions in semi-Markov processes. Correction,” J. Appl. Probab.,7, No. 3, 788 (1970).

    Google Scholar 

  131. C. K. Cheong and C. R. Heathcote, “On the rate of convergence of waiting times,” J. Austral. Math. Soc.,5, No. 3, 365–373 (1965).

    Google Scholar 

  132. C. K. Cheong, H. A. De Smit Jos, J. Janssen, J. P. Lambotte, I. L. Teugels, and G. Vandewiele, “Definitions, classification and limit theorems,” Notes on Semi-Markov Theory. Part I. Core discussion paper No. 7118 (1971).

  133. C. K. Cheong and I. L. Teugels, “Notes on semi-Markov processes. Part II. Bibliography,” Core discussion paper No. 7121 (1971).

  134. E. Cinlar, “Decomposition of a semi-Markov process under a Markovian rule,” Austral. J. Stat.,8, No. 3, 163–170 (1966).

    Google Scholar 

  135. E. Cinlar, “Decomposition of a semi-Markov process under a state dependent rule,” SIAM J. Appl, Math.,15, No. 2, 252–263 (1967).

    Google Scholar 

  136. E. Cinlar, “Time dependence of queues with semi-Markovian services,” J. Appl. Probab.,4, No. 2, 356–364 (1967).

    Google Scholar 

  137. E. Cinlar, “Queues with semi-Markovian arrivals,” J. Appl. Probab.,4, No. 2, 365–379 (1967).

    Google Scholar 

  138. E. Cinlar, “On the superposition of m-dimensional point processes,” J. Appl. Probab.,5, No. 1, 169–176 (1968).

    Google Scholar 

  139. E. Cinlar, “Some joint distributions for Markov renewal processes,” Austral. J. Stat.,10, No. 1, 8–20 (1968).

    Google Scholar 

  140. E. Cinlar, “On semi-Markov processes on arbitrary spaces,” Proc. Cambridge Phil. Soc.,66, No. 2, 381–392 (1969).

    Google Scholar 

  141. E. Cinlar, “Markov renewal theory,” Adv. Appl. Probab.,1, No. 2, 123–187 (1969).

    Google Scholar 

  142. E. Cinlar, “On dams with continuous semi-Markovian inputs,” J. Math. Anal. Appl.,35, No. 2, 434–448 (1971).

    Google Scholar 

  143. E. V. Denardo, “Markov renewal programs with small interest rates,” Ann. Math. Stat.,42, No. 2, 477–496 (1972).

    Google Scholar 

  144. E. V. Denardo and B. L. Fox, “Multichain Markov renewal programs,” SIAM J. Appl. Math.,16, 468–487 (1968).

    Google Scholar 

  145. C. Derman, “Remark concerning two-state semi-Markov processes,” Ann. Math. Stat.,32, No. 2, 615–616 (1961).

    Google Scholar 

  146. R. L. Disney and W. K. Hall, “Finite queues in parallel under a generalized channel selection rule,” J. Appl. Probab.,8, 413–416 (1971).

    Google Scholar 

  147. R. L. Disney and T. L. Vlah, “The departure process from the GI|G|I queue,” J. Appl. Probab.,6, 704–707 (1969).

    Google Scholar 

  148. A. J. Fabens, “The solution of queueing and inventory models by semi-Markov processes,” J. Roy. Statist. Soc.,B23, No. 1, 113–127 (1961).

    Google Scholar 

  149. A. J. Fabens and S. Karlin, “Generalized renewal functions and stationary inventory models,” J, Math. Anal. Appl.,5, 461–487 (1962).

    Google Scholar 

  150. A. J. Fabens and A. G. A. D. Perera, “A correction to “The solution of queueing and inventory models by semi-Markov processes,” J. Roy. Statist. Soc.,B25, No. 2, 455–456 (1963).

    Google Scholar 

  151. W. Feller, “On semi-Markov processes,” Proc. Nat. Acad. Sci. USA,51, No. 4, 653–659 (1964).

    Google Scholar 

  152. B. L. Fox, “Markov renewal programming by linear fractional programming,” SIAM J. Appl. Math.,14, No. 6, 1418–1432 (1966).

    Google Scholar 

  153. B. L. Fox, “Existence of stationary optimal policies for some Markov renewal programs,” SIAM Rev.,9, No. 3, 573–576 (1967).

    Google Scholar 

  154. B. L. Fox, “(g, w)-optimal in Markov renewal programs,” Manag. Sci.,15, No. 3, 210–212 (1968).

    Google Scholar 

  155. P. Frankem, “Erlangsche Formeln für semimarkowschen Eingang,” Electron. Informationsverarb. Kybern.,4, No. 3, 197–204 (1968).

    Google Scholar 

  156. D. P. Gaver, Jr., “Imbedded Markov chain analysis of a waiting-line process in continuous time,” Ann. Math. Stat., 30, No. 3, 698–720 (1959).

    Google Scholar 

  157. D. P. Gaver, Jr., “An absorption probability problem,” J. Math. Anal. Appl.,9, No. 3, 384–393 (1964).

    Google Scholar 

  158. T. Gergely, I. N. Tsukanow, and I. I. Yezhov, “Markov chains governed by complicated renewal processes,” Adv. Appl. Probab.,2, No. 2, 287–322 (1970).

    Google Scholar 

  159. Y. P. Gupta, “Some results for zero order Markov renewal processes,” J. Indian Statist. Assoc.,10 (1972).

  160. C. M. Harris, “Queues with state-dependent stochastic service rates,” Operat. Res.,15, No. 1, 117–130 (1967).

    Google Scholar 

  161. Hiroshisa Hatori, “A limit theorem on (J, X)-processes,” Kodai Math. Sem. Rep.,18, No. 4, 317–321 (1966).

    Google Scholar 

  162. Hiroshisa Hatori and Toshio Mori, “An improvement of a limit theorem on (J, X)-processes,” Kodai Math. Sem. Rep.,18, No. 4, 347–352 (1966).

    Google Scholar 

  163. Hiroshisa Hatori and Toshio Mori, “A renewal type theorem on continuous time (J, X)-processes,” Kodai Math. Sem. Rep.,19, No. 4, 404–409 (1967).

    Google Scholar 

  164. Hiroshisa Hatori, Toshio Mori, and Hiroshi Oodaira, “A renewal theorem on (J, X)-processes,” Kodai Math. Sem. Rep.,19, No. 2, 159–164 (1967).

    Google Scholar 

  165. Hiroshisa Hatori, Toshio Mori, and Hiroshi Oodaira, “A remark concerning a renewal theorem on (J, X)-processes,” Kodai Math. Sem. Rep.,19, No. 2, 189–192 (1967).

    Google Scholar 

  166. A. G. Hawkes, “Bunching in a semi-Markov process,” J. Appl. Probab.,7, No. 1, 175–182 (1970).

    Google Scholar 

  167. R. A. Howard, “Semi-Markov decision processes,” Bull. Inst. Int. Statist.,40 (1964).

  168. R. A. Howard, “Research in semi-Markovian decision structures,” J. Oper. Res. Soc. Japan,6, No. 4, 163–169 (1964).

    Google Scholar 

  169. R. A. Howard, “System analysis of semi-Markov processes,” IEEE Trans. Milit. Electron.,8, No. 2, 114–124 (1964).

    Google Scholar 

  170. J. J. Hunter, “On the moments of Markov renewal processes,” Adv. Appl. Probab.,1, No. 2, 188–210 (1969).

    Google Scholar 

  171. J. J. Hunter, “On the renewal density matrix of a semi-Markov process,” Sankhy¯a,A31, No. 3, 281–308 (1969).

    Google Scholar 

  172. J. Jacod, “Un théorème de renouvellement pour les chaînes semi-Markoviennes,” C. R. Acad. Sci.,270, No. 4, A255-A258 (1970).

    Google Scholar 

  173. J. Jacod, “Chaînes semi-Markoviennes transientes et récurrentes, chaînes positives,” C. R. Acad. Sci.,270, No. 12, A776-A779 (1970).

    Google Scholar 

  174. J. Jacod, “Théorème de renouvellement et classification pour les chaînes semi-Markoviennes,” Ann. Inst. H. Poincaré,B7, No. 2, 83–129 (1971).

    Google Scholar 

  175. J. Jacod, “Générateurs infinitésimaux des processus à accroissements semi-Markoviens,” Ann. Inst. H. Poincaré,B7, No. 3, 219–233 (1971).

    Google Scholar 

  176. J. Janssen, “Processus de renouvellements Markoviens et processus semi-Markoviens,” Cah. Cent. Étud. Rech. Opér.,6, 81–105 (1964).

    Google Scholar 

  177. J. Janssen, “Processus de renouvellements Markoviens. 2-e partie. Stationnarite et Application à un problème d'invalidité,” Cah. Cent. Etud. Rech. Oper.,7, 126–141 (1965).

    Google Scholar 

  178. J. Janssen, “Application des processus semi-Markoviens à un problème d'invalidité,” Bull. l'ARAB,63, 35–52 (1966).

    Google Scholar 

  179. J. Janssen, “Les processus (J-X),” Cah. Cent. Étud. Rech. Opér.,11, No. 4, 181–214 (1969).

    Google Scholar 

  180. W. S. Jewell, “Markov-renewal programming. I. Formulation, finite return models,” Oper. Res.,11, No. 6, 938–948 (1963).

    Google Scholar 

  181. W. S. Jewell, “Markov-renewal programming. II. Infinite return models, example,” Oper. Res.,11, No. 6, 949–971 (1963).

    Google Scholar 

  182. W. S. Jewell, “Fluctuations of a renewal-reward process,” J. Math. Anal. Appl.,19, No. 2, 309–329 (1967).

    Google Scholar 

  183. J. Keilson, “On the matrix renewal function for Markov renewal processes,” Ann. Math. Stat.,40, No. 6, 1901–1907 (1969).

    Google Scholar 

  184. H. Kesten, “Occupation times for Markov and semi-Markov chains,” Trans. Amer. Math., Soc.,103, No. 1, 82–112 (1962).

    Google Scholar 

  185. A. M. Kshirsagar and Y. P. Gupta, “Asymptotic values of the first two moments in Markov renewal processes,” Biometrika,54, Nos. 3–4, 597–603 (1967).

    Google Scholar 

  186. A. M. Kshirsagar and Y. P. Gupta, “Mean and variance of the number of renewals in certain Markov renewal processes,” J. Indian Statist. Assoc.,6, No. 1, 2 (1968).

    Google Scholar 

  187. A. M. Kshirsagar and Y. P. Gupta, “Some results in Markov renewal processes,” Calcutta Statist. Assoc. Bull.,18, No. 70, 61–72 (1969).

    Google Scholar 

  188. A. M. Kshirsagar and Y. P. Gupta, “Distribution of the number of Markovian renewals in an arbitrary interval,” Austral. J. Statist.,12, No. 1, 58–63 (1970).

    Google Scholar 

  189. A. M. Kshirsagar and R. Wysocki, “Some distribution and moment formulae for the Markov renewal process,” Proc. Cambridge Phil. Soc.,68, No. 1, 159–166 (1970).

    Google Scholar 

  190. T. G. Kurtz, “Comparison of semi-Markov and Markov processes,” Ann. Math. Stat.,42, No. 3, 991–1002 (1971).

    Google Scholar 

  191. J. P. Lambotte, “Processus semi-Markoviens et files d'attente,” Cah. Cent. Etud. Rech. Oper.,10, No. 1, 21–31 (1968).

    Google Scholar 

  192. J. P. Lambotte and J. Teghem, “Utilisation de la théorie des processus semi-Markoviens dans l'étude de problémes de files d'attente,” in: Queueing Theory, London (1967), pp. 61–64.

  193. P. Lévy, “Systèmes semi-Markoviens à au plus une infinité denombrable d'états possibles,” Proc. Int. Congr. Math., 1954,2, Amsterdam (1954), pp. 294–295.

    Google Scholar 

  194. P. Lévy, “Processus semi-Markoviens,” Proc. Int. Congr. Math., 1954,3, Groningen-Amsterdam (1956), pp. 416–426.

    Google Scholar 

  195. S. A. Lippman, “Maximal average-reward policies for semi-Markov decision processes with arbitrary state and action space,” Ann. Math. Stat.,42, No. 5, 1717–1726 (1971).

    Google Scholar 

  196. R. A. McLean and M. F. Neuts, “The integral of a function defined on a semi-Markov process,” SIAM J. Appl. Math.,15, No. 3, 726–737 (1967).

    Google Scholar 

  197. E. H. Moore, “A semi-Markov process model for secondary acquisition systems,” IEEE Trans. Aerospace and Electron. Syst.,5, No. 1, 33–38 (1969).

    Google Scholar 

  198. E. H. Moore and R. Pyke, “Estimation of the transition distributions of a Markov renewal process,” Ann. Inst. Statist. Math.,20, No. 3, 411–424 (1968).

    Google Scholar 

  199. S. S. Nair, “Semi-Markov analysis of two queues in series attended by a single server,” Bull. Soc. Math. Belg.,22, No. 4, 355–367 (1970).

    Google Scholar 

  200. S. S. Nair, “A single server tandem queue,” J. Appl. Probab.,8, No. 1, 95–109 (1971).

    Google Scholar 

  201. S. S. Nair and M. F. Neuts, “A priority rule based on the ranking of the service times for the M|G|1 queue,” Oper. Res.,17, No. 3, 466–477 (1969).

    Google Scholar 

  202. M. F. Neuts, “Generating functions for Markov renewal processes,” Ann. Math. Stat.,35, No. 1, 431–434 (1964).

    Google Scholar 

  203. M. F. Neuts, “The busy period of a queue with batch service,” Oper. Res.,13, No. 5, 815–819 (1965).

    Google Scholar 

  204. M. F. Neuts, “Semi-Markov analysis of a bulk queue,” Bull. Soc. Math. Belg.,18, No. 1, 28–42 (1966).

    Google Scholar 

  205. M. F. Neuts, “The single server queue with Poisson input and semi-Markov service time,” J. App. Probab.,3, No. 1, 202–230 (1966).

    Google Scholar 

  206. M. F. Neuts, “A general class of bulk queues with Poisson input,” Ann. Math. Stat.,38, No. 3, 759–770 (1967).

    Google Scholar 

  207. M. F. Neuts, “Two Markov chains arising from examples of queues with state-dependent service times,” Sandhya, Indian J. Statist.,29, No. 3, 259–264 (1967).

    Google Scholar 

  208. M. F. Neuts, “Two queues in series with a finite, intermediate waiting room,” J. Appl. Probab.,5, No. 1, 123–142 (1968).

    Google Scholar 

  209. M. F. Neuts, “The queue with Poisson input and general services times treated as a branching process,” Duke Math. J.,36, No. 2, 215–231 (1969).

    Google Scholar 

  210. M. F. Neuts, “Two servers in series studied in terms of a Markov renewal branching process,” Adv. Appl. Probab.,2, No. 1, 110–149 (1970).

    Google Scholar 

  211. M. F. Neuts, “A queue subject to extraneous phase changes,” Adv. Appl. Probab.,3, No. 1, 78–119 (1971).

    Google Scholar 

  212. M. F. Neuts and J. L. Teugels, “Exponential ergodicity of the M|G|1 queue,” SIAM J. Appl. Math.,17, No. 5, 921–929 (1969).

    Google Scholar 

  213. S. Orey, “Change of time scale for Markov processes,” Trans. Amer. Math. Soc.,99, No. 3, 384–397 (1961).

    Google Scholar 

  214. C. Pearce, “A queueing system with non-recurrent input and batch servicing,” J. App. Probab.,2, No. 2, 442–448 (1965).

    Google Scholar 

  215. R. Pyke, “Markov renewal processes: definitions and preliminary properties,” Ann. Math. Stat.,32, No. 4, 1231–1242 (1961).

    Google Scholar 

  216. R. Pyke, “Markov renewal processes with finitely many states,” Ann. Math. Stat.,32, No. 4, 1243–1259 (1961).

    Google Scholar 

  217. R. Pyke and R. A. Schaufele, “Limit theorems for Markov renewal processes,” Ann. Math. Stat.,35, No. 4, 1746–1764 (1964).

    Google Scholar 

  218. R. Pyke and R. A. Schaufele, “The existence and uniqueness of stationary measures for Markov renewal processes,” Ann. Math. Stat.,37, No. 6, 1439–1462 (1966).

    Google Scholar 

  219. S. M. Ross, “Average cost semi-Markov decision processes,” J. Appl. Probab.,7, No. 3, 649–656 (1970).

    Google Scholar 

  220. M. Schäl, “Markov renewal processes with auxiliary paths,” Ann. Math. Stat.,41, No. 5, 1604–1623 (1970).

    Google Scholar 

  221. M. Schäl, “Rates of convergence in Markov renewal processes with auxiliary paths,” Z. Wahrscheinlichkeitstheor. und verw. Geb.,16, No. 1, 29–38 (1970).

    Google Scholar 

  222. M. Schäl, “The analysis of queues with state-dependent parameters by Markov renewal processes,” Adv. Appl. Probab.,3, No. 1, 155–175 (1971).

    Google Scholar 

  223. R. Schaufele, “Potentials associated with recurrent Markov processes,” J. Math. Anal. Appl.,13, No. 2, 303–336 (1966).

    Google Scholar 

  224. P. J. Schweitzer, “Iterative solution of the functional equations of undiscounted Markov renewal programming,” J. Math. Anal. Appl.,34, No. 3, 495–501 (1971).

    Google Scholar 

  225. R. F. Serfozo, “Functions of semi-Markov processes,” SIAM J. Appl. Math.,20, No. 3, 530–535 (1971).

    Google Scholar 

  226. R. F. Serfozo, “Random time transformations of semi-Markov processes,” Ann. Math. Stat.,42, No. 1, 176–188 (1971).

    Google Scholar 

  227. W. L. Smith, “Regenerative stochastic processes,” Proc. Roy. Soc,A232, 6–31 (1955).

    Google Scholar 

  228. W. L. Smith, “Some peculiar semi-Markov processes,” Proc. 54h Berkeley Sympos. Math. Statist. and Probab., 1965–1966. Vol. 2, Part 2, Berkeley-Los Angeles (1967), pp. 255–263.

    Google Scholar 

  229. W. L. Smith, “Remarks on the paper ‘Regenerative stochastic processes,’” Proc. Roy. Soc.,A256, No. 1287, 496–501 (1960).

    Google Scholar 

  230. L. D. Stone, “On the distribution of the maximum of a semi-Markov process,” Ann. Math. Stat.,39, No. 3, 947–956 (1968).

    Google Scholar 

  231. L. D. Stone, “On the distribution of the supremum functional for semi-Markov processes with continuous state spaces,” Ann. Math. Stat.,40, No. 3, 844–853 (1969).

    Google Scholar 

  232. “Distribution of time above a threshold for semi-Markov jump processes,” J. Math. Anal. Appl.,30, No. 3, 576–591 (1970).

  233. H. Störmer, Semi-Markoff Prozesse mit endlich vielen Zustanden. Theorie und Anwendungen. Lect. Notes Oper. Res. and Math. Syst., VII, No. 34 (1970).

  234. Yasudhi Taga, “On the limiting distributions in Markov renewal processes with finitely many states,” Ann. Inst. Statist. Math.,15, No. 1, 1–10 (1963).

    Google Scholar 

  235. L. Takács, “Bizonyos típusú rekurrens sztochasztikus folyamatok vizsgálatáról,” Maguar Tud. Akad. Mat. Kutató. Int. Közl.,3, Nos. 1–2, 115–128 (1954).

    Google Scholar 

  236. L. Takács, “On a generalization of the renewal theory,” Maguar Tud. Akad. Mat. Kutató. Int. Közl.,2, Nos. 1–2, 91–103 (1957).

    Google Scholar 

  237. L. Takács, “On a sojourn time problem,” Teor. Veroyat. i Primen.,3, No. 1, 61–69 (1958).

    Google Scholar 

  238. L. Takács, “On a sojourn time problem in the theory of stochastic processes,” Trans. Amer. Math. Soc.,93, No. 3, 531–540 (1959).

    Google Scholar 

  239. J. L. Teugels, “Exponential ergodicity in Markov renewal processes,” J. Appl. Probab.,5, No. 2, 387–400 (1968).

    Google Scholar 

  240. J. L. Teugels, “Regular variation of Markov renewal functions,” J. London Math. Soc.,2, No. 1, 179–190 (1970).

    Google Scholar 

  241. J. Yackel, “Limit theorems for semi-Markov processes,” Trans. Amer. Math. Soc.,123, No. 2, 402–424 (1966).

    Google Scholar 

  242. J. Yackel, “A random time change relating semi-Markov and Markov processes,” Ann. Math. Stat.,39, No. 2, 358–364 (1968).

    Google Scholar 

Download references

Authors
  1. V. S. Korolyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. M. Brodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. F. Turbin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Itogi Nauki i Tekhniki (Teoriya Veroyatnostei, Matematicheskaya Statistika, Teoreticheskaya Kibernetika), Vol. 11, pp. 47–97, 1974).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Korolyuk, V.S., Brodi, S.M. & Turbin, A.F. Semi-markov processes and their applications. J Math Sci 4, 244–280 (1975). https://doi.org/10.1007/BF01097184

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01097184

Search

Navigation