Skip to main content

A Second bibliography on semi-Markov processes

  • Chapter
Semi-Markov Models

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Abe, S. (1977). The asymptotic exponential failure law for redundant repairable systems, II. Rep.Statist.Appl.Res.Un.Japan.Sci. Engin., 24, 15–39.

    Google Scholar 

  • Affisoo, J. & A. Ghosal (1978). Approximation of waiting time in tandem queues through isomorphs-1. SCIMA, J.Manag.Sci.Appl.Cybern., 7, 55–68.

    MATH  Google Scholar 

  • Agarwal, M. & A. Kumar (1980). A review of standby redundant systems. IEEE Trans.Reliab. R-29, 290–294.

    Article  Google Scholar 

  • Agarwal, M. & A. Kumar (1980). Steady-state analysis of a 2-unit standby system with inefficient and intermittent repair. IAPQR Trans., 5, 85–99.

    Google Scholar 

  • Agarwal, M., R. Debabrata & A. Kumar (1978). Probability analysis of a two-unit standby redundant system with repair efficiency and imperfect switch-over. Intern.J.Systems Sci., 9, 731–742.

    Article  MATH  Google Scholar 

  • Agarwal, M., A. Kumar & S.M. Sinha (1977 and 1981). Analysis of a two-unit priority standby system with different operative states. J. Math.Sci., Delhi, 65-79 and 12-13.

    Google Scholar 

  • Agnew, C.E. (1976). Dynamic modelling and control of congestion-prone systems. Operations Res., 24, 400–419.

    Article  MathSciNet  MATH  Google Scholar 

  • Agrafiotis, G.K. (1980). Modelling manpower systems. Ind.Math., 30, 103–120.

    MathSciNet  MATH  Google Scholar 

  • Agrafiotis, G.K. (1982). On the stochastic theory of compartments: a semi-Markov approach for the analysis of the k-compartmental systems. Bull.Math.Biol., 44, 809–817.

    MathSciNet  MATH  Google Scholar 

  • Agrafiotis, G.K. (1983). General distribution function for periods of downtime of a single system exceeding a limiting downtime. J.Oper.Res.Soc, 34, 1115–1118.

    MATH  Google Scholar 

  • Agrawala, A.K. & R.L. Larsen (1983). Control of a heterogeneous two-server exponential queueing system. IEEE Trans.Software Eng., SE-9, 522–526.

    Article  Google Scholar 

  • Ahmedova, H.M. & T.I. Nasirova (1975). Non-stationary distribution of an inventory for a model with inventory control. Izvestija Akad.Nauk Azerbaidz.SSR, Ser.fiz.-tehn.mat.Nauk, 19-22 (Russian).

    Google Scholar 

  • Akif, E.M., T. Chien & Y. Ho (1979). A gradient technique for general buffer storage design in a production line. Proc.1978 IEEE Conf. Decision & Control, San Diego, 625-632.

    Google Scholar 

  • Akritas, M.G. & G.G. Roussas (1980). Asymptotic inference in continuous time semi-Markov processes. Scan.J.Stat., 7, 73–97.

    MathSciNet  MATH  Google Scholar 

  • Aksenov, B.E., A.M. Aleksandrov & A.N. Bakanov (1973). Application of generalized Poisson flow for the study of methods to increase the reliability. Probl.Peredaci Inform., 9, 80–86 (Russian).

    MathSciNet  MATH  Google Scholar 

  • Akyildiz, I.F. & G. Bolch (1982). Analyse von Rechensystemen. Analytische Methoden zur Leistungsbewertung und Leistungsvorhersage. Leitfaden der Angewandten Mathematik und Mechanik, Band 57, Teubner.

    Google Scholar 

  • Alam, M. & R. Billiton (1978). Effect of restricted repair on system reliability indices. IEEE Trans.Reliab., R-27, 376–379.

    Article  Google Scholar 

  • Aleksandrov, A.M. (see Aksenov, B.E.).

    Google Scholar 

  • Ali Khan, M.S. (1977). Infinite dams with discrete additive inputs. J.Appl.Probab., 14, 170–180.

    Article  MathSciNet  MATH  Google Scholar 

  • Alj A. & A. Haurie (1979). Description and control of a continuous time population process. Proc.1978 IEEE Conf.Decision & Control, San Diego, 557-565.

    Google Scholar 

  • Alj, A. & A. Haurie (1980). Description and control of a continuous-time population process. IEEE Trans.Autom.Control AC-25, 3–10.

    Article  MathSciNet  Google Scholar 

  • Alj, A. & A. Haurie (1981). Hierarchical control of a population process with application to group preventive maintenance. Large scale systems, theory and applications, Proc.IFAC Symp. Toulouse, 1980, 333–338.

    Google Scholar 

  • Allan, R.N., M.R.G. Al-Shakarchi & C.H. Grigg (1976). Numerical techniques in probabilistic load flow problems. Int.J.Numer. Methods Engin., 10, 853–860.

    Article  MATH  Google Scholar 

  • Al-Shakarchi, M.R.G. (see Allan R.N.).

    Google Scholar 

  • Aluffi, F., S. Incerti & F. Zirilli (1980). An application of the diffusion approximation to queueing networks: a moving head disks model. Ottimizzazione non lineare e applicazioni, Atti Conv.int.L’Aquila, 213-222.

    Google Scholar 

  • Anders, B. & G. Lucas (1981). Optimierungmodelle zur Regelung forstlichrer Prozesse unter Beachtung von Ubergangswahrscheinlichkeiten. Wiss.Z.Tech.Univ.Dres., 30, 91–95.

    MathSciNet  MATH  Google Scholar 

  • Andersen, P.K. (1981). A note on filtered Markov renewal processes. J.Appl.Probab., 18, 752–756.

    Article  MathSciNet  MATH  Google Scholar 

  • Anderson, M.Q. (1981). Monotone optimal preventive maintenance policies for stochastically failing equipment. Nav.Res.Logist. Q., 28, 347–358.

    Article  MATH  Google Scholar 

  • Andronov, A.M. (1980). Algorithm for finding optimal strategies in controlled semi-Markov birth-and-death processes. Eng.Cybern., 18, 67–71.

    MathSciNet  MATH  Google Scholar 

  • Anichkin, S.A. (1982). Coupling of renewal processes and its applications. Stability problems of stochastic models, Proc.Semin. Moskva, 4-24.

    Google Scholar 

  • Anichkin, S.A. (1983). Hyper-Erlang approximation of probability distributions on (0,∞) and its application. Stability problems of stochastic models, Proc.Semin.Moskva, 1-16.

    Google Scholar 

  • Anisimov, V.V. (1973). On stopping a stochastic process at the time a certain level is reached. Soviet Math.Doklady, 14, 1500–1503.

    MATH  Google Scholar 

  • Anisimov, V.V. (1978). Description of multidimensional limit laws for finite Markov chains in a series scheme: the general case. Theory Probab.Math.Stat., 11, 1–7.

    MATH  Google Scholar 

  • Anisimov, V.V. (1977). Switched processes. Kibernetika, Kiev, 111-115.

    Google Scholar 

  • Anisimov, V.V. (1979). Applications of limit theorems for switching processes. Cybernetics, 14, 917–929.

    Article  Google Scholar 

  • Anisimov, V.V. (1981). Limit theorems for processes admitting the asymptotic consolidation of one component. Theory Probab.Math. Stat., 22, 1–13.

    MATH  Google Scholar 

  • Anisimov, V.V. (1981). Asymptotic enlargement of inhomogeneous Markov and semi-Markov systems with an arbitrary state space. Dokl. Akad.Nauk Ukr.SSR, Ser.A, 3-6 (Russian).

    Google Scholar 

  • Anisimov, V.V. & A.I. Chernyak (1983). Limit theorems for certain rare functionals on Markov chains and semi-Markov processes. Theory Probab.Math.Stat., 26, 1–6.

    MATH  Google Scholar 

  • Anisomov, V.V., V.I. Sereda & A.A.Vojna (1981). Choice of the optimal checking moments for a semi-Markov system with failures. Dokl. Akad.Nauk Ukr.SSR, Ser.A, 79-82 (Russian).

    Google Scholar 

  • Anisimov, V.V. & V.N. Sityuk (1982). Asymptotic analysis of the heterogeneous Markov systems with rare semi-Markov failures. Dokl. Akad.Nauk Ukr.SSR, Ser.A, 66-69 (Russian).

    Google Scholar 

  • Ansell, J., A. Bendell & S. Humble (1980). Nested renewal processes. Adv.Appl.Probab., 12, 880–892.

    Article  MathSciNet  MATH  Google Scholar 

  • Aranda, G.J. (1982). Some relations between Markovian models of networks of queues. Trab.Estad.Invest.Oper. 33, 3–29 (Spanish).

    MATH  Google Scholar 

  • Aripov, H.M. (1974). On a generalization of the Erlang problem for an arbitrary distribution of the service time. Izvestija Akad. Nauk UzSSR, fiz.-mat.Nauk, 18, 8–12 (Russian).

    MathSciNet  MATH  Google Scholar 

  • Arjas, E. & V.S. Korolyuk (1980). Stationary phase extension of Markov renewal processes. Dopov.Akad.Nauk Ukr.SSR, Ser.A, 3-6 (Ukrainian).

    Google Scholar 

  • Arjas, E. & E. Nummelin (1977). Semi-Markov processes and σ-invariant distributions. Stochastic Processes Appl., 6, 53–64.

    Article  MathSciNet  MATH  Google Scholar 

  • Arjas, E., E. Nummelin & R.L. Tweedie (1978). Uniform limit theorems for non-singular renewal and Markov renewal processes. J.Appl. Prob., 15, 112–125.

    Article  MathSciNet  MATH  Google Scholar 

  • Arjas, E., E. Nummelin & R.L. Tweedie (1980). Semi-Markov processes on a general state space: alpha-theory and quasi-stationarity. J.Aust.Math.Soc., Ser.A, 30, 187–200.

    Article  MathSciNet  MATH  Google Scholar 

  • Arndt, U. & P. Franken (1979). Construction of a class of stationary processes with applications in reliability. Zastosow.Mat., 16, 379–392.

    MathSciNet  MATH  Google Scholar 

  • Arndt, U. & P. Franken (1979). Continuity of generalized regenerative processes. Eng.Cybern., 17, 69–72.

    MATH  Google Scholar 

  • Arndt, U., P. Franken, D. Koenig & V. Schmidt (1982). Queues and point processes. John Wiley & Sons.

    Google Scholar 

  • Arora, J.R. (1977). Reliability of several standby-priority-redundant systems. IEEE Trans.Reliab. R-26, 290–293.

    Article  Google Scholar 

  • Arsenisvili, G.L. & I.I. Ezov (1978). A certain limit theorem for semi-Markov processes of order r. Select.Translat.Math. Statist.Probab., 14, 135–138.

    Google Scholar 

  • Artamonov, G.T. (1976). Produktivität einer diskreten bearbeitenden Zweigerat-Taktstrase unter den Verhaltnissen von Versagern. Kibernetika, Kiev, 126–130 (Russian).

    Google Scholar 

  • Athreya, K.B. & P.E. Ney (1978). Limit theorems for semi-Markov processes. Bull.Austral.Math.Soc., 19, 283–294.

    Article  MathSciNet  MATH  Google Scholar 

  • Athreya, K.B. & K. Ramamurthy (1980). Renewal theory — A Markov process approach. J.Math.Kyoto Univ., 20, 169–177.

    MathSciNet  MATH  Google Scholar 

  • Athreya, K.B., D. McDonald & P.E. Ney (1978). Limit theorems for semi-Markov processes and renewal theory for Markov chains. Ann. Probability, 6, 788–797.

    Article  MathSciNet  MATH  Google Scholar 

  • Avenhaus, R. & W. Haussmann (1983). Ein Markov’sches Modell für ein serielles Produktionsystem mit einen Zwischenlager. Methods Oper.Res., 46, 547–560.

    MATH  Google Scholar 

  • Azlarov T.A. ed. (1969). Mathematical methods in material and quality control. Akad.Nauk Uzb.SSR.Inst.Mat.Romanovskogo. Tashkent.

    Google Scholar 

  • Babadzhanyan, A.A. (1979). A certain extension of Markov processes as basis for solution and algorithm for an optimal strategy. Dokl.Akad.Nauk Arm.SSR, 69, 213–216 (Russian).

    MathSciNet  MATH  Google Scholar 

  • Baccelli, F. (1981). Analysis of a service facility with periodic checkpointing. Acta Inf., 15, 67–81.

    Article  MathSciNet  MATH  Google Scholar 

  • Bajaj, D. & A. Kuczura (1977). A method of moment for the analysis of a switched communication network’s performance. IEEE Trans. Commun.COM-25, 185-193.

    Google Scholar 

  • Bakanov, A.N. (see Aksenov, B.E.).

    Google Scholar 

  • Balagopal, K. (1979). Some limit theorems for the general semi-Markov storage model. J.Appl.Probab., 16, 607–617.

    Article  MathSciNet  MATH  Google Scholar 

  • Balbo, G., S.C. Bruell & H.D. Schwetman (1977). Customer classes and closed network models — a solution technique. Inf.Process. 77, Proc.IFIP Congr.Toronto 1977, 559–564.

    Google Scholar 

  • Balcer, Y. & I. Sahin (1983). A stochastic theory of pension dynamics. Insur.Math.Econ., 2, 179–197.

    Article  MathSciNet  MATH  Google Scholar 

  • Baltrunas, A. (1982). Regularity of semi-Markov processes. Lith. Math.J., 21, 111–116.

    Article  MATH  Google Scholar 

  • Banach, D. & D.S. Silvestrov (1981). Uniform ergodic theorems on the average for accumulation processes. Dopov.Akad.Nauk Ukr.SSR, Ser.A, 34-37.

    Google Scholar 

  • Bandura, V.N. & I.I. Ezov (1974). On the distribution of first-passage time of a given level for a class of processes with step-function trajectories I, II. Theor.Probab.Math.Statist., 1, 5–18 & 19-34.

    Google Scholar 

  • Banerjee, A.K. & G.K. Bhattacharyya (1976). Testing hypotheses in a two-state semi-Markov process. Sankhya, Ser.A, 38, 340–356.

    MathSciNet  MATH  Google Scholar 

  • Baras, J.S., W.S. Levine & T.L. Lin (1979). Discrete time point processes in urban traffic queue estimation. Proc.IEEE Conf. Decision & Control, San Diego, 1025-1031.

    Google Scholar 

  • Barbour, A.D. (1982). Generalized semi-Markov schemes and open queueing networks. J.Appl.Probab., 19, 469–474.

    Article  MathSciNet  MATH  Google Scholar 

  • Barbour, A.D. & R. Schassberger (1981). Insensitive average residence times in generalized semi-Markov processes. Adv.Appl.Probab., 13, 720–735.

    Article  MathSciNet  MATH  Google Scholar 

  • Barfoot, C.B. (1983). Some mathematical methods for modelling the performance of a distributed data base system. Adequate modelling of systems, Proc.Int.Conf.Bad Honnef, 172-182.

    Google Scholar 

  • Barlow, R.E. & F. Proschan (1976). Theory of maintained systems: Distribution of time to first system failure. Math.Oper.Res., 1, 32–42.

    Article  MathSciNet  MATH  Google Scholar 

  • Basawa, I.V. (1974). Maximum likelihood estimation of parameters in renewal and Markov-renewal processes. Austral.J.Statist., 16, 33–43.

    Article  MathSciNet  MATH  Google Scholar 

  • Barzily, Z. & M. Rubinovitch (1979). On platoon formation on two-lane roads. J.Appl.Probab., 16, 347–361.

    Article  MathSciNet  MATH  Google Scholar 

  • Basharin, G.P., V.A. Kokotushkin & V.A. Naumov (1979). The method of equivalent substitutions for calculating fragments of communication networks for a digital computer. I. Eng.Cybern., 17, 66–79.

    MATH  Google Scholar 

  • Bather, J.A. (1976). A control chart model and a generalized stopping problem for brownian motion. Math.Oper.Res., 1, 209–224.

    Article  MathSciNet  MATH  Google Scholar 

  • Baxter, L.A., D.J. McConalogue & E.M. Scheuer (1982). On the tabulation of the renewal function. Technometrics, 24, 151–156.

    Article  MATH  Google Scholar 

  • Becker, M. & A.M. Kshirsagar (1981). Superposition of Markov renewal processes. S.Afr.Stat.J., 15, 13–30.

    MathSciNet  MATH  Google Scholar 

  • Becker, A. & A.H. Marcus (1977). Power laws in compartmental analysis. II. Numerical evaluation of semi-Markov models. Math.Biosciences, 35, 27–45.

    Article  MATH  Google Scholar 

  • Beichelt, F. (1976). Prophylaktische Erneuerung von Systemen. Einfuehrung in mathematische Grundlagen. Wissenschaftliche Taschen-buecher. Reihe Math.-Physik, 153, Akademie-Verlag, Berlin.

    Google Scholar 

  • Berbee, H.C.P. (1979). Random walks with stationary increments and renewal theory. Mathematical Centre Tracts, 112.

    Google Scholar 

  • Berg, M. (1976). A proof of optimality for age replacement policies. J.Appl.Probab., 13, 751–759.

    Article  MATH  Google Scholar 

  • Berg, M. (1976). Optimal replacement policies for two-unit machines with increasing running costs, I. Stochastic Processes Appl., 4, 89–106.

    Article  MathSciNet  MATH  Google Scholar 

  • Berg, M. (1981). A stochastic model for the reliability of a power unit with deliberate shutdowns. Eur.J.Oper.Res., 6, 309–314.

    Article  MATH  Google Scholar 

  • Berman, M. (1978). Regenerative multivariate point processes. Adv. Appl.Probab., 10, 411–430.

    Article  MATH  Google Scholar 

  • Bertsekas, D.P. (1982). Dynamic behavior of shortest path routing algorithms for communication networks. IEEE Trans.Autom.Control AC-27, 60-74.

    Google Scholar 

  • Bestwick, P.F. & D. Sadjadi (1979). A stagewise action elimination algorithm for the discounted semi-Markov problem. J.Oper.Res. Soc, 30, 633–637.

    MathSciNet  MATH  Google Scholar 

  • Beutler, F.J. & B. Melamed (1978). Decomposition and customer streams of feedback networks of queues in equilibrium. Oper.Res., 26, 1059–1072.

    Article  MathSciNet  MATH  Google Scholar 

  • Beutler, F.J. & B. Melamed (1982). Multivariate Poisson flows on Markov step processes. J.Appl.Probab., 19, 289–300.

    Article  MathSciNet  MATH  Google Scholar 

  • Beyer, W.A. & C. Delisi (1977). The asymptotic form of partition functions of linear chain molecules: an application of renewal theory. J.Math.Analysis Appl., 57, 416–428.

    Article  MathSciNet  MATH  Google Scholar 

  • Bhalaik, H.S. & N.S. Kambo (1979). Non-homogeneous M/M/s queues in series. INFOR, Can.J.Oper.Res.Inf.Process., 17, 262–275.

    MathSciNet  MATH  Google Scholar 

  • Bhaskar, D. & S.K. Srinivasan (1979). Probabilistic analysis of intermittently used systems. J.Math.Phys.Sci., Madras, 13, 91–105.

    MATH  Google Scholar 

  • Bhat, U.N. & R.E. Nance (1979). An evaluation of CPU efficiency under Bhattacharyya, G.K. (see A.K.Benerjee). dynamic quantum allocation. J.Assoc.Comput.Mach., 26, 761–778.

    Article  MathSciNet  MATH  Google Scholar 

  • Bieber, G. (1979). On optimal control of Markov processes with application to a class of service systems. Math.Operationsforsch.Stat., Ser.Optimization, 10, 143–162.

    Article  MathSciNet  MATH  Google Scholar 

  • Billinton, R. (see M.Alam).

    Google Scholar 

  • Birolini, A. (1977). Hardware simulation of semi-Markov and related processes. I. A versatile generator: II. Simulation of noise pulses on data channels and other applications. Math.Comput. Simulation, 19, 75–97 & 183-191.

    Article  MathSciNet  MATH  Google Scholar 

  • Biswas, S., P.K. Kapur & Y.K. Mehta (1983). Generalized availability measures for repairable systems. IAPQR Trans., 8, 83–94.

    MATH  Google Scholar 

  • Blischke, W.R. (see L.A.Baxter).

    Google Scholar 

  • Blischke, W.R. & R.M. Scheuer (1981). Applications of renewal theory in analysis of the free-replacement warranty. Nav.Res.Logist.Q., 28, 193–205.

    Article  MathSciNet  MATH  Google Scholar 

  • Bobbio, A. & A. Premoli (1983). Analysis of non-regenerative repair processes through homogeneous Markov models. Int.J.Syst.Sci., 14, 647–659.

    Article  MathSciNet  MATH  Google Scholar 

  • Bobos, A.G. & E.N. Protonotarios (1978). Optimal systems for equipment maintenance and replacement under Markovian deterioration. Eur. J.Oper.Res., 2, 257–264.

    Article  MathSciNet  MATH  Google Scholar 

  • Bodnariu, M.A. (1982). Compact Markov processes with rewards. Stud. Cercet.Mat., 34, 211–222 (Roumanian).

    MathSciNet  MATH  Google Scholar 

  • Boel, R. (1981). Martingale methods for the semi-Markov analysis of queues with blocking. Stochastics, 5, 115–133.

    Article  MathSciNet  MATH  Google Scholar 

  • Boel, R. (1981). Stochastic models of computer networks. Proc.NATO ASI: Stochastic Systems, Les Arcs, 1980, 141–167.

    MathSciNet  Google Scholar 

  • Bogdantsev, E.N. & S.M. Brodi (1982). Limit theorem for a class of imbedded semi-Markov processes. Cybernetics, 17, 667–693.

    Google Scholar 

  • Bokucava, I.V. (1976). On estimates of the spectral characteristics of sequences of intervals between the events of a stationary semi-Markovian process. Soobscenija Akad.Nauk Gruzin.SSR 84, 17–20 (Russian).

    MathSciNet  Google Scholar 

  • Bolch, G. (see I.F. Akyildiz).

    Google Scholar 

  • Boling, R. & F.S. Hillier (1977). Toward characterizing the optimal allocation of work in production line systems with variable operation times. Adv.Oper.Res.Proc.2nd Eur.Congres., Stockholm 1976, 649–658.

    Google Scholar 

  • Bondarev, V.V. & V.I.Nosenko (1976). Questions of the stability and the dissipation for stochastic differential equations with a semi-Markov interference of the randomness. Behaviour of systems in random media, Work Collect., Kiev, 8-15 (Russian).

    Google Scholar 

  • Borovkov, K.A. (1980). Stability theorems and estimates of the rate of convergence of the components of factorizations for walks defined on Markov chains. Theory Probab.Appl., 25, 325–334.

    Article  MATH  Google Scholar 

  • Borozdin, O.P. & I.I. Ezov (1979). On a class of boundary functionals for strongly regenerative random processes. Theory Probab.Math. Statist., 18, 9–19.

    MATH  Google Scholar 

  • Bosch, K. (1975). Erneuerungsprozesse mit Erneuerungen zu verschiedenen Kosten. Angew.Informatik, 17, 143–150.

    Google Scholar 

  • Bosch, K. (1981). Wartungs-und Inspektionenstrategien. Operations Res., Proc. 1980, DGOR, Essen, 229-240.

    Google Scholar 

  • Bosch, K. & U. Jensen (1978). Deterministische Inspektionenstrategien. Z.Operat.Res., Ser.A, 22, 151–168.

    MathSciNet  MATH  Google Scholar 

  • Boyse, J.W. (1974). Determining near-optimal policies for Markov renewal decision processes. IEEE Trans.Systems Man Cybernetics SMC-4, 215-217.

    Google Scholar 

  • Brandwayn, A. (1976). Control schemes in queueing networks. Management Sci., 22, 810–822.

    Article  Google Scholar 

  • Breuer, M.A. & A.D. Friedman (1977). Diagnosis and reliable design of digital systems. Digital System Design Series. Pitman, London.

    Google Scholar 

  • Brodeckii, G.L. (1978). On a problem of periodic storing of results. Kibernetica, Kiev, 70-74 (Russian).

    Google Scholar 

  • Brodeckii, G.L. (1980). On the question of optimal organization of recording intermediate information in the case of random failures of a system. Eng.Cybern., 18, 61–65.

    Google Scholar 

  • Brodi, S.M. (see E.N. Bogdantsev).

    Google Scholar 

  • Brodi, S.M., V.S. Korolyuk & A.F. Turbin (1976). Semi-Markov processes and their applications. J.Soviet Math., 4, 244–280.

    MATH  Google Scholar 

  • Brown, C.B. & E.C.C. Chang (1973). Functional reliability of structures. J.Franklin Inst., 296, 161–178.

    Article  MATH  Google Scholar 

  • Brown, C.C., M.H. Gail & T.J. Santner (1980). An analysis of comparative carcinogenesis experiments based on multiple times to tumor. Biometrics, 36, 255–266.

    Article  MathSciNet  MATH  Google Scholar 

  • Brown, T.C. & P.K. Pollett (1982). Some distributional approximations in Markovian queueing networks. Adv.Appl.Probab., 14, 654–671.

    Article  MathSciNet  MATH  Google Scholar 

  • Bruell, S.C. (see G.Balbo).

    Google Scholar 

  • Buehler, G. (1976). Informationsbedarf bei Produktions-Lagerhaltungs-Modellen. Proc.Oper.Res., 6, DGOR, 380-389.

    Google Scholar 

  • Buehler, G. (1979). Sicherheitsaequivalente und Informationsbedarf bei stochastischen dynamischen Produktions-Lagerhaltungs-Modellen. Haag und Herchen Verlag, Frankfurt/Main.

    MATH  Google Scholar 

  • Burgin, T.A. & J.M. Norman (1976). A table for determining the probability of a stock out and potential lost sales for a gamma distributed demand. Operat.Res.Quart., 27, 621–631.

    Article  MathSciNet  MATH  Google Scholar 

  • Burman, D. (1976). Estimation of transition probabilities in a multiparticle semi-Markov system. J.Appl.Probab., 13, 696–706.

    Article  MathSciNet  MATH  Google Scholar 

  • Burman, D. (1981). Insensitivity in queueing systems. Adv.Appl. Probab., 13, 846–859.

    Article  MathSciNet  MATH  Google Scholar 

  • Butko, T.K. (1982). Markov renewal process of the system M/G/1/∞. Applied problems of probability theory, Collect.Sci.Works, Kiev, 14-19 (Russian).

    Google Scholar 

  • Calvert, T.W. & A.C. Sanderson (1976). Distribution coding in neural interaction models. Math.Biosciences, 29, 1–25.

    Article  MATH  Google Scholar 

  • Cao, J. & K. Cheng (1982). Analysis of M/G/1 queueing system with repairable service station. Acta Math.Appl.Sin., 5, 113–127 (Chinese).

    MathSciNet  MATH  Google Scholar 

  • Carravetta, M. & R. de Dominicis (1981). Some applications of semi-Markov processes in reliability and modelling. RAIRO, Autom. Syst.Anal.Control, 15, 361–375.

    MATH  Google Scholar 

  • Carravetta, M. R. de Dominicis & M.R. D’Esposito (1981). Semi-Markov processes in modelling and reliability: a new approach. Appl.Math.Modelling, 5, 269–274.

    Article  MathSciNet  MATH  Google Scholar 

  • Carravetta, M. R. de Dominicis & R. Manca (1981). Semi-Markovian stochastic processes in social security problems. Cah.Cent. Etud.Rech.Oper., 23, 333–339.

    Google Scholar 

  • Carroll, J.L., A. van de Liefvoort & L. Lipsky (1982). Solutions of M/G/1//N-type loops with extensions to M/G/l and GI/M/1 queues. Oper.Res., 30, 490–514.

    Article  MathSciNet  MATH  Google Scholar 

  • Case, J. (1979). A model to predict the quality of taxi service at a large municipal airport when the drivers compete. Lecture Notes Pure Appl.Math., 47, 187–203.

    Google Scholar 

  • Chakravarthy, S. & M.F. Neuts (1981). A single server queue with platooned arrivals and phase type services, Eur.J.Oper.Res., 8, 379–389.

    Article  MathSciNet  MATH  Google Scholar 

  • Chattergy, R. & U.W. Pooch (1978). Analysis of the availability of computer systems using computer-aided algebra. Commun.ACM 21, 586–591.

    Article  MathSciNet  MATH  Google Scholar 

  • Chatterjee, A., N.D. Georganas & P.K. Verma (1980). Local congestion control in computer-communication networks with random routing. INFOR, Can.J.Oper.Res.Inf.Process., 18, 74–79.

    MATH  Google Scholar 

  • Chauny, F., M. Chokron & A. Haurie (1984). Nursing care demand prediction based on a decomposed semi-Markov population model. Oper. Res.Lett., 2, 279–284.

    Article  MATH  Google Scholar 

  • Chebotarev, A.S. & S.E. Shibanov (1975). Probabilistic problem in the control of multiple allocations with common resources. Izvestija Akad.Nauk SSSR, tehn.Kibernet. 44-47 (Russian).

    Google Scholar 

  • Cheng, K. & J. Cao (1981). Reliability analysis of a general repairable system: Markov renewal model. Acta Math.Appl.Sin., 4, 295–306.

    MathSciNet  MATH  Google Scholar 

  • Cherenkov, A.P. (1974). Existence theorems for a semi-Markov process with an arbitrary set of states. Math.Notes, 15, 367–373.

    Article  MATH  Google Scholar 

  • Cherenkov, A.P. (1977). Asymptote of additive functionals of semi-Markov processes with arbitrary set of states. Math.Notes, 21, 119–124.

    Article  MATH  Google Scholar 

  • Cherenkov, A.P. (1977). Attainability property and ergodicity theorems for a semi-Markov process with an arbitrary set of states. Math.Notes, 21, 167–173.

    Article  MATH  Google Scholar 

  • Cherenkov, A.P. (1980). Some ergodic theorems for a semi-Markov process with an arbitrary set of states. Theory Probab.Math. Statist., 19, 169–180.

    MATH  Google Scholar 

  • Cherenkov, A.P. (1982). The law of large numbers for additive functionals of semi-Markov processes. Applied problems of probability theory. Collect.Sci.Works, Kiev, 134-141 (Russian).

    Google Scholar 

  • Cherkesov, G.N. (1980). Semi-Markovian models of reliability of multichannel systems with unreplenishable reserve of time. Eng.Cybern., 18, 65–78.

    MATH  Google Scholar 

  • Chernaya, M.F. (1979). A busy period analysis for a system with semi-Markov service. Analytical methods in probability theory, Collect.Sci.Works, Kiev, 98-102 (Russian).

    Google Scholar 

  • Chernomorov, G.A. & V.G. Zhukovskij (1979). An analytic model of a closed service system with source by means of an enlargment of a semi-Markov process. Izv.Sev.-Kavk.naucn.Cent.vyss.Sk., teh. Nauki, 33-38 (Russian).

    Google Scholar 

  • Chernyak, A.I. (see V.V.Anisimov).

    Google Scholar 

  • Cherry, W.P. & R.L. Disney (1983). The superposition of two independent Markov renewal processes. Zastosow.Mat., 17, 567–602.

    MathSciNet  MATH  Google Scholar 

  • Chien, T. (see E.M. Akif).

    Google Scholar 

  • Chikte, S.D. & S.D. Deshmukh (1976). Dynamic pricing with stochastic entry. Review Economic Studies, 43, 91–97.

    Article  MATH  Google Scholar 

  • Chokron, M. (see F.Chauny).

    Google Scholar 

  • Choo, Q.H. & B. Conolly (1979). New results in the theory of repeated orders queueing systems. J.Appl.Probab., 16, 631–640.

    Article  MathSciNet  MATH  Google Scholar 

  • Christer, A.H. (1979). Refined asymptotic costs for renewal reward processes. J.Oper.Res.Soc., 29, 577–583.

    Google Scholar 

  • Chu, W.W. & H. Opderbeck (1976). Analysis of the PFF replacement algorithm via a semi-Markov model. Commun.ACM, 19, 298–304.

    Article  MathSciNet  MATH  Google Scholar 

  • Chumakov, L.D. (1975). Interplay between reliability and maintenance costs of a technical system with periodic repair control. Nadezn.Dolgovecn.teh.Sist., 57-60 (Russian).

    Google Scholar 

  • Chumakov, L.D. & V.G. Kurasov (1975). Interplay between reliability and maintenance costs of a technical system with exponential running time without failure and with periodic repair control. Nadezn.Dogovecn.teh.Sist., 53-57 (Russian).

    Google Scholar 

  • Cin, M.D. (1980). Availability analysis of a fault-tolerant computer system. IEEE Trans.Reliab. R-29, 265–268.

    Article  Google Scholar 

  • Çinlar, E. (1975). Markov renewal theory. A survey. Management Sci., Theory, 21, 727–752.

    Article  MATH  Google Scholar 

  • Çinlar, E. (1976). On the structure of semi-Markov processes compared with Chung processes. Ann.of Probab., 4, 402–417.

    Article  MATH  Google Scholar 

  • Çinlar, E. (1977). Conversion of semi-Markov processes to Chung processes. Ann.of Probab., 5, 180–199.

    Article  Google Scholar 

  • Çinlar, E. (1977). Markov additive processes and semi-regeneration. Proc.5th Conf.Probab.Theory, Brasov, 33-49.

    Google Scholar 

  • Çinlar, E. (1979). On increasing continuous processes. Stochastic Processes Appl., 9, 147–154.

    Article  MATH  Google Scholar 

  • Clarotti, C.A. (1981). Limitations of minimal cut-set approach in evaluating reliability of systems with repairable components. IEEE Trans.Reliab. R-30, 335–338.

    Article  Google Scholar 

  • Coffman E.G. Jun. & I. Mitrani (1980). A characterization of waiting time performance realizable by single-server queues. Oper.Res., 28, 810–821.

    Article  MathSciNet  MATH  Google Scholar 

  • Cohen, M., J.C. Hershey & E.N. Weiss (1981). A stochastic service network model with application to hospital facilities. Oper.Res., 29, 1–22.

    Article  MathSciNet  MATH  Google Scholar 

  • Colard, J.P. & G. Latouche (1980). Algorithmic analysis of Markovian model for a system with batch and interactive jobs. Opsearch, 17, 12–32.

    MathSciNet  MATH  Google Scholar 

  • Collart, D. & A. Haurie (1980). On the control of care supply and demand in a urology department. Eur.J.Oper.Res., 4, 160–172.

    Article  MATH  Google Scholar 

  • Consael, R. & J. Sonnenschein (1979). Modèles pseudo-markoviens. Cah. Cent.Etud.Rech.Oper., 21, 315–318.

    MathSciNet  MATH  Google Scholar 

  • Conolly, B. (see Q.H. Choo).

    Google Scholar 

  • Costes, A., Ch. Landrault & J.C. Laprie (1981). Parametric analysis of 2-unit redundant computer systems with corrective and preventive maintenance. IEEE Trans.Reliab., R-30, 139–144.

    Article  Google Scholar 

  • Courtois, P.J. (1978). Exact aggregation of queueing networks. Mathématiques Appl., 1er Colloq.AFCET-SMF, Palaiseau, I, 35-51.

    Google Scholar 

  • Cox, D.R. & V. Isham (1977). A bivariate point process connected with electronic counters. Proc.Roy.Soc.London, Ser.A, 356, 149–160.

    Article  MathSciNet  MATH  Google Scholar 

  • Crabill, T.B. (1974). Optimal control of a maintenance system with variable service rates. Operations Res., 22, 736–745.

    Article  MathSciNet  MATH  Google Scholar 

  • Crowley, J., F.Y. Hsieh & D.C. Tormey (1983). Some test statistics for use in multistate survival analysis. Biometrika, 70, 111–119.

    Article  MathSciNet  MATH  Google Scholar 

  • Cruon, R., D. Grouchko & A. Kaufmann (1975). Modèles mathématiques pour l’étude de la fiabilité des systèmes. Masson et Cie, Paris.

    Google Scholar 

  • Cubeddu, C. (1976). Schema di una regolzione del traffico all’incrocio di due strade. Rend.Sem.Fac.Sci.Univ.Cagliari, 46, 295–300.

    MathSciNet  MATH  Google Scholar 

  • Cullmann, G. (1980). Les chaînes de Markov multiples. Programmation dynamique. Masson et Cie, Paris.

    Google Scholar 

  • Cvetanov, I., J. Havel, T. Naneva & M. Vosvrda (1977). Stochastic model of supplying systems and their applications. Ekonom.-mat.Obzor, 13, 268–278 (Russian).

    Google Scholar 

  • Daduna, H. (1982). Passage times for overtake-free paths in Gordon-Newell networks. Adv.Appl.Probab., 14, 672–686.

    Article  MathSciNet  MATH  Google Scholar 

  • Dal, C.M. (1978). Self-diagnosis of interactive systems. Lect.Notes Biomath., 21, 229–244.

    Article  Google Scholar 

  • Dal, C.M. (1979). Fehlertolerante Systeme. Modelle der Zuverlaessigkeit, Verfuegbarkeit, Diagnose und Erneuerung. Leitfaden Ang. Math.Mech.LAMM, 50, Teubner-Stuttgart.

    Google Scholar 

  • Danielyan, Eh.A. & A.K. Pogosyan (1980). On two-sided estimations of the probability of a rare event in a special regenerative process. Uch.Zap.Erevan.Gos.Univ., Estestv.Nauki, 1 (143), 134–136 (Russian).

    Google Scholar 

  • Davidovich, Y.S. & V.M. Shurenkov (1974). Corrections of homogeneous Markovian processes. Teor.Verojatnost.mat.Statist.Sbornik, 10, 56–68 (Russian).

    Google Scholar 

  • Dayan, J. & D. Rappaport (1975). On convergence of spatially inhomogeneous multiphase transport systems. SIAM J.Appl.Math., 29, 12–19.

    Article  MathSciNet  MATH  Google Scholar 

  • Deb, R.K. (1976). Optimal control of batch service queues with switching costs. Adv.Appl.Probab., 8, 177–194.

    Article  MathSciNet  MATH  Google Scholar 

  • Debabrata, R. (see M.Agarwal).

    Google Scholar 

  • Degtyarev, E.K. & E.K. Kurako (1980). Investigation of the distribution of the operative memory of a computer with the aid of semi-Markov processes. Izvestija Akad.Nauk SSSR, Tekn.Kibern., 3, 73–79 (Russian).

    MathSciNet  Google Scholar 

  • Dekker, R. & A. Hordijk (1983). Denumerable Markov decision chains: sensitive optimality criteria. Proc.11th Annual Meeting Oper. Res., Frankfurt, 453-460.

    Google Scholar 

  • DeLisi, C. (see W.A. Beyer).

    Google Scholar 

  • Deshmukh, S.D. (see S.D. Chikte).

    Google Scholar 

  • Deshmukh, S.D. & W. Winston (1977). A controlled birth and death process model of optimal product pricing under stochastically changing demand. J.Appl.Probab., 14, 328–339.

    Article  MathSciNet  MATH  Google Scholar 

  • D’Esposito, M.R. (see M. Carravetta).

    Google Scholar 

  • Deul, N. (1980). Stationarity conditions for multi-server queueing systems with repeated calls. Elektron.Informationsverarbeitung Kybernetik, 16, 607–613.

    MathSciNet  MATH  Google Scholar 

  • Diekmann, A. (1979). A dynamic stochastic version of the Pitcher-Hamblin-Miller model of collective violence. J.Math.Sociology, 6, 277–282.

    Article  MATH  Google Scholar 

  • Dikarev, V.E. & N.A. Shishonok (1976). On the interval distribution of a class of Markov processes. Theory Probab.Math.Stat., 10, 69–72.

    Google Scholar 

  • Dimitrov, B.N. (1972). Sequences of renewal processes and random sums. Vycislit.Metody Programm., 18, 3–15 (Russian).

    Google Scholar 

  • Dimitrov, B.N. (1972). On uniform renewal theory. Vycislit.Metody Programm., 18, 24–30 (Russian).

    Google Scholar 

  • Dinse, G.E. & S.W. Lagakos (1980). The analysis of partially-censored data from a first-order semi-Markov model. J.Stat.Comput. Simulation, 11, 209–222.

    Article  MATH  Google Scholar 

  • Dirickx, Y.M.I. & M.R. Rao (1974). Networks with gains in discrete dynamic programming. Management Sci., Theory, 20, 1428–1431.

    Article  MathSciNet  MATH  Google Scholar 

  • Dirickx, Y.M.I. & D. Koevoets (1977). A continuous review inventory model with compound Poisson demand process and stochastic lead time. Naval Res.Logist.Quart., 24, 577–585.

    Article  MathSciNet  MATH  Google Scholar 

  • Disney, R.L. (see W.P. Cherry).

    Google Scholar 

  • Disney, R.L., D.C. McNicke & B. Simon (1980). The M/G/1 queue with instantaneous Bernoulli feedback. Naval Res.Logist.Q., 27, 635–644.

    Article  MATH  Google Scholar 

  • Dobrushin, R.L. & V.V. Prelov (1979). Asymptotic approach to the investigation of message switching networks of linear structure with a large number of centers. Probl.Inf.Transm., 15, 46–55.

    MathSciNet  MATH  Google Scholar 

  • Dobrushin, R.L. & Y.M. Sukhov (1976). Asymptotic analysis of a star-like network with large number of radial rays and message switching. Probl.Peredaci Inform., 12, 70–94 (Russian).

    MATH  Google Scholar 

  • Doi, M. & H. Osawa (1978). A variation of the GI/M/1 queue utilizing idle time. Rep.Stat.Appl.Res.Union Jap.Sci.Eng., 25, 111–120.

    MathSciNet  Google Scholar 

  • Domanovskaya, E.F. (1976). Stay time of a semi-Markov process in fixed state. Control, reliability and navigation. Interuniv. Collect.Sci.Works, Saransk, 3, 92–94 (Russian).

    Google Scholar 

  • Domanovskij, G.A. (1976). Total stay time of a semi-Markov process in a fixed set of states. Control, reliability and navigation. Interuniv.Collect.Sci.Works, Saransk, 3, 116–122 (Russian).

    Google Scholar 

  • Dominicis (de), R. (see M.Carravetta).

    Google Scholar 

  • Dominicis (de), R. (1979). Discrete-time non-homogeneous semi-Markov processes. Aerotec.Missili Spazio, 58, 111–113.

    MATH  Google Scholar 

  • Dominicis (de), R. (1979). Processi stocastici semi-Markoviani non-omogenei conservativi. Riv.Mat.Sci.Econ.Soc., 2, 157–167.

    MATH  Google Scholar 

  • Dominicis (de), R. (1980). Estimation of waiting average times and asymptotic behaviour of the semi-Markov process corresponding to a Markov renewal process. Statistica, 40, 467–475.

    MathSciNet  MATH  Google Scholar 

  • Dominicis (de), R. (1983). Spectral analysis of non linear semi-Markov processes. Proc.NATO ASI C, Math.Phys.Sci., 104, 407–415.

    Google Scholar 

  • Doshi, B.T. (1979). Generalized semi-Markov decision processes. J.Appl.Probab., 16, 618–630.

    Article  MathSciNet  MATH  Google Scholar 

  • Downs, T. (1977). An explicit form for system mean life. IEEE Trans. Reliab.R-26, 138-140.

    Google Scholar 

  • Dragut, M. (1981). Non-discounted semi-Markov decision processes with incomplete state information. Proc.6th Conf.Probab.Theory, Brasov, 403-411.

    Google Scholar 

  • Dubois, D. & J.P. Forestier (1982). Productivité et en-cours moyens d’un ensemble de deux machines séparées par une zone de stockage. RAIRO, Autom.Syst.Anal.Control, 16, 105–132.

    MATH  Google Scholar 

  • D’Souza, C.A. & M.N. Gopalan (1975). Probabilistic analysis of a two-unit system with a single service facility for preventive maintenance and repair. Operations Res., 23, 173–177.

    Article  MathSciNet  MATH  Google Scholar 

  • Duma, I. (1980). Modèles semi-Markoviens pour les canaux numériques. An.Univ.Bucur., Mat., 29, 37–45.

    MathSciNet  MATH  Google Scholar 

  • Duyn Schouten (van der), F.A. (1983). Markov decision processes with continuous time parameter. Mathematical Centre Tracts, 164, Amsterdam.

    Google Scholar 

  • Dzirkal, E.V. & A.E. Shura-Bura (1980). Calculation of the reliability of a redundant group with unreliable switching and incomplete monitoring. Eng.Cybern., 18, 84–90.

    MATH  Google Scholar 

  • Edwards, J.S. & R.W. Morgan (1982). Optimal control models in manpower planning. North-Holland Syst.Contr.Ser., 4, 143–176.

    Google Scholar 

  • El-Affendi, M.A. & D.D. Kouvatsos (1983). A maximum entropy analysis of the M/G/1 and G/M/1 queueing systems at equilibrium. Acta Inf., 19, 339–355.

    Article  MathSciNet  MATH  Google Scholar 

  • Elejko, Y.I. (1979). Ergodic theorems for semi-Markov processes with an arbitrary phase space. Stoch.Process.Prob1.Math.Phys., Collect.Sci.Works, Kiev, 73-93 (Russian).

    Google Scholar 

  • Elejko, Y.I. (1980). Transients in the theory of multi-dimensional renewal with discrete time. Probab.Meth.of Infinite dimens. analysis, Collect.Sci.Works, Kiev, 47-60 (Russian).

    Google Scholar 

  • Elejko, Y.I. (1981). Limit distributions for a semi-Markov process with arbitrary phase space. Theory Probab.Math.Stat., 23, 55–61.

    Google Scholar 

  • Elejko, Y.I. (1981). Limit theorems for additive functionals defined on a semi-Markov process with an arbitrary phase space. Probabilistic infinite dimensional analysis, Collect.Sci.Works, Kiev, 44-50 (Russian).

    Google Scholar 

  • Elejko, Y.I. & V.M. Shurenkov (1980). Limit distributions of time averages for a semi-Markov process with finite number of states. Ukr.Math.J., 31, 475–479.

    Article  MATH  Google Scholar 

  • Ewers, T. & V. Nollau (1976, 1977). Zur Steuerung halb-Markovscher Prozesse und ihrer Anwendung bei der Ermittlung optimaler Bedienungsstrategien in einem Mehrmaschinensystem. II, III; Wiss.Z.techn. Univ.Dresden, 25, 787–790; 26, 109-113.

    MathSciNet  Google Scholar 

  • Ezov, I.I. (see G.L. Arsenisvili, V.N. Bandura & O.P. Borozdin).

    Google Scholar 

  • Ezov, I.I. & V.F. Kadankov (1981). The system M//p(**r)|1| in employment conditions. Analytical Meth.Probab.Theory, Collect.Sci. Works, Kiev, 75-83 (Russian).

    Google Scholar 

  • Ezov, I.I. & H. Sum (1977). Maximization processes with discrete time. Theory Probab.Math.Stat., 9, 87–94.

    Google Scholar 

  • Ezov, I.I. & O.M. Zaharin (1977). On one semi-Markov system with profits. Dopovidi Akad.Nauk Ukrain.R R, Ser.A, 1120-1122 (Ukrainian).

    Google Scholar 

  • Ezov, I.I. & O.M. Zaharin (1978). The time of stay of a complex randomized semi-Markov process in a fixed subset of states. Dopovidi Akad.Nauk Ukrain.RSR, Ser.A, 344-347 (Ukrainian).

    Google Scholar 

  • Ezov, I.I., I.Z. Gabrovski & O.M. Zaharin (1977). On a generalization of semi-Markov processes. Theory Probab.Math.Stat., 9, 49–62.

    Google Scholar 

  • Fajnberg, E.A. (1982). Non-randomized Markov and semi-Markov strategies in dynamic programming. Theory Probab.Appl., 27, 116–126.

    Article  MATH  Google Scholar 

  • Falin, G.I. (1982). State consolidation in symmetrical partially accessible circuits. Probl.Control Inf.Theory, 11, 3–12 (Russian).

    MathSciNet  Google Scholar 

  • Faure, R. & J.L. Lauriere (1974). Fiabilité et renouvellement des équipements. Applications élémentaires aux investissements. Coll.Programmation.Rech.Opér.Appl., 4, Gauthier-Villars, Paris.

    Google Scholar 

  • Federgruen, A. & P.J. Schweitzer (1978). Discounted and undiscounted value-iteration in Markov decision problems: a survey. Proc. Int.Conf.Dynamic Progr.Appl., Vancouver, 23-52.

    Google Scholar 

  • Federgruen, A. & P.J. Schweitzer (1978). The functional equations of undiscounted Markov renewal programming. Math.Oper.Res., 3, 308–321.

    Article  MathSciNet  MATH  Google Scholar 

  • Federgruen, A. & P.J. Schweitzer (1978). Foolproof convergence in multichain policy iteration. J.Math.Analysis Appl., 64, 360–368.

    Article  MathSciNet  MATH  Google Scholar 

  • Federgruen, A. & P.J. Schweitzer (1977). Geometric convergence of value-iteration in multichain Markov renewal programming. Amsterdam Mathematisch Centrum, BW 80/77, 37 p.

    Google Scholar 

  • Federgruen, A. & D. Spreen (1980). A new specification of the multichain policy iteration algorithm in undiscounted Markov renewal programs. Manage.Sci., 26, 1211–1217.

    Article  MathSciNet  MATH  Google Scholar 

  • Federgruen, A. & H.C. Tijms (1978). The optimality equation in average cost denumerable state semi-Markov decision problems, recurrence conditions and algorithms. J.Appl.Probab., 15, 356–373.

    Article  MathSciNet  MATH  Google Scholar 

  • Federgruen, A., G. de Leve & H.C. Tijms (1977). A general Markov decision method. I: Model and techniques; II: Applications. Adv.Appl.Probab., 9, 296–315 & 316-335.

    Article  MATH  Google Scholar 

  • Federgruen, A., A. Hordijk & H.C. Tijms (1977). A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices. Amsterdam Mathematisch Centrum, BW 85/77, 7 p.

    Google Scholar 

  • Federgruen, A., A. Hordijk & H.C. Tijms (1978). Recurrence conditions in denumerable state Markov decision processes. Proc.Int.Conf. Dynamic Progr.Appl., Vancouver, 3-22.

    Google Scholar 

  • Federgruen, A., A. Hordijk & H.C. Tijms (1979). Denumerable state semi-Markov decision processes with unbounded costs, average cost criterion. Stochastic Processes Appl., 9, 223–235.

    Article  MathSciNet  MATH  Google Scholar 

  • Federgruen, A., P.J. Schweitzer & H.C. Tijms (1977). Value-iteration in undiscounted Markov decision problems. II: geometric convergence; III: algorithms. Proc.Semin.Markov Decis.th., Amsterdam, 141-151 & 153-159.

    Google Scholar 

  • Federgruen, A., P.J. Schweitzer & H.C. Tijms (1978). Contraction mappings underlying undiscounted Markov decision problems. J.Math.Analysis Appl., 65, 711–730.

    Article  MathSciNet  MATH  Google Scholar 

  • Federgruen, A., P.J. Schweitzar & H.C. Tijms (1983). Denumerable undiscounted semi-Markov decision processes with unbounded rewards. Math.Oper.Res., 8, 298–313.

    Article  MathSciNet  MATH  Google Scholar 

  • Feldman, R.M. (1976). Optimal replacement with semi-Markov shock models. J.Appl.Probab., 13, 108–117.

    Article  MATH  Google Scholar 

  • Feldman, R.M. (1977). Optimal replacement with semi-Markov shock models using discounted costs. Math.Oper.Res., 2, 78–90.

    Article  MathSciNet  MATH  Google Scholar 

  • Feldman, R.M. (1978). A continuous review (s, S) inventory system in a random environment. J.Appl.Probab., 15, 654–659.

    Article  MathSciNet  MATH  Google Scholar 

  • Feldman, R.M. & C. Whittaker (1980). Moments for a general branching process in a semi-Markovian environment. J.Appl.Probab., 17, 341–349.

    Article  MathSciNet  MATH  Google Scholar 

  • Fetisov, V.N. (1979). A Markov approximation of a random sequence in optimal control problems. Eng.Cybern., 17, 31–37.

    MATH  Google Scholar 

  • Fix, W. & K. Neumann (1979). Project scheduling by special GERT networks. Computing, 23, 299–308.

    Article  MATH  Google Scholar 

  • Fleischmann, K. & U. Prehn (1978). Limit theorems for spatially homogeneous branching processes with a finite set of types.II. Math.Nachr., 82, 277–296.

    Article  MathSciNet  Google Scholar 

  • Forestier, J.P. (see D.Dubois).

    Google Scholar 

  • Forestier, J.P. (1978). Optimisation de la commande des systèmes à représentation semi-markovienne. Math.Appl., 1er Colloq.AFCET SMF, Palaiseau, I, 337-346.

    Google Scholar 

  • Fortet, R. (1977). Panels et modèles de comportements. Publ.économétr., 10, 1–39.

    MathSciNet  Google Scholar 

  • Foschini, G.J. (1982). Equilibria for diffusion models of pairs of communicating computers-symmetric case. IEEE Trans.Inf.Theory IT-28, 273-284.

    Google Scholar 

  • Foster, F.G. & H.G. Perros (1979). Hierarchical queue networks with partially shared servicing. J.Oper.Res.Soc., 30, 157–166.

    MATH  Google Scholar 

  • Franken, P. (see K.Arndt).

    Google Scholar 

  • Franken, P. (1082). The point process approach to queueing theory and related topics. Seminarber., HumboIdt-Univ.Berlin, Sekt. Math., 43, 72 p.

    Google Scholar 

  • Franken, P. & A. Streller (1979). Stationary generalized regenerative processes. Theory Probab.Appl., 24, 79–90.

    Article  MathSciNet  MATH  Google Scholar 

  • Friedman, A.D. (see M.A. Breuer).

    Google Scholar 

  • Fries, P. (1980). Procedure for weighting failure rates in Markov reliability models for automatic systems. Siemens Forsch. Entwicklungsber., 9, 305–311.

    MathSciNet  MATH  Google Scholar 

  • Furukawa, N. (1980). Nearly optimal policies and stopping times in Markov decision processes with general rewards. Bull.Math. Stat., 19, 89–109.

    MathSciNet  MATH  Google Scholar 

  • Furukawa, N. (1982). Recurrence set-relations in stochastic multi-objective dynamic decision processes. Math.Operationsforsch. Stat., Ser.Optimization 13, 113–121.

    Article  MathSciNet  MATH  Google Scholar 

  • Furukawa, N. & S. Iwamoto (1974). Correction to “Markovian decision processes with recursive reward functions”. Bull.Math.Statist., 16, 127.

    MATH  Google Scholar 

  • Gabrovsky, I.Z. (see I.I. Ezov).

    Google Scholar 

  • Gadasin, V.A. (1975). Probabilistic properties of a system with a symmetric radial-ring structure. Automat.Remote Control, 35, 1503–1509.

    MathSciNet  Google Scholar 

  • Gaede, K.W. (1974). Sensitivitaetsanalyse fuer einen semi-Markov Prozess. Z.Operat.Res., Ser.A 18, 197–204.

    MathSciNet  MATH  Google Scholar 

  • Gaede, K.W. (1977). Zuverlaessigkeit, mathematische Modelle. Theorie und Praxis des Operations Research. Carl Hanser Verlag, Munchen.

    Google Scholar 

  • Gaede, K.W. (1977). Einiges zur Sensitivitaet stochastischer 0R-Modelle. Quant.Wirtsch.Forsch., W.Krelle zum 60.Geb., 237-244.

    Google Scholar 

  • Gaede, K.W. (1983). Verallgemeinerte Kontrollgrenzen bei Erzatzproblemen. Operations Research. Proc.11th Annual Meet., Frankfurt, 433-438.

    Google Scholar 

  • Gail, M.H. (see C.C. Brown).

    Google Scholar 

  • Gallisch, E. (1979). On monotone optimal policies in a queueing model of M/G/1 type with controllable service time distribution. Adv.Appl.Probab., 11, 870–887.

    Article  MathSciNet  MATH  Google Scholar 

  • Gamkrelidze, R.V. (ed.) (1974). Probability Theory. Mathematical Statistics. Theoretical Cybernetics. Band 11. “VINITI” Moskva (Russian).

    Google Scholar 

  • Gardos, E. & T. Toeroek (1980). Population processes and computer networks. Alkalmazott Mat.Lapok, 6, 291–311 (Hungarian).

    MATH  Google Scholar 

  • Garifullin, Z.G. & V.A. Ivnitskij (1977). On stationary distribution of state probabilities for a generalized scheme of birth and death with a symmetrical graph of transitions. Kibernetika, Kiev, 4, 92-96 (Russian).

    Google Scholar 

  • Gasanenko, V.A. (1981). On thinning a semi-Markov process with a countable set of states. Theory Probab.Math.Stat., 22, 25–29.

    MathSciNet  MATH  Google Scholar 

  • Gatarek, D. (1982). On a reliability problem by stochastic control problems. Syst.Control Lett., 2, 248–254.

    Article  MathSciNet  MATH  Google Scholar 

  • Gavish, B. & P.J. Schweitzer (1976). An optimality principle for Markovian decision processes. J.Math.Analysis, 54, 173–184.

    Article  MathSciNet  MATH  Google Scholar 

  • Gazis, D.C. (ed). (1974). Traffic Science. Wiley Interscience Publication, Wiley & Sons.

    Google Scholar 

  • Gelenbe, E. (1979). Probabilistic models of computer systems. II: Diffusion approximation, waiting times and batch arrivals. Acta Inf., 12, 283–303.

    MathSciNet  MATH  Google Scholar 

  • Gelenbe, E & I. Mitrani (1980). Analysis and synthesis of computer systems. Academic Press, London.

    MATH  Google Scholar 

  • Gelenbe, E. & G. Pujolle (1976). The behaviour of a single queue in a general queueing network. Acta Informatica, 7, 123–136.

    Article  MathSciNet  MATH  Google Scholar 

  • Geninson, B.A., A.A. Rubchinshij & T.M. Vinogradskaya (1984). Semi-Markov decision making processes with vector gains. Theory Probab.Appl., 28, 191–193.

    Article  MATH  Google Scholar 

  • Genis, Y.G. (1978). The asymptotic behaviour of a flow of rare events in a regenerating process. Eng.Cybern., 16, 77–84.

    MATH  Google Scholar 

  • Genis, Y.G. (1979). Stochastic system behaviour described by semi-renewal process. Autom.Remote Control, 40, 668–681.

    MATH  Google Scholar 

  • Genis, Y.G. & B.Y. Nechaev (1976). Behaviour of a complex system described by a semi-Markov process with a finite number of states. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 76-84 (Russian).

    Google Scholar 

  • Georganas, N.D. (see A. Chatterjee).

    Google Scholar 

  • Gergely, T. & T.L. Toeroek (1976). A stochastic process to describe the virtual waiting time in a discrete-time queueing system. Prog.Oper.Res., Eger 1974, Colloq.Math.Soc.Janos Bolyai, 12, 417–423.

    Google Scholar 

  • Gerrard, R. (1983). Regularity conditions for semi-Markov and Markov chains in continuous time. J.Appl.Probab., 20, 505–512.

    Article  MathSciNet  MATH  Google Scholar 

  • Gersht, A.M. (1978). Analysis of certain low-traffic queueing systems. Autom.Remote Control, 39, 491–499.

    MATH  Google Scholar 

  • Gershwin, S.B. & I.C. Schick (1979). Analytic methods for calculating performance measures of production lines with buffer storages. Proc.IEEE Conf.Decision & Control, San Diego, 618-624.

    Google Scholar 

  • Gertsbach, I. (1976). Sufficient optimality conditions for control-limit policy in a semi-Markov process. J.Appl.Probab., 13, 400–406.

    Article  MathSciNet  MATH  Google Scholar 

  • Gestri, G. H.A.K. Mastebroek & W.H. Zaagman (1980). Stochastic constancy, variability and adaptation of spike generation: performance of a giant neuron in the visual system of the fly. Biol.Cybern., 38, 31–40.

    Article  MATH  Google Scholar 

  • Gheorghe, A.V. (1976). On risk-sensitive Markovian decision models for complex systems maintenance. Econom.Comput.econom.Cybernetics Studies Res., 31-46.

    Google Scholar 

  • Gheorghe, A.V. (1977). Partially observable Markov processes with a risk-sensitive decision-maker. Revue Roumaine Math.Pur.Appl., 22, 461–482.

    MathSciNet  MATH  Google Scholar 

  • Gheorghe, A.V. (1979). Systems engineering. Models and computational techniques. Editura Academiei Republicii Socialiste Romania.

    Google Scholar 

  • Gheorghe, A.V. (1979). Markovian models with logical conditions for fault isolation with insufficient observations. Revue Roumaine Math.Pur.Appl., 24, 1047–1064.

    MathSciNet  Google Scholar 

  • Gheorghe, A.V. (1979). On maintenance policies for multifunctional systems using semi-Markov decision models. Revue Roum.Math. Pur.Appl., 24, 1337–1353.

    MathSciNet  MATH  Google Scholar 

  • Gheorghe, A.V. (1980). Reliability prediction of systems with semi-Markov structure. Revue Roum.Math.Pur.App1., 25, 1225–1241.

    MathSciNet  MATH  Google Scholar 

  • Ghosal, A. (see J.Affisoo).

    Google Scholar 

  • Gilbert, G. (1973). Semi-Markov processes and mobility; a note. J.Math.Sociology, 3, 139–145.

    Article  MATH  Google Scholar 

  • Gill, R.D. (1980). Nonparametric estimation based on censored observations of a Markov renewal process. Z.Wahrscheinlichkeitstheor.Verw.Geb., 53, 97–116.

    Article  MATH  Google Scholar 

  • Gillert, H. (1976). Maximum-likelihood-Schaetzungen fuer Parameter in semimarkovschen Prozessen. Wiss.Z.Tech.Univ.Dres., 25, 1163–1166.

    MathSciNet  MATH  Google Scholar 

  • Giorgadze, A.H. & Eh.I. Kistauri (1977). Parallel decomposition of Markov processes. Tr.Inst.Kibern., 1, 196–206.

    Google Scholar 

  • Gittins, J.C. (1982). Forwards induction and dynamic allocation indices. Proc.NATO ASI Deterministic & Stochastic Scheduling, 125-156.

    Google Scholar 

  • Girmes, D.H. & M.F. Ramalhoto (1977). Markov-renewal approach to counter theory. Proc.Eur.Meet.Stat.Grenoble, 581-590.

    Google Scholar 

  • Glaz, J. (1981). Clustering of events in a stochastic process. J.Appl.Probab., 18, 268–275.

    Article  MathSciNet  MATH  Google Scholar 

  • Glazebrook, K.D. (1976). Stochastic scheduling with order constraints. Int.J.Systerns Sci., 7, 657–666.

    Article  MathSciNet  MATH  Google Scholar 

  • Glazebrook, K.D. (1978). On a class of non-Markov decision processes. J.Appl.Probab., 15, 689–698.

    Article  MathSciNet  MATH  Google Scholar 

  • Gnedenko, B.V. & D. Koenig (ed) (1983). Handbuch der Bedienungstheorie I: Grundlagen und Methoden. Akademie-Verlag, Berlin.

    MATH  Google Scholar 

  • Gnedenko, B.V. & A.D. Soloviev (1974). A general allocation problem with repair. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 113-118 (Russian).

    Google Scholar 

  • Goel, A.L., T. Nakagawa & S. Osaki (1975). Stochastic behaviour of an intermittently used system. Revue Franc.Automat.Inform.Rech. Opérat., 9, 101–112.

    MathSciNet  MATH  Google Scholar 

  • Gondran, M. & A. Pages (1980). Fiabilité des systèmes. Editions Eyrolles, Paris.

    Google Scholar 

  • Goodman, I.R. & S. Kotz (1981). Hazard rates based on isoprobability contours. Proc.NATO ASI Statistical Distributions in Sc.Work, 5, 289–309.

    Article  MathSciNet  Google Scholar 

  • Gopalan, M.N. (see C.A. D’Souza).

    Google Scholar 

  • Grandori Guagenti, E. (1980). Stochastic processes in the modelling of earthquake occurrence. Proc.Conf.Numer.Tech.Stoch.Systems, Gargnano, 205-216.

    Google Scholar 

  • Grandori Guagenti, E. & C. Molina (1982). Dynamic semi-Markov systems in earthquake engineering. Rend.Semin.Mat.Torino, 119-133.

    Google Scholar 

  • Grassmann, W. (1977). Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions. Eur.J.Oper.Res., 1, 396–402.

    MathSciNet  MATH  Google Scholar 

  • Grassman, W. (1981). Stochastic systems for management. North-Holland, New-York.

    Google Scholar 

  • Graves, S.C. & J. Keilson (1981). The compensation method applied to a one-product production/inventory problem. Math.Oper.Res., 6, 246–262.

    Article  MathSciNet  MATH  Google Scholar 

  • Grigg, C.H. (see R.N. Allan).

    Google Scholar 

  • Grinold, R.C. (1976). Manpower planning with uncertain requirements. Operations Res., 24, 387–399.

    Article  MATH  Google Scholar 

  • Grinshpan, L.A. (19). Analysis of the stationary regimes of semi-Markov processes by the method of fictitious states.

    Google Scholar 

  • Groenewegen, L.P.J. & K.Van Hee (1977). Markov decision processes and quasi-martingales. Proc.Eur.Meet.Stat.Grenoble, 453-459.

    Google Scholar 

  • Grouchko, D. (see R. Cruon).

    Google Scholar 

  • Gruver, W.A. & C.F. Klein (1981). Optimal control of Markovian queueing systems. Optim.Control Appl.Methods, 2, 23–34.

    MathSciNet  MATH  Google Scholar 

  • Gubenko, L.G. (1974). Optimal control of a monotone Markov process. Kibernetika, Kiev, 1, 104-106 (Russian).

    Google Scholar 

  • Gupta, A. (1981). Markovian approach to determine optimal maintenance policies for production systems. Indian J.Technol., 19, 353–356.

    MATH  Google Scholar 

  • Gupta, S.K. & J.K. Sengupta (1975). Application of reliability programming to production planning. Intern.J.Systems Sci., 6, 633–644.

    Article  MATH  Google Scholar 

  • Gupta, S. & Y.P. Gupta (1978). Chi-square goodness of fit test for equilibrium Markov renewal process. Metron, 36, 187–196.

    MathSciNet  MATH  Google Scholar 

  • Gupta, Y.P. (see S. Gupta).

    Google Scholar 

  • Gupta, Y.P. (1983). Counting processes within Markov renewal processes. S.Afr.Stat.J., 17, 107–119.

    MATH  Google Scholar 

  • Gupta, Y.P. & S.C. Sharma (1976). Some results in Markov renewal processes. Metron, 34, 81–92.

    MathSciNet  MATH  Google Scholar 

  • Gusak, D.V. & V.S. Korolyuk (1976). The asymptotic behaviour of semi-Markov processes with a decomposable set of states. Theor. Probab.Math.Statist., 5, 43–51.

    Google Scholar 

  • Habel, I. (1980). Ueber einen speziellen stationaeren diskreten Markovschen Entscheidungsprozess mit Fehlerbetrachtung zum H-Algorithmus. Wiss.Z.Tech.Hoch-sch.Leipz., 4, 303–307.

    MATH  Google Scholar 

  • Hannan, E. M.P. Mirabile & J. Schmee (1979). An examination of patient referral and discharge policies using a multiple objective semi-Markov decision process. J.Oper.Res.Soc., 30, 121–129.

    Article  MATH  Google Scholar 

  • Harlamov, B.P. (1976). A “correct exit” property and a limit theorem for the semi-Markov processes. Zap.Naucn.Semin.Leningr.Otd. Mat.Inst.Steklov, 72, 186–201 (Russian).

    MathSciNet  Google Scholar 

  • Harlamov, B.P. (1977). On convergence of semi-Markov walks to a continuous semi-Markov process. Theory Probab.Appl., 21, 482–498.

    Article  Google Scholar 

  • Harlamov, B.P. (1978). The set of regeneration times of random processes. J.Soviet Math., 9, 102–107.

    Article  Google Scholar 

  • Harlamov, B.P. (1978). Random processes with semi-Markov chains of hitting times. J.Soviet Math., 9, 107–128.

    Article  Google Scholar 

  • Harlamov, B.P. (1980). A criterion for the Markov property for continuous semi-Markov processes. Teor.Verojatn, Primen., 25, 535–548.

    MathSciNet  Google Scholar 

  • Harlamov, B.P. (1980). Additive functionals and a change of time which preserves the semi-Markov property of a process. Zap. Nauchn.Semin.Leningr.Otd.Mat.Inst.Steklov, 97, 203–216 (Russian).

    Google Scholar 

  • Harlamov, B.P. (1981). A Markov property test for semi-Markov processes. Theory Probab.Appl., 25, 526–539.

    Article  Google Scholar 

  • Harlamov, B.P. (1982). Outleading sequences and continuous semi-Markov processes on the line. Zap.Nauchn.Semin.Leningr.Otd. Mat.Inst.Steklov, 119, 230–236 (Russian).

    Google Scholar 

  • Harlamov, B.P. (1983). Property of “correct exit” and one limit theorem for semi-Markov processes. J.Soviet Math., 23, 2352–2362.

    Article  Google Scholar 

  • Harrison, P.G. (1981). Transient behaviour of queueing networks. J.Appl.Probab., 18, 482–490.

    Article  MathSciNet  MATH  Google Scholar 

  • Harrison, J.M. & A.J. Lemoine (1981). A note on networks of infinite-server queues. J.Appl.Probab., 18, 561–567.

    Article  MathSciNet  MATH  Google Scholar 

  • Harrison, J.M. & M.I. Reiman (1981). Reflected Brownian motion on an orthant. Ann.Probab., 9, 302–308.

    Article  MathSciNet  MATH  Google Scholar 

  • Harrison, J.M. & M.I. Reiman (1981). On the distribution of multidimensional reflected Brownian motion. SIAM J.Appl.Math., 41, 345–361.

    Article  MathSciNet  MATH  Google Scholar 

  • Harrison, J.M. & S.I. Resnick (1978). The recurrence classification of risk and storage processes. Math.Oper.Res., 3, 57–66.

    Article  MathSciNet  MATH  Google Scholar 

  • Hastings, N.A.J. & J.M.C. Mello (1978). Decision networks. John Wiley & Sons.

    Google Scholar 

  • Hatoyama, Y. (1977). Markov maintenance models with control of queue. J.Operations Res.Soc.Japan, 20, 164–181.

    MathSciNet  MATH  Google Scholar 

  • Haurie, A. (see A. Alj, F. Chauny & D. Collart).

    Google Scholar 

  • Haurie, A. (1982). A note on “Multilayer control of large Markov chains”. IEEE Trans.Autom.Control AC-27, 746-747.

    Google Scholar 

  • Haussmann, W. (see R. Avenhaus).

    Google Scholar 

  • Have1, J. (see I.Cventanov).

    Google Scholar 

  • Hawkes, J. (1977). Intersections of Markov random sets. Z.Wahrscheinlichkeitstheorie Verw. Geb., 37, 243–251.

    Article  MathSciNet  MATH  Google Scholar 

  • Hayne, W.J. & K.T. Marshall (1977). Two-characteristic Markov-type manpower flow models. Navals Res.Logist.Q., 24, 235–255.

    Article  MathSciNet  MATH  Google Scholar 

  • Hayre, L.S. (1983). A note on optimal maintenance policies for deciding whether to repair or replace. Eur.J.Oper.Res., 12, 171–175.

    Article  MATH  Google Scholar 

  • Hee (Van), K. (see L.P.J. Groenenwegen).

    Google Scholar 

  • Heffes, H. (1982). Moment formulae for a class of mixed multi-job-type queueing networks. Bell.Syst.Tech.J., 61, 709–745.

    MATH  Google Scholar 

  • Heidelberger, P. (1980). Variance reduction techniques for the simulation of Markov processes. I. Multiple estimates. IBM J. Res.Dev., 24, 570–581.

    Article  MathSciNet  MATH  Google Scholar 

  • Heidelberger, P. & D.L. Iglehart (1979). Comparing stochastic systems using regenerative simulation with common random numbers. Adv. Appl.Probab., 11, 804–819.

    Article  MathSciNet  MATH  Google Scholar 

  • Heidelberger, P. & M.S. Meketon (1982). A renewal theoretic approach to bias reduction in regenerative simulations. Manage.Sci., 28, 173–181.

    Article  MathSciNet  MATH  Google Scholar 

  • Helary, J.M. & R. Pedrono (1983). Recherche opérationnelle. Travaux dirigés. Modèles stochastiques: chaînes de Markov, files d’attente. Réseaux de files d’attente. Hermann, Paris.

    Google Scholar 

  • Heiland, I.S. (1981). Convergence to diffusions with regular boundaries. Stochastic Processes Appl., 12, 27–58.

    Article  Google Scholar 

  • Hellwig, M.F. (1980). Stochastic processes of temporary equilibria. J.Math.Econ., 7, 287–299.

    Article  MathSciNet  MATH  Google Scholar 

  • Helm, W.E. & R. Schassberger (1982). Insensitive generalized semi-Markov schemes with point process input. Math.Oper.Res., 7, 129–138.

    Article  MathSciNet  MATH  Google Scholar 

  • Henderson, W. (1983). Non-standard insensitivity. J.Appl.Probab., 20, 288–296.

    Article  MathSciNet  MATH  Google Scholar 

  • Hennion, H. (1982). Transience de certaines chaînes semi-Markoviennes. Ann.Inst.Henri Poincaré, Nouv.Sér., Sect.B, 18, 277–291.

    MathSciNet  MATH  Google Scholar 

  • Hershey, J.C. (see M.A. Cohen).

    Google Scholar 

  • Hillier, F.S. (see R.W. Boling).

    Google Scholar 

  • Hinderer, K. (1975). Neuere Resultate in der stochastischen dynamischen Optimierung. Z.Angew.Math.Mech., 55, Sonderheft, T16-T26.

    Google Scholar 

  • Hines, W.G.S. (1976). Improving a simple monitor of a system with sudden parameter changes. IEEE Trans.Inform.Theory IT-22, 496-499.

    Google Scholar 

  • Hipp, Ch. (1983). Asymptotic expansions in the central limit theorem for compound and regenerative processes. Statistics, Univ. Cologne, Preprint, 39 p.

    Google Scholar 

  • Hochman, H.G. (1980). Models for neural discharge which lead to Markov renewal equations for probability density. Math.Biosci., 51, 125–139.

    Article  MathSciNet  MATH  Google Scholar 

  • Hoepfinger, E. (1980). Dynamic programming of stochastic activity networks with cycles. Lect.Notes Control Inf.Sci., 23, 309–315.

    Article  Google Scholar 

  • Homma, H. & K. Tanaka (1979). Non-cooperative n-person semi-Markov game. Sci.Rep.Niigata Univ., Ser.A, 16, 23–34.

    MathSciNet  MATH  Google Scholar 

  • Hofri, M. (1978). A generating-function analysis of multiprogramming queues. Internat.J.Computer Inform.Sci., 7, 121–155.

    Article  MathSciNet  MATH  Google Scholar 

  • Ho, Y.C. (see E.M. Akif).

    Google Scholar 

  • Hordijk, A. (see R.Dekker & A.Federgruen).

    Google Scholar 

  • Hordijk, A. & L.C.M. Kallenberg (1981). Linear programming methods for solving finite Markovian decision problems. Proc.1980 Vortr.Jahrestag DGOR, Essen, 468-482.

    Google Scholar 

  • Hordijk, A. & R. Schassberger (1982). Weak convergence for generalized semi-Markov processes. Stochastic Processes Appl., 12, 271–291.

    Article  MathSciNet  MATH  Google Scholar 

  • Hordijk, A., P.J. Schweitzer & H. Tijms (1975). The asymptotic behaviour of the minimal total expected cost for the denumerable state Markov decision model. J.Appl.Probab., 12, 298–305.

    Article  MathSciNet  MATH  Google Scholar 

  • Hordijk, A., O.J. Vrieze & G.L. Wanrooij (1976). Semi-Markov strategies in stochastic games. Amsterdam Mathematisch Centrum, BW 68/76, 9 p.

    Google Scholar 

  • Hordijk, A., O.J. Vrieze & G.L. Wanrooij (1983). Semi-Markov strategies in stochastic games. Int.J.Game Theory, 12, 81–89.

    Article  MathSciNet  MATH  Google Scholar 

  • Hsieh, F.Y. (see J. Crowley).

    Google Scholar 

  • Huang, Z. (1982). Generalized renewal sequences, semi-p-functions and their F-function clusters. Acta Sci.Nat.Univ.Sunyatseni, 2, 30–38 (Chinese).

    Google Scholar 

  • Hughes, J.S. (1980). A note on quality control under Markovian deterioration. Oper.Res., 28, 421–424.

    Article  MATH  Google Scholar 

  • Hunter, J.J. (1982). Generalized inverses and their application to applied probability problems. Linear Algebra Appl., 45, 157–198.

    Article  MathSciNet  MATH  Google Scholar 

  • Hunter, J.J. (1983). Filtering of Markov renewal queues. I: Feedback; II: Birth-death queues. Adv.Appl.Probab., 15, 349–375 & 375-391.

    Article  MATH  Google Scholar 

  • Idzik, A. (1977). On Markov policies in continuous time discounted dynamic programming. Trans.7th Prague Conf.Vol.A, 265-276.

    Google Scholar 

  • Iglehart, D.L. (see Ph. Heidelberger).

    Google Scholar 

  • Iglehart, D.L. (1976). Simulating stable stochastic systems. Quantile estimation. J.Assoc.Comput.Machin., 23, 347–360.

    Article  MathSciNet  MATH  Google Scholar 

  • Iglehart, D.L. & G.S. Shedler (1979). Regenerative simulation of response times in networks of queues with multiple job types. Acta Informatica 12, 159–175.

    Article  MathSciNet  MATH  Google Scholar 

  • Iglehart, D.L. & G.S. Shedler (1981). Regenerative simulation of response times in networks of queues: statistical efficiency. Acta Informatica 15, 347–363.

    Article  MathSciNet  MATH  Google Scholar 

  • Iglehart, D.L. & G.S. Shedler (1983). Statistical efficiency of regenerative simulation methods for networks of queues. Adv. Appl.Probab., 15, 183–197.

    Article  MathSciNet  MATH  Google Scholar 

  • Iglehart, D.L. & G.S. Shedler (1983). Simulation of non-Markovian systems. IBM J.Res.Dev., 27, 472–480.

    Article  MathSciNet  MATH  Google Scholar 

  • Inaba, F.S. (1978). On stochastic entry and exit without expectations. Review Econ.Studies, 45, 535–545.

    Article  MathSciNet  MATH  Google Scholar 

  • Inagaka, T. K. Inoue, E. Sakino & I. Takami (1978). Optimal allocation of fault detectors. IEEE Trans.Reliab.R-27, 360-362.

    Google Scholar 

  • Incerti, S. (see F. Aluffi).

    Google Scholar 

  • Inoue, K. (see T. Inagaki).

    Google Scholar 

  • Isham, V. (see D.R. Cox).

    Google Scholar 

  • Ivchenko, G.I., V.A. Kashtanov & I.N. Kovalenko (1982). Theory of mass service. Moskva “Vysshaja Shkola” (Russian).

    Google Scholar 

  • Ivnitskij, V.A. (see Z.G. Garifullin).

    Google Scholar 

  • Ivnitskij, V.A. (1979). Connections between the stationary probabilities of the states of queueing systems at an arbitrary instant, the instant of placing an order, and the instant of exit of an order. Eng.Cybern., 17, 66–76.

    MATH  Google Scholar 

  • Ivnitskij, V.A. (1982). On a condition of invariance of stationary probabilities for queueing networks. Theory Probab.Appl., 27, 196–201.

    Article  MATH  Google Scholar 

  • Iwase, S., K. Tanaka & K. Wakuta (1976). On Markov games with the expected average reward criterion. Sci.Rep.Niigata Univ., Ser.A, 12, 31–41.

    MathSciNet  Google Scholar 

  • Jagers, P. (1983). On the Maltusianness of general branching processes in abstract type spaces. Probability & Mathematical Statistics, Essays in Hon.C.G. Esseen, 53-61.

    Google Scholar 

  • Jain, G.C. & M.S.H. Khan (1980). On designing the capacity of a reservoir. Biom.J., 22, 359–369.

    Article  MathSciNet  MATH  Google Scholar 

  • Jain, J.L. & S.G. Mohanty (1981). Busy period distributions for two heterogeneous queueing models involving batches. INFOR, Can. J.Oper.Res.Inf.Process. 19, 133–139.

    Google Scholar 

  • Jaiswal, N.K. & J.V. Krishna (1980). Analysis of two-unit-dissimilar standby redundant system with administrative delay in repair. Int.J.Syst.Sci., 11, 495–511.

    Article  MATH  Google Scholar 

  • Jaiswal, N.K. & K.G. Ramamurthy (1982). Some results for pseudo semi-Markov process. Math.Operationsforsch.Stat. Ser.Optimization, 13, 123–132.

    Article  MathSciNet  MATH  Google Scholar 

  • Jaiswal, N. K. Karmeshu & N.S. Rangaswamy (1982). A semi-Markovian model for cell survival after irradiation. Biom.J., 24, 63–68.

    Article  MathSciNet  MATH  Google Scholar 

  • Jannusch, E. & V. Nollau (1982). Zur Verallgemeinerung eines sukzessiven Approximationsverfahrens von Van der Wal auf semi-Markovsche Entscheidungsprozesse. Math.Operationsforsch.Stat., Ser.Optimization, 13, 299–307.

    Article  MathSciNet  MATH  Google Scholar 

  • Jansen, U. (1983). A generalization of intensivity results by cyclically marked stationary point processes. Elektron. Informationsverarbeitung Kybernetik, 19, 307–320.

    MathSciNet  MATH  Google Scholar 

  • Jansen, U. & D. Koenig (1976). Invariante stationaere Zustandswahrscheinlichkeiten fuer eine Klasse stochastischer Modelle mit funktioneilen Abhaengigkeiten. Math.Operationsforsch.Statistik, 7, 497–522.

    Article  MATH  Google Scholar 

  • Jansen, U. & D. Koenig (1980). Insensitivity and steady-state probabilities in product form for queueing networks. Elektron. Informationsverarbeitung Kybernetik, 16, 385–397.

    MATH  Google Scholar 

  • Jansen, U., D. Koenig & K. Nawrotzki (1979). A criterion of insensitivity for a class of queueing systems with random marked point processes. Math.Operationsforsch.Statistik, Ser.Optimization, 10, 379–403.

    Article  MATH  Google Scholar 

  • Jansen, U., D. Koenig, M. Kotzurek & H. Rabe (1976). Ergebnisse von Invarianzuntersuchungen fuer ausgewaehlte Bedienungs-und Zuverlaessigkeitssysteme. Math.Operationsforsch.Statistik, 7, 523–556.

    Article  MATH  Google Scholar 

  • Janssen, J. (1976). Extension of a two-sided inequality of Daley and Moran to the completely semi-Markov queueing model. Cahiers Centre Etud.Rech.Opér., 18, 459–469.

    MATH  Google Scholar 

  • Janssen, J. (1976). Some duality results in semi-Markov chain theory. Revue Roum.Math.Pur.Appl., 21, 429–441.

    MATH  Google Scholar 

  • Janssen, J. (1977). Absorption problems in semi-Markov chains. Proc. Eur.Meet.Statist., Grenoble, 481-488.

    Google Scholar 

  • Janssen, J. (1977). The semi-Markov model in risk theory. Proc.2nd Eur.Congr.Adv.Oper.Res., Stockholm, 613-621.

    Google Scholar 

  • Janssen, J. (1978). Absorption problems in two-dimensional semi-Markov chains. Bull.Soc.Math.Belg., Sér.A, 30, 123–134.

    MATH  Google Scholar 

  • Janssen, J. (1978). Some prediction problems in semi-Markov queueing models and related topic. Proc.2nd Symp.Oper.Res., Aachen, 702-712.

    Google Scholar 

  • Janssen, J. (1979). Some explicit results for semi-Markov models in risk theory and in queueing theory. Oper.Res.Verfahren, 33, 217–231.

    MATH  Google Scholar 

  • Janssen, J. (1981). Generalized risk models. Cah.Cent.Etud.Rech. Opér., 23, 225–244.

    MATH  Google Scholar 

  • Janssen, J. (1982). Modèles de risque semi-Markoviens. Cah.Cent. Etud.Rech.Oper., 24, 261–280.

    Google Scholar 

  • Janssen, J. (1982). Strong laws for semi-Markov chains with a general state space. Ric.Mat., 31, 405–414.

    MATH  Google Scholar 

  • Janssen, J. (1982). Stationary semi-Markov models in risk and queueing theories. Scand.Actuarial J., 199-210.

    Google Scholar 

  • Janssen, J. (1982). Determination de la valeur de la probabilité de ruine avec une réserve initiale nulle pour le modèle de risque semi-Markovien. Mitt.Ver.Schweiz.Versicherungsmath., 275-283.

    Google Scholar 

  • Janssen, J. (1982). Modèles de risques semi-Markoviens. Cah.Cent. Etud.Rech.Opér., 24, 261–280.

    Google Scholar 

  • Janssen, J. & J.M. Reinhard (1982). Some duality results for a class of multivariate semi-Markov processes. J.Appl.Probab., 19, 90–98.

    Article  MathSciNet  MATH  Google Scholar 

  • Jensen, U. (see K. Bosch).

    Google Scholar 

  • Jensen, U. (1981). Zustandsabhaengige Erneuerungsstrategien — Ein Modell aus der Instandhaltungstheorie. Proc.Jahrestag Oper. Res., DGOR, Essen, 251-252.

    Google Scholar 

  • Jo, K.Y. (1983). Optimal service-rate control of exponential queueing systems. J.Oper.Res.Soc.Japan, 26, 147–165.

    MathSciNet  MATH  Google Scholar 

  • Jo, K.Y. & S. Stidham jun. (1983). Optimal service-rate control of M/G/1 queueing systems using phase methods. Adv.Appl.Probab., 15, 616–637.

    Article  MathSciNet  MATH  Google Scholar 

  • Johansen, S.G. & S. Stidham jr. (1980). Control of arrivals to a stochastic input-output system. Adv.Appl.Probab., 12, 972–999.

    Article  MathSciNet  MATH  Google Scholar 

  • Jolkof, S. & V. Rykov (1981). Generalized regenerative processes with embedded regeneration periods and their application. Math. Operationsforsch.Stat., 12, 575–591.

    Article  MathSciNet  MATH  Google Scholar 

  • Kadankof, V.F. (see I.I. Ezov).

    Google Scholar 

  • Kadota, Y. (1979). Countable state Markovian decision processes under the Doeblin conditions. Bull.Math.Stat., 18, 85–94.

    MathSciNet  MATH  Google Scholar 

  • Kadyrova, I.I. (1979). Stochastic equations for jump processes. Theory Probab.Math.Stat., 18, 67–76.

    MATH  Google Scholar 

  • Kakumanu, P. (1977). Relation between continuous and discrete time Markovian decision problems. Naval Res.Logist.Q., 24, 431–439.

    Article  MathSciNet  MATH  Google Scholar 

  • Kalashnikov, V.V. (1977). Continuity of the characteristics of regenerative processes. Izvestija Akad.Nauk SSSR, tehn.Kibernet. 87-96 (Russian).

    Google Scholar 

  • Kalashnikov, V.V. (1979). Estimates of the stability of innovation processes. Eng.Cybern., 17, 63–67.

    MATH  Google Scholar 

  • Kalashnikov, V.V. & V.A. Zhilin (1979). Stability estimates of regenerating processes and their application to priority service systems. Eng.Cybern., 17, 82–89.

    MATH  Google Scholar 

  • Kallenberg, L.C.M. (see A. Hordijk).

    Google Scholar 

  • Kallenberg, L.C.M. (1983). Linear programming and finite Markovian control problems. Mathematical Centre Tracts, 148.

    Google Scholar 

  • Kalpakam, S. & M.J. Shahul Hameed (1983). Analysis of a modular warm standby redundant system. Cah.Cent.Etud.Rech.Oper., 25, 49–63.

    MATH  Google Scholar 

  • Kairo, A.H. & A. Rangan (1979). Stochastic models for stock price fluctuations. Cah.Cent.Etud.Rech.Oper., 21, 331–336.

    Google Scholar 

  • Kambo, N.S. (see H.S. Bhalaik).

    Google Scholar 

  • Kan, V.E. & L.Ya. Peses (1975). Reliability of systems with accumulation of failures under prevention. Avtomatika vycislit.tehn., Riga, 5, 43–46.

    MathSciNet  Google Scholar 

  • Kander, Z. (1978). Inspection policies for deteriorating equipment characterized by N quality levels. Naval Res.Logist.Q., 25, 243–255.

    Article  MATH  Google Scholar 

  • Kanderhag, L. (1978). Eigenvalue approach for computing the reliability of Markov systems. IEEE Trans.Reliab.R-27, 337-340.

    Google Scholar 

  • Kao, E.P.C. (1975). A discrete time inventory model with arbitrary interval and quantity distributions of demand. Operations Res., 23, 1131–1142.

    Article  MATH  Google Scholar 

  • Kapil, D.V.S. & S.M.Sinha (1981). Repair limit suspension policies for a 2-unit redundant system with 2-phase repairs. IEEE Trans. Reliab.R-30, 90.

    Google Scholar 

  • Kaplan, M. (1980). A two-fold tandem net with deterministic links and source interference. Oper.Res., 28, 512–526.

    Article  MathSciNet  MATH  Google Scholar 

  • Kaplan, E.I. & D.S. Silvestrov (1979). The theorems of the invariance principle type for semi-Markov processes with an arbitrary set of states. Analytical Methods Prob.Th., Collect.Sci.Works, Kiev, 121-125 (Russian).

    Google Scholar 

  • Kaplan, E.I. & D.S. Silvestrov (1980). Theorems of the invariance principle type for recurrent semi-Markov processes with arbitrary phase space. Theory Probab.Appl., 24, 536–547.

    Article  MATH  Google Scholar 

  • Kapoor, K.R. & P.K. Kapur (1978). Stochastic behaviour of some 2-unit redundant systems. IEEE Trans.Reliab., R-27, 382–385.

    Article  Google Scholar 

  • Kapoor, K.R. & P.K. Kapur (1978). Analysis of 2-unit standby redundant repairable systems. IEEE Trans.Reliab., R-27, 385–388.

    Article  Google Scholar 

  • Kapur, P.K. (see S. Biswas; & K.R. Kapoor).

    Google Scholar 

  • Karapenev, H.K. (1978). Reliability estimate for a redundant system with renewal and delayed failure exposure. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 107-112 (Russian).

    Google Scholar 

  • Karlin, S. & U. Liberman (1983). Measuring interference in the chiasma renewal formation process. Adv.Appl.Probab., 15, 471–487.

    Article  MATH  Google Scholar 

  • Karmeshu (see N.K. Jaiswal).

    Google Scholar 

  • Karr, A.F. (1976). Two extreme value processes arising in hydrology. J.Appl.Probab., 13, 190–194.

    Article  MathSciNet  MATH  Google Scholar 

  • Karr, A.F. (1982). A partially observed Poisson process. Stochastic Processes Appl., 12, 249–269.

    Article  MathSciNet  MATH  Google Scholar 

  • Kashtanov, V.A. (see G.I. Ivchenko).

    Google Scholar 

  • Kaufman, L. (1982). Solving large sparse linear system arising in queueing problems. Lect.Notes Math., 968, 352–360.

    Article  MathSciNet  Google Scholar 

  • Kaufmann, A. (see R. Cruon).

    Google Scholar 

  • Kawai, H. & H. Mine (1976). Marginal checking of a Markovian degradation unit when checking interval is probabilistic. J.Operations Res.Soc.Japan, 19, 158–173.

    MathSciNet  MATH  Google Scholar 

  • Kawai, H. & H. Mine (1982). An optimal inspection and maintenance policy of a deteriorating system. J.Operations Res.Soc.Japan, 1-15.

    Google Scholar 

  • Kawashima, T. (1979). Turnaround time equations in queueing networks. J.Operations Res.Soc.Japan, 21, 477–485.

    MathSciNet  MATH  Google Scholar 

  • Kazantsev, E.N. & M.Kh. Prilutskij (1978). A class of controlled Markov chains. Russ.math.Surv., 33, 235–236.

    Article  MATH  Google Scholar 

  • Keener, R.W. (1982). Renewal theory for Markov chains on the real line. Ann.Probab., 10, 942–954.

    Article  MathSciNet  MATH  Google Scholar 

  • Keilson, J. (see S.C. Graves).

    Google Scholar 

  • Keilson, J. (1974). Sojourn times, exit times and jitter in multi-variate Markov processes. Adv.Appl.Probab., 6, 747–756.

    Article  MathSciNet  MATH  Google Scholar 

  • Kekre, H.B., R.D. Kumar & H.M. Srivastava (1977). A study of varying efficiency multiserver queue models. Int.Symp.Oper.Theory Netw. Syst., Vol.11, Lubbock, 156-160.

    Google Scholar 

  • Kelbert, M.J. (1980). The existence of the limiting distributions in some networks of communication of messages. Adv.Probab.Relat. Top., Vol. 6, 397–421.

    MathSciNet  Google Scholar 

  • Kelbert, M.J. & Yu.M. Sukhov (1980). One class of star-shaped communication networks with packet switching. Probl.Inf.Transm., 15, 286–300.

    Google Scholar 

  • Kelly, F.P. (1976). Networks of queues. Adv.Appl.Probab., 8, 416–432.

    Article  MATH  Google Scholar 

  • Kelly, F.P. (1979). Reversibility and stochastic networks. John Wiley & Sons.

    Google Scholar 

  • Kelly, F.P. (1982). The throughput of a series of buffers. Adv.Appl. Probab., 14, 633–653.

    Article  MATH  Google Scholar 

  • Kempe, F. (1976). Extrapolation and identification of a component of a linear Markov process. Automat.Remote Control, 37, 501–511.

    MathSciNet  MATH  Google Scholar 

  • Kertz, R.P. (1978). Random evolutions with underlying semi-Markov processes. Publ.Res.Inst.Math.Sci., 14, 589–614.

    Article  MathSciNet  MATH  Google Scholar 

  • Khan, M.S.H. (see G.C. Jain).

    Google Scholar 

  • Kim Kwang, W. & C.C. White III (1980). Solution procedures for vector criterion Markov decision processes. Large Scale Syst., 1, 129–140.

    MATH  Google Scholar 

  • Kinugasa, M. & S. Osaki (1982). Performance-related reliability evaluation of a three-unit hybrid redundant system. Int.J.Syst. Sci., 13, 1–19.

    Article  MATH  Google Scholar 

  • Kirchheim, A. (1974). Prophylaktische Reparaturtermine eines technologischen Systems. VI. Intern.Kongr.Anwend.Math.Ingenieurwiss., Weimar, 1972, 178–181.

    Google Scholar 

  • Kirchheim A. (1980). Ein spezielles Erneuerungsmodell als Semi-Markov-Entscheidungsprozess. Elektron.Informationsverarbeitung Kybernetik, 16, 569–575.

    MathSciNet  MATH  Google Scholar 

  • Kiryan, N.L. & Ju.A. Zak (1976). Algorithms for analysing random process transition regimes in the process flow diagram. Avtomatika, Kiev, 58-70 (Ukrainian).

    Google Scholar 

  • Kistauri, Eh.I. (see A.H. Giorgadze).

    Google Scholar 

  • Kistauri, Eh.I. (1978). Successive decomposition of semi-Markov processes with a discrete set of states. Soobscenija Akad.Nauk Gruzin.SSR 91, 577–580 (Russian).

    MathSciNet  MATH  Google Scholar 

  • Kistauri, Eh.I. (1980). Application of a decomposition in order to calculate the time in which discrete semi-Markov processes are in a fixed subset of states. Soobscenija Akad.Nauk Gruzin.SSR 99, 69–72 (Russian).

    MATH  Google Scholar 

  • Kistner, K.P. & R. Subramanian (1978). Regenerative Eigenschaften von Modellen der Zuverlaessigkeitstheorie. Oper.Res.Verf., 2nd Symp.Teil 2, Aachen 1977, 713–725.

    MathSciNet  Google Scholar 

  • Kistner, K.P., R. Subramanian & K.S. Venkatakrishnan (1976). Reliability of a repairable system with standby failure. Operations Res., 24, 169–176.

    Article  MathSciNet  MATH  Google Scholar 

  • Kitaev, M.Yu. (1982). The existence of optimal homogeneous strategies of controllable semicontinuous semi-Markov models with respect to the average cost criterion. Theory Probab.Appl., 26, 614–616.

    Article  MATH  Google Scholar 

  • Klega, V. (1981). The mean period of random fluctuations at a linear system output. Acta Tech.CSAV, 26, 1–10.

    MATH  Google Scholar 

  • Klein, C.F. (see W.A. Gruver).

    Google Scholar 

  • Klein Haneveld, W.K. (1980). On the behaviour of the optimal value operator of dynamic programming. Math.Oper.Res., 5, 308–320.

    Article  MathSciNet  MATH  Google Scholar 

  • Klimov, G.P., R. Nagapetjan & S.N. Smirnov (1982). Regenerative processes with Markov-dependent cycles and their applications. Math.Operationsforsch.Stat., Ser.Optimization, 13, 287–297.

    Article  MathSciNet  MATH  Google Scholar 

  • Kobrin, F.E. & R.G. Potter (1982). Effects of cyclic spouse separation on conception times. Math.Biosci., 59, 207–223.

    Article  MATH  Google Scholar 

  • Koenig, D. (see U. Arndt, V.B. Gnedenko & U. Jansen).

    Google Scholar 

  • Koenig, D. (1974). Anwendung von stochastischen Prozessen mit Geschwindigkeiten zur Untersuchung von Bedienungs-und Zuverlaessigkeitsmodellen. Wiss.Z.Tech.n.Hoch.Otto von Guericke, Magdeburg, 18, 363–368.

    MATH  Google Scholar 

  • Koenig, D. & D. Stoyan (1981). Methoden der Bedienungstheorie. Moskva: “Radio i Svyaz” (Russian).

    Google Scholar 

  • Koevoets, D. (see Y.M.I. Dirickx).

    Google Scholar 

  • Kogan, Ja.A. (1977). Analytic investigation of page replacement algorithms for Markov and semi-Markov program behavior models. Automat.Remote Control, 38, 109–111 (Russian).

    MATH  Google Scholar 

  • Kohlas, J. (1982). Stochastic methods of operations research. Cambridge University Press.

    Google Scholar 

  • Kokotushkin, V.A. (see G.P. Basharin).

    Google Scholar 

  • Kolonko, M. (1980). Dynamische Optimierung unter Unsicherheit in einem Semi-Markoff-Modell mit abzaehlbarem Zustandsraum. Dissertation, Rhein.Fr.W.Universitaet, Bonn.

    Google Scholar 

  • Kolonko, M. (1982). The average-optimal adaptive control of a Markov renewal model in presence of an unknown parameter. Math. Operationsforsch.Stat., Ser.Optimization, 13, 567–591.

    Article  MathSciNet  MATH  Google Scholar 

  • Kolonko, M. (1982). Strongly consistent estimation in a controlled Markov renewal model. J.Appl.Probab., 19, 532–545.

    Article  MathSciNet  MATH  Google Scholar 

  • Kolonko, M. & M. Schael (1980). Optimal control of semi-Markov chains under uncertainty with applications to queueing models. Proc. Oper.Res.Jahrestag.DG0R, Regensburg 1979, 430–435.

    Google Scholar 

  • Kondratiev, A.S. (1976). Investigation of the asymptotic form of the mean failure-free operating time. Kibernetika, Kiev, 140-142 Russian).

    Google Scholar 

  • Kondratiev, A.S. & G.G. Menshikov (1978). Specification of asymptotic expressions for the mean time of failure-free operation of non-recoverable redundant systems. Kibernetika, Kiev, 142-143 (Russian).

    Google Scholar 

  • Konev, V.V. (1974). On the optimal switching of spare parts. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 77-83 (Russian).

    Google Scholar 

  • Konev, V.V. (1975). On the optimal switching for spare parts. Izvestija Akad.Nauk SSSR, tehn.Kivernet., 109-117 (Russian).

    Google Scholar 

  • Konovalyuk, V.S. (1981). Asymptotic analysis of a two-channel system with N reserve devices. Anal.Meth.Prob.Theory, Collect.Sci. Works, Kiev, 83-96 (Russian).

    Google Scholar 

  • Konovalyuk, V.S. (1982). Two-channel system with dependent failures. Cybernetics, 17, 808–815.

    Google Scholar 

  • Konovalyuk, V.S. (1982). Superposition of two dependent Markov renewal processes. Ukr.Math.J., 34, 140–144.

    Article  MathSciNet  MATH  Google Scholar 

  • Kopocinska, I. (1980). On system reliability under random load of elements. Zastosow.Mat., 17, 5–14.

    MathSciNet  MATH  Google Scholar 

  • Kopocinski, B. (see I. Kopocinska).

    Google Scholar 

  • Korn, I. (1974). A stochastic process generated by a network with a randomly alternating switch. J.Franklin Inst., 297, 153–167.

    Article  MathSciNet  MATH  Google Scholar 

  • Korolyuk, V.S. (see E. Arjas, S.M. Brodi & D.V. Gusak).

    Google Scholar 

  • Korolyuk, V.S. (1977). Semi-Markov models of complex stochastic systems. 2nd Int.Summer Sch.Prob.Theory Math.Stat., Varna, 113-185.

    Google Scholar 

  • Korolyuk, V.S. (1982). Superposition of Markov renewal processes. Cybernetics, 17, 556–560.

    Article  Google Scholar 

  • Korolyuk, V.S. & E.P. Lebedintseva (1978). Limit theorem for sojourn time of a semi-Markov process in a subset of states. Ukr.Math. J., 30, 513–516.

    Article  MathSciNet  MATH  Google Scholar 

  • Korolyuk, V.S. & A. Tadzhiev (1977). Asymptotic expansion for the life time distribution of the absorbing semi-Markov process. Dopovidi Akad.Nauk.Ukrain.SSR, Ser.A, 1065-1068(Ukrainian).

    Google Scholar 

  • Korolyuk, V.S. & A.F. Turbin (1976). Asymptotic enlarging of semi-Markov processes with an arbitrary state space. Proc.3rd Japan-USSR Symp.Prob.Theory Taschkent 1975, Lecture Notes Math., 550, 297–315.

    Article  MathSciNet  Google Scholar 

  • Korolyuk, V.S. & A.F. Turbin (1976) Semi-Markov processes and their applications. Kiev: Izdatelstvo “Naukova Dumka” (Russian).

    Google Scholar 

  • Korolyuk, V.S. & A.F. Turbin (1978). Mathematical principles for phase extension of complex systems. Kiev: Izdatelstvo “Naukova Dumka” (Russian).

    Google Scholar 

  • Korolyuk, V.S. & A.F. Turbin (1982). Markov renewal processes in problems of systems reliability. Kiev: Izdatelstvo “Naukova Dumka” (Russian).

    Google Scholar 

  • Korolyuk, V.S., A.A. Tomusyak & A.F. Turbin (1979). The time of duration of a semi-Markov process in a splittable set of states. Anal.Meth.Probab.Theory, Collect.Sci.Works, Kiev, 69-79 (Russian).

    Google Scholar 

  • Kortz, S. (see I.R. Goodman).

    Google Scholar 

  • Kotzurek, M. (see U. Jansen).

    Google Scholar 

  • Kouvatsos, D.D. (see M.A.El-Affendi).

    Google Scholar 

  • Kovalenko, I.N. (see G.I. Ivchenko).

    Google Scholar 

  • Kovalenko, I.N. (1981). Asymptotic state enlargement for random processes. Cybernetics, 16, 876–886 (Russian).

    Article  Google Scholar 

  • Kovalenko, I.N. (1980). Analysis of rare events in estimating the efficiency and reliability of systems. Moskva: “Sovetskoe Radio”.

    Google Scholar 

  • Kovalenko, I.N. (1982). Calculation of probabilistic characteristics of systems. Kiev: “Teknika” (Russian).

    Google Scholar 

  • Kovalenko, I.N. & N.Yu. Kuznetsov (1981). Renewal process and rare events limit theorems for essentially multidimensional queueing processes. Math.Operationsforsch.Stat., 12, 211–224.

    MathSciNet  MATH  Google Scholar 

  • Kozlov, V.V. (1978). A limit theorem for a queueing system. Theory Probab.Appl., 23, 182–187.

    Article  MATH  Google Scholar 

  • Kozniewska, I. & M. Wlodarczyk (1978). Renewal, reliability and service models. Warszawa: Pantswowe Wydawnictwo Naukowe (Polish).

    Google Scholar 

  • Kredentsjer, B.P. (1974). On the optimal distribution of spare parts according to their availability. Avtomtika vycislit.Tehn., Riga, 31-32.

    Google Scholar 

  • Krishna, J.V. (see N.K. Jaiswal).

    Google Scholar 

  • Kshirsagar, A.M. (see M. Becker).

    Google Scholar 

  • Kshirsagar, A.M. & R. Rao Chennupati (1978). A semi-Markovian model for predator-prey interactions. Biometrics, 34, 611–619.

    Article  MATH  Google Scholar 

  • Ruczura, A. (see D. Bajaj).

    Google Scholar 

  • Kueenle, Ch. & H.U. Kueenle (1977). Durchschnittsoptimale Strategien in Markovschen Entscheidungsmodellen bei unbeschraenkten Kosten. Math.Operationsforsch.Stat., Optimization, 8, 549-564. Kueenle, H.U. (see Ch. Kueenle).

    Google Scholar 

  • Kuehn, P.J. (1979). Approximate analysis of general queueing networks by decomposition. IEEE Trans.Commun., COM-27, 113-126.

    Google Scholar 

  • Kuhta, T.K. (1977). Analysis of the queueing system GI/M/m by the method of the embedded semi-Markov processes. Kibernetika, Kiev, 132-134.

    Google Scholar 

  • Kulba, V.V., A.G. Mamikonov & V.P. Pelikhov (1981). Determination of the probabilistic characteristics of feedback control for Markov and semi-Markov error processes. Autom.Remote Control, 41, 1375–1379.

    Google Scholar 

  • Kumar, A. (see M. Agarwal).

    Google Scholar 

  • Kumar, A. (1977). Steady-state profit in several 1-out-of-2: G systems. IEEE Trans.Reliab. R-26, 366–369.

    Article  Google Scholar 

  • Kumar, A. (1977). Profit in a 2-unit standby system with a general cost structure. Defence Sci.J., New Delhi, 27, 135–140.

    MATH  Google Scholar 

  • Kumar, A. & R. Lal (1979). Stochastic behaviour of a two-unit standby system with contact failure and intermittently available repair facility. Internat.J.Systems Sci., 10, 589–603.

    Article  MATH  Google Scholar 

  • Kumar, A. & R. Lal (1978). Stochastic behaviour of a standby redundant system. IEEE Trans.Reliab., R-27, 169–170.

    Article  Google Scholar 

  • Kumar, R.D. (see H.B. Kekre).

    Google Scholar 

  • Kumar, S. & M.F. Neuts (1982). Algorithmic solution of some queues with overflows. Manage.Sci., 28, 925–935.

    Article  MathSciNet  MATH  Google Scholar 

  • Kunderova, P. (1979). On a mean reward of a Markov replacement process with only one isolated class of recurrent states. Acta Univ. Palacki.Olomuc., Fac.Rerum Nat., 61, Math., 18, 145-155.

    Google Scholar 

  • Kunderova, P. (1980). On a mean reward from a common Markov replacement process. Acta Univ.Palacki.Olomuc., Fac.Rerum Nat., 65, Math., 18, 39–50.

    MathSciNet  Google Scholar 

  • Kunderova, P. (1981). On limit properties of the reward from a Markov replacement process. Acta Univ.Palacki.Olomuc., Fac. Rerum Nat., 69, Math., 20, 133–146.

    MathSciNet  MATH  Google Scholar 

  • Kupka, J. (1983). Two limit theorems for ergodically generated stochastic processes. Math.Proc.Camb.Philos.Soc., 93, 519–536.

    Article  MathSciNet  MATH  Google Scholar 

  • Kurako, E.K. (see E.K. Degtyarev).

    Google Scholar 

  • Kurasov, V.G. (see L.D. Chumatov).

    Google Scholar 

  • Kuznetsov, N.Ya. (see I.N. Kovalenko).

    Google Scholar 

  • Kuznetsov, N.Ya. (1979). On approximation of the probability of redundant system failure by the probability of the monotonous failure. Dopovidi Akad.Nauk Ukrain.RSR, Ser.A, 205-255 (Ukrainian).

    Google Scholar 

  • Kuznetsov, N.Ya. (1981). Semi-Markov model for loaded duplication. Cybernetics, 16, 558–567.

    Article  Google Scholar 

  • Kuznetsov, V.N., A.F. Turbin & M.D. Zbyrko (1980). Semi-Markov model for analysing reliability of system with restorable protection. Autom.Remote Control, 41, 879–887.

    MATH  Google Scholar 

  • Lacny, J. (1976). An analysis of buffering techniques in nodes of teleprocessing nets. Arch.Automat.Telemach., 21, 89–104.

    MATH  Google Scholar 

  • Lagakos, S.W. (see G.E. Dinse).

    Google Scholar 

  • Lagakos, S.W., C.J. Sommer & M. Zelen (1978). Semi-Markov models for partially censored data. Biometrika, 65, 311–317.

    Article  MathSciNet  MATH  Google Scholar 

  • Lal, R. (see A. Kumar).

    Google Scholar 

  • Landman, U. & M.F. Shlesinger (1980). Solutions of physical stochastic processes via mappings onto ideal and defective random walk lattices. Proc.Conf.Applied Stoch.Proc, Athens/USA, 151-246.

    Google Scholar 

  • Landrault, Ch. (see A. Costes).

    Google Scholar 

  • Landrault, Ch. (1978). A unified availability analysis method for systems containing design errors. IEEE Trans.Reliab., R-26, 331–334.

    Article  Google Scholar 

  • Langen, H.J. (1980). On weak approximation of Markov decision models. Methods Oper.Res., 37, 383–389.

    MATH  Google Scholar 

  • Lansky, P. (1978). On a modification of Renyi’s traffic models. Apl.Mat., 23, 39–51.

    MathSciNet  MATH  Google Scholar 

  • Laprie, J.C. (see A. Costes).

    Google Scholar 

  • Largay, B.J., J.A. Largay III & D. Young (1982). A new computational approach to cost variance investigation problems. J.Inf.Optimization Sci., 3, 1–16.

    Article  MATH  Google Scholar 

  • Largay, J.A. III (see B.J. Largay).

    Google Scholar 

  • Larsen, R.L. (see A.K. Agrawala).

    Google Scholar 

  • Latouche, G. (see J.P. Colard).

    Google Scholar 

  • Latouche, G. (1982). A phase type semi-Markov point process. SIAM J.Algebraic Discrete Methods, 3, 77–90, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  • Latyshev, Eh.eh. (1982). Reliability of systems with random streams of multistage customers. Autorn.Remote Control, 43, 229–237.

    MATH  Google Scholar 

  • Lauenstein, G. & K. Renger (1981). Haeherungsweise Ermittlung der Erneuerungsfunktion und Entwicklung von Diagrammen zur Bestimmung optimaler starr periodischer Instandhaltungszylklen bei Weibull-verteilten Laufzeiten. Wiss.Z.Tech.Hochsch.Carl Schorlemmer Leuna-Merseburg, 23, 529–545.

    MATH  Google Scholar 

  • Lauriere, J.L. (see R. Faure).

    Google Scholar 

  • Lave, R.E. & J.K. Satia (1973). Markovian decision processes with probabilistic observation of states. Management Sci., Theory, 20, 1–13.

    Article  MathSciNet  MATH  Google Scholar 

  • Lavenberg, S.S. & M. Reiser (1980). Mean-value analysis of closed multichain queueing networks. J.Assoc.Comput.Math., 27, 313–332.

    Article  MathSciNet  MATH  Google Scholar 

  • Lavenberg, S.S. & M. Reiser (1980). Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. J.Appl.Probab., 17, 1048–1061.

    Article  MathSciNet  MATH  Google Scholar 

  • Lavenberg, S.S. & M. Reiser (1981). Corrigendum to “Mean-value analysis of closed multichain queueing networks”. J.Assoc.Comput. Mach., 28, 629.

    Article  MathSciNet  MATH  Google Scholar 

  • Lavenberg, S.S. & C.H. Sauer (1977). Sequential stopping rules for the regenerative method of simulation. IBM J.Res.Develop., 21, 545–558.

    Article  MathSciNet  MATH  Google Scholar 

  • Lavenberg, S.S., T.L. Moeller & P.D. Welch (1982). Statistical results on control variables with application to queueing network simulation. Oper.Res., 30, 182–202.

    Article  MATH  Google Scholar 

  • Lazar, A.A. (1983). Optimal flow control of a class of queueing networks in equilibrium. IEEE Trans.Autorn.Control AC-28, 10001-1007.

    Google Scholar 

  • Leavenworth, R.S. & R.L. Scheaffer (1979). Design of a process control scheme for defects per 100 units based on AOQL. Naval Res. Logist., Q, 26, 463–485.

    Article  MATH  Google Scholar 

  • Lebedintseva, E.M. (see V.S. Korolyuk).

    Google Scholar 

  • Lemaire, B. (1975). Etat actuel et perspectives de l’utilisation des modèles markoviens pour l’étude du comportement des consommateurs. Math.et Sci.Humaines, 50, 51–80.

    MathSciNet  Google Scholar 

  • Lemaire, B. (1978). Théorème de conservation des clients dans les files d’attente. RAIRO, Rech.Opérat., 12, 395–399.

    MathSciNet  MATH  Google Scholar 

  • Lemoine, A.J. (see J.M. Harrison).

    Google Scholar 

  • Lemoine, A.J. (1977). Networks of queues — a survey of equilibrium analysis. Manage.Sci., 24, 464–481.

    Article  MathSciNet  MATH  Google Scholar 

  • Lemoine, A.J. (1978). Networks of queues — a survey of weak convergence results. Manage.Sci., 24, 1175–1193.

    Article  MathSciNet  MATH  Google Scholar 

  • Lennox, W. & B. Sahay (1974). Moments of the first passage-time for narrow-band process. J.Sound Vibration, 32, 449–458.

    Article  MATH  Google Scholar 

  • Le Ny, L.M. (1980). Etude analytique de réseaux de files d’attente multiclasses à routages variables. RAIRO, Rech.Opér., 14, 331–347.

    MATH  Google Scholar 

  • Lesanovsky, A. (1982). The comparison of two-unit standby redundant system with two and three states of units. Proc.2nd Pannonian Sympt.Probability Stat.Inference, Bad Tatzmannsdorf, Austria, 239-250.

    Google Scholar 

  • Létac, G. (1978). Chaînes colorées: trois extensions d’une formule de P.Nelson. J.Appl.Probab., 15, 321–339.

    Article  MATH  Google Scholar 

  • Lev, G.S. (1980) On the distribution of the absorption time for a semi-Markov multiplication process. Theory Probab.Appl., 24 876–882.

    Article  MATH  Google Scholar 

  • Leve (de), D. (see A. Federgruen).

    Google Scholar 

  • Levine, W.S. (see J.S. Baras).

    Google Scholar 

  • Levinskij, B.G. & A.F. Turbin (1981). A method for the asymptotic analysis of semi-Markov processes in the scheme of phase enlargement. Analyt.Meth.Probab.Theory, Collect.Sci.Works, Kiev, 133-147.

    Google Scholar 

  • Liberman, U. (see S. Karlin).

    Google Scholar 

  • Lidskij, Eh.A. (1981). Reliability as the stability of the output characteristics of automation apparatus. Cybernetics, 16, 450–457.

    Article  Google Scholar 

  • Liefvoort (van de), A. (see J.L. Carroll).

    Google Scholar 

  • Lin, T.L. (see J.S. Baras).

    Google Scholar 

  • Linton, D. & P. Purdue (1979). An M/G/s queue with m customer types subject to periodic clearing. Opsearch, 16, 80–87.

    MathSciNet  MATH  Google Scholar 

  • Lippman, S.A. (1976). Countable-state, continuous-time dynamic programming with structure. Operations Res., 24, 477–490.

    Article  MathSciNet  MATH  Google Scholar 

  • Lipsky, L. (see J.L. Carroll).

    Google Scholar 

  • Litvinov, A.L. & V.A. Popov (1978). Probabilistic model of buffer store for a control computer complex with group choice. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 91-95.

    Google Scholar 

  • Liu, M.S. & J.S. Yao (1977). The capacity of a traffic flow on a Tform traffic intersection. Tamkang J.Math., 8, 135–143.

    MathSciNet  MATH  Google Scholar 

  • Lloyd, E.H. (1977). Reservoirs with seasonally varying Markovian inflows and their first passage times. Int.Institute Appl. Systems Analysis, Laxenburg, RR-77-4.

    Google Scholar 

  • Lopatko, V.B. (1977). Communication between processes via ports with enclosed buffers. Mosc.Univ.Comput.Math.Cybern., 75-79.

    Google Scholar 

  • Lucas, G. (see B. Anders).

    Google Scholar 

  • Luss, H. (1976). Maintenance policies when deterioration can be observed by inspection. Operations Res., 24, 359–366.

    Article  MathSciNet  MATH  Google Scholar 

  • Magazine, M.J. (1983). Optimality of intuitive checkpointing policies. Inf.Process.Lett., 17, 63–66.

    Article  MathSciNet  Google Scholar 

  • Maisonneuve, B. (1975). Entrance-exit results for semi-regenerative processes. Z.Wahrscheinlichkeitstheorie Verw.Geb., 32, 81–94.

    Article  MathSciNet  MATH  Google Scholar 

  • Malshakov, V.D., M.B. Tamarkin & A.R. Timoshenko (1980). Model of computer system on the level of intervals of resource utilization. Autom.Control.Comut.Sci., 14, 15–19.

    Google Scholar 

  • Mamikonov, A.G. (see V.V. Kulba).

    Google Scholar 

  • Manca, R. (see M. Carravetta).

    Google Scholar 

  • Marcus, A.H. (see A. Becher).

    Google Scholar 

  • Marcus, A.H. (1980). Erratum to: Power laws in compartmental analysis. Part I: A unified stochastic model. Math.Biosci., 48, 155.

    Google Scholar 

  • Marie, R. (1978). Quelques résultats relatifs aux réseaux de files d’attente. 1er Colloq.Math.Appl., AFCET-SMF, Palaiseau 1978, I, 253-263.

    Google Scholar 

  • Ng Stephen, F.W. & J.W. Mark (1978). Satellite packet switching with global assignments and batch Poisson arrivals. IEEE Trans. Comput., C-27, 1216–1221.

    Article  Google Scholar 

  • Marshall, K.T. (see W.J. Hayne).

    Google Scholar 

  • Martynenko, O.N. & A.S. Serdakov (1982). Optimizing the checking depth in electronic equipment. Autom.Remote Control, 42, 1040–1043.

    Google Scholar 

  • Masol, V.I. (1977). On the asymptotic behaviour of the time of arrival at a high level by a regenerative stable process with independent increments. Theory Probab.Math.Stat., 9, 139–144.

    MATH  Google Scholar 

  • Massey, W.A. (1984). Open networks of queues: their algebraic structure and estimating their transient behaviour. Adv.Appl. Probab., 16, 176–201.

    Article  MathSciNet  MATH  Google Scholar 

  • Mastebroeck, H.A.K. (see G. Gestri).

    Google Scholar 

  • Mazo, J.E. (1982). Some extremal Markov chains. Bell Syst.Tech.J., 61, 2065–2080.

    MathSciNet  MATH  Google Scholar 

  • McClean, S.I. (1978). Continuous-time stochastic models of a multi-grade population. J.Appl.Probab., 15, 26–37.

    Article  MathSciNet  MATH  Google Scholar 

  • McClean, S.I. (1980). A semi-Markov model for a multigraphe population with Poisson recruitment. J.Appl.Probab., 17, 846–852.

    Article  MathSciNet  MATH  Google Scholar 

  • McConalogue, D.J. (see L.A. Baxter).

    Google Scholar 

  • McDonald, D. (see K.B. Athreya).

    Google Scholar 

  • McDonald, D. (1977). Equilibrium measures for semi-Markov processes. Ann.of Probab., 5, 818–822.

    Article  MATH  Google Scholar 

  • McDonald, D. (1978). On semi-Markov and semi-regenerative processes I. Z.Wahrscheinlichkeitstheorie verw.Gebiete, 42, 261–277.

    Article  MATH  Google Scholar 

  • McDonald, D. (1978). On semi-Markov and semi-regenerative processes II. Ann.of Probab., 6, 995–1014.

    Article  MATH  Google Scholar 

  • McKenna, J. & D. Mitra (1982). Integral representations and asymptotic expansions for closed Markovian queueing networks: normal usage. Bell Syst.Tech.J., 61, 661–683.

    MathSciNet  MATH  Google Scholar 

  • McKenna, J., D. Mitra & K.G. Ramakrishnan (1981). A class of closed Markovian queueing networks: integral representations, asymptotic expansions and generalizations. Bell Syst.Techn.J., 60, 599–641.

    MathSciNet  MATH  Google Scholar 

  • McNickle, D.C. (see R.L. Disney).

    Google Scholar 

  • Meditch, J.S. (1978). A minimum principle/queueing theory approach to routing in message-switched networks. Comput.Electr.Eng., 5, 305–310.

    Article  MATH  Google Scholar 

  • Mehlmann, A. (1979). Semi-Markovian manpower models in continuous time. J.Appl.Probab., 16, 416–422.

    Article  MathSciNet  MATH  Google Scholar 

  • Mehta, Y.K. (see S. Biswas).

    Google Scholar 

  • Meilijson, I. & G. Weiss (1977). Multiple feedback at a single-server station. Stochastic Processes Appl., 5, 195–205.

    Article  MathSciNet  MATH  Google Scholar 

  • Meister, B. (1976). Models in resource allocation — trees of queues. Lecture Notes Econ.Math.Syst., 117, 215–223.

    Article  Google Scholar 

  • Meketon, M.S. (see Ph. Heidelberger).

    Google Scholar 

  • Melamed, B. (see F.J. Beutler).

    Google Scholar 

  • Melamed, B. (1979). Characterizations of Poisson traffic streams in Jackson queueing networks. Adv.Appl.Probab., 11, 422–438.

    Article  MathSciNet  MATH  Google Scholar 

  • Melamed, B. (1982). On the reversibility of queueing networks. Stochastic Processes Appl., 13, 227.

    Article  MathSciNet  MATH  Google Scholar 

  • Melamed, B. (1982). On Markov jump processes imbedded at jump epochs and their queueing-theoretic applications. Math.Oper.Res., 7, 111–128.

    Article  MathSciNet  MATH  Google Scholar 

  • Mello, J.M.C. (see N.A.J. Hastings).

    Google Scholar 

  • Menselson, H. & U. Yechiali (1981). Controlling the GI/M/1 queue by conditional acceptance of customers. Eur.J.Oper.Res., 7, 77–85.

    Article  Google Scholar 

  • Menipaz, E. (1979). Cost optimization of some stochastic maintenance policies. IEEE Trans.Reliab., R-28, 133–136.

    Article  Google Scholar 

  • Mensikov, G.G. (see A.S. Kondratiev).

    Google Scholar 

  • Mergenthaler, W. (1982). The total repair cost in a defective, coherent binary system. Cybern.Syst., 13, 219–243.

    Article  MathSciNet  MATH  Google Scholar 

  • Michikazu, K. (1978). Some applications of reliability analysis of standby redundant systems with repair. J.Operations Res.Soc. Japan, 21, 146–169.

    MATH  Google Scholar 

  • Mihoc, G. & S.P. Niculescu (1976). On a class of stochastic processes. An.Univ.Craiova, Ser.Mat.Fiz.Chim., 4, 7–10.

    MathSciNet  MATH  Google Scholar 

  • Mikadze, I.S. (1978). On a technique to determine operational readyness. Soobshch.Akad.Nauk Gruzin.SSR, 92, 417–420.

    MathSciNet  MATH  Google Scholar 

  • Mileshina, R.I. (1977). Limit theorems for a controlled random walk. Theory Probab.Math.Stat., 13, 125–140.

    MATH  Google Scholar 

  • Miller, D.R. (1979). Almost sure comparisons of renewal processes and Poisson processes, with applications to reliability theory. Math.Oper.Res., 4, 406–413.

    Article  MathSciNet  MATH  Google Scholar 

  • Mine, H. (see H. Kawai).

    Google Scholar 

  • Mine, H. & S. Osaki (1977). Markovian decision processes. Moskva: “Nauka” (Russian).

    Google Scholar 

  • Mirabile, M.P. (see E. Hannan).

    Google Scholar 

  • Mironov, M.A. & V.I. Tikhonov (1977). Markov processes. Moskva: “Sovetskoe Radio” (Russian).

    Google Scholar 

  • Misra, K.B. & J. Sharma (1974). Reliability optimization of a series system with active and standby redundancy. Internat.J.Systems Sci., 5, 1131–1142.

    Article  MATH  Google Scholar 

  • Mitra, D. (see J. Mckenna).

    Google Scholar 

  • Mitra, D. & J.A. Morrison (1983). Asymptotic explansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes. Adv.Appl.Probab., 15, 813–839.

    Article  MathSciNet  MATH  Google Scholar 

  • Mitra, D. & K.G. Ramakrishnan (1982). An overview of PANACEA, a software package for analysing Markovian queueing networks. Bell Syst.Tech.J., 61, 2849–2872.

    MATH  Google Scholar 

  • Mitrani, I. (see E. Coffman & E. Gelenbe).

    Google Scholar 

  • Mode, Ch.J. (1976). On the calculation of the probability of current family-planning status in a cohort of women. Math.Biosciences, 31, 105–120.

    Article  MATH  Google Scholar 

  • Mode, Ch.I. & G. Pickens (1979). An analysis of postpartum contraceptive strategies — Policies for preventive medicine. Math.Biosciences, 47, 91–113.

    Article  MathSciNet  MATH  Google Scholar 

  • Mode, Ch.J. & M.G. Soyka (1980). Linking semi-Markov processes in time series — An approach to longitudinal data analysis. Math.Biosciences, 51, 141–164.

    Article  MATH  Google Scholar 

  • Moeller, T.L. (see S.S. Lavenberg).

    Google Scholar 

  • Mohanty, S.G. (see J.L. Jain).

    Google Scholar 

  • Molma, C. (see G.E. Grandori).

    Google Scholar 

  • Monahan, G.E. (1982). A survey of partially observable Markov decision processes: Theory, models and algorithms. Manage. Sci., 28, 1–16.

    Article  MathSciNet  MATH  Google Scholar 

  • Morais (de), P.R. (1979). A Markovian model for a continuous-time inventory systems. 3rd Nat.Symp.Probab.Stat., Sao Paulo, 160-164.

    Google Scholar 

  • Morey, R.C. (1975). Approximations for the consolidation of multi-echelon repair facilities. Naval Res.Logist.Q., 22, 455–460.

    Article  MATH  Google Scholar 

  • Morang, R.W. (see J.S. Edwards).

    Google Scholar 

  • Mori, T.F. (1980). On the asymptotic network delay in a model of packet switching. Comput.Math.Appl., 7, 167–172.

    Article  MATH  Google Scholar 

  • Morozov, E.V. (1983). Some results for processes with continuous time in the system GI/G/1 with losses from the queue. I. Izvestija Akad.Nauk BSSR, Ser.Fiz.-Mat.Nauk, 51-55 (Russian). Morrison, J.A. (see D. Mitra).

    Google Scholar 

  • Morton, T.E. (1974). Decision horizons in discrete time undiscounted Markov renewal programming. IEEE Trans.Systems Man Cybernetics SMC-4, 392-394.

    Google Scholar 

  • Motoori, M., T. Nakagawa, Y. Sawa & K. Yasui (1980). Reliability analysis of an inspection policy and its application to a computer system. J.Oper.Res.Soc.Japan, 23, 273–286.

    MathSciNet  MATH  Google Scholar 

  • Mountford, D. (1979). An inequality in p-functions. Ann.of Probab., 7, 184–185.

    Article  MathSciNet  MATH  Google Scholar 

  • Mueller, B. (1980). Zerlegungsorientierte, numerische Verfahren fuer Markovsche Rechensystemmodelle. (Dissertation). Abteilung Informatik der Universitaet Dortmund.

    Google Scholar 

  • Mukhitdinova, N.M. (1978). Reservation with marginal checking and renewal. Dokl.Akad.Nauk UzSSR 1978, 8-11 (Russian).

    Google Scholar 

  • Nadarajan, R. & M.F. Neuts (1982). A multiserver queue with thresholds for the acceptance of customers into service. Oper.Res., 30, 948–960.

    Article  MATH  Google Scholar 

  • Nagapetjan, R. (see G.P. Klimov).

    Google Scholar 

  • Nagapetjan, R. (1981). Use of regenerative processes with Markov dependent regeneration cycles. Izvestija Akad.Nauk Mold.SSR, Ser.Fiz.-Tehn.Mat.Nauk, 14-21 (Russian).

    Google Scholar 

  • Nahmias, S. (1975). A sequential decision problem with partial information. Cah.Cent.Etud.Rech.Opér., 17, 53–64.

    MathSciNet  MATH  Google Scholar 

  • Naik, D.N. (1978). Steady state availability of a system with two types of failure. IAPQR Trans., 3, 27–33.

    MATH  Google Scholar 

  • Naik, D.N. (1981). Estimating the parameters of a 2-out-of-3: F system. IEEE Trans.Reliab. R-30, 464-465.

    Google Scholar 

  • Nakagawa, T. (see A.L.Goel & M. Motoori).

    Google Scholar 

  • Nagakawa, T. & S. Osaki (1976). Analysis of a repairable system which operates at discrete times. IEEE Trans.Reliab.R-25, 110-112.

    Google Scholar 

  • Nakajima, S. & Y. Watanabe (1977). Optimal renewal interval of a part before failures — a definite part with constant renewal intervals. Rep.Fac.Eng., Kanagawa Univ., 15, 36-41 (Japanese).

    Google Scholar 

  • Nakamura, M. & S. Osaki (1984). Performance/reliability evaluation for multi-processor systems with computation demands. Int. J.Syst.Sci., 15, 95–105.

    Article  MATH  Google Scholar 

  • Nance, R.E. (see U.N. Bhat).

    Google Scholar 

  • Naneva, T. (see I. Cvetanov).

    Google Scholar 

  • Nasirova, T.I. (see H.M. Ahmedova).

    Google Scholar 

  • Nasirova, T.I. (1978). On a model of the control of reserves. Teor. Sluchajnyck Protsessov 6, 107-119 (Russian).

    Google Scholar 

  • Nasirova, T.I. (1980). On an ergodic theorem for certain Markov processes with delaying barrier. Theory Probab.Math.Stat., 20, 105–112.

    MATH  Google Scholar 

  • Nasirova, T.I. (1982). Distribution of a semi-Markov walk process with delay screen. Izvestija Akad.Nauk Az.SSR, Ser.Fiz.-Tehn. Mat.Nauk., 6, 116–119.

    MathSciNet  Google Scholar 

  • Nasirova, T.I. & A.V. Skorohod (1981). On the asymptotic behaviour of processes in an inventory control model. Theory Probab.Math. Stat., 23, 137–142.

    Google Scholar 

  • Nasirova, T.I. & A.V. Skorohod (1982). Limit theorems for some classes of random processes related to semi-Markov random walks. Theory Probab.Math.Stat., 25, 137–151.

    MATH  Google Scholar 

  • Naumov, V.A. (see G.P. Basharin).

    Google Scholar 

  • Nawrotzki, K. (see U. Jansen).

    Google Scholar 

  • Nawrotzki, K. (1982). Ergodic theorems for random processes with embedded homogeneous flow. Theory Probab.Appl., 26, 388–392.

    Article  MATH  Google Scholar 

  • Nechaev, B.Ya. (see Ya.G. Genis).

    Google Scholar 

  • Neffke, H. (1979). Renewal reward processes with linear expectation functions. Oper.Res.Verfahren, 30, 98–110.

    MathSciNet  MATH  Google Scholar 

  • Neffke, H. (1982). Bewertete Erneuerungsprozesse. Mathematical Systems in Economics, Hanstein.

    Google Scholar 

  • Nesenbergs, M. (1979). A hybrid of Erlang B and C formulas and its applications. IEEE Trans.Commun.C0M-27, 59-68.

    Google Scholar 

  • Neumann, K. (see W. Fix).

    Google Scholar 

  • Neumann, K. (1979). Recent advances in temporal analysis of GERT networks. Z.Oper.Res., Ser.A, 23, 153–177.

    MATH  Google Scholar 

  • Neumann, K. (1980) Dynamische Optimierung und optimale Steuerung in speziellen GERT-Netsplaenen. Wiss.Z.Tech.Hochsctu Leipz., 4, 349-355.

    Google Scholar 

  • Neumann, K. & U. Steinhardt (1979). GERT networks and the time-oriented evaluation of projects. Lecture Notes Econ.Math. Systems, 172.

    Google Scholar 

  • Neuts, M.F. (see S. Chakravarthy, S. Kumar & R. Nadarajan).

    Google Scholar 

  • Neuts, M.F. (1976). Moment formulas for the Markov renewal branching process. Adv.Appl.Probab., 8, 690–711.

    Article  MathSciNet  MATH  Google Scholar 

  • Neuts, M.F. (1977). Some explicit formulas for the staedy-state behaviour of the queue with semi-Markovian service time. Adv. Appl.Probab., 9, 141–157.

    Article  MathSciNet  MATH  Google Scholar 

  • Neuts, M.F. (1978). The second moments of the absorption times in the Markov renewal branching process. J.Appl.Probab., 15, 707–714.

    Article  MathSciNet  MATH  Google Scholar 

  • Neuts, M.F. (1978). Renewal processes of phase type. Naval.Res. Logist.Q., 25, 445–454.

    Article  MathSciNet  MATH  Google Scholar 

  • Ney, P.E. (see K.B. Athreya).

    Google Scholar 

  • Ng Stephen, F.W. (see J.W. Mark).

    Google Scholar 

  • Nicolai, W. (1979). Optimierung spezieller GERT-Netzplaene. Z.Angew. Math.Mech., 59/01, T108-T109.

    Google Scholar 

  • Nicolai, W. (1980). On the temporal analysis of special GERT-networks using a modified Markov renewal process. Z.Oper.Res., Ser.A, 24, 263–272.

    MathSciNet  MATH  Google Scholar 

  • Nicolai, W. (1982). Optimization of STEOR networks via Markov renewal programming. Z.Oper.Res., Ser.A, 26, 7–19.

    MathSciNet  MATH  Google Scholar 

  • Nicolis, J.S. & E.N. Protonotarios (1980). Modelling communication and control between hierarchical systems. Int.J.Syst.Sci., 11, 107–127.

    Article  MathSciNet  MATH  Google Scholar 

  • Niculescu, S.P. (see G. Mihoc).

    Google Scholar 

  • Nikiforov, G.K. & Yu.I. Ryzhikov (1983). An iteration method of calculation of service of a nonhomogeneous flow in a multichannel systel. Cybernetics, 19, 260–266.

    Article  MATH  Google Scholar 

  • Nishida, T. & K. Tatsuno (1982). Optimal maintenance policy with minimal repair for stochastically failing system. J.Oper.Res. Soc.Japan, 25, 238–248.

    MATH  Google Scholar 

  • Nishida, T., F. Ohi & K. Tatsuno (1983). Extended opportunistic maintenance policy for a two-unit system. Math.Japan, 28, 569–575.

    MathSciNet  MATH  Google Scholar 

  • Noebels, R. (1981). A note on stochastic order of probability measures and an application to Markov processes. Z.Oper.Res., Ser.A, 25, 35–43.

    MathSciNet  MATH  Google Scholar 

  • Nollau, V. (see T. Ewers & E. Jannusch).

    Google Scholar 

  • Nollau, V. (1981). Semi-Markovsehe Prozesse. Deutsch-Taschenbuecher, 31, Verlag Harri Deutsch.

    Google Scholar 

  • Norman, J.M. (see T.A. Burgin).

    Google Scholar 

  • Nosenko, V.I. (see V.V. Bondarev).

    Google Scholar 

  • Nummelin, E. (see E. Arjas).

    Google Scholar 

  • Nummelin, E. (1976). Limit theorems for σ-recurrent semi-Markov processes. Adv.Appl.Probab., 8, 531–547.

    Article  MathSciNet  MATH  Google Scholar 

  • Nummelin, E. (1977). On the concepts of σ-recurrence and σ-transience for Markov renewal processes. Stochastic Processes Appl., 5, 1–19.

    Article  MathSciNet  MATH  Google Scholar 

  • Nummelin, E. (1978). Uniform and ratio limit theorems for Markov renewal and semi-regenerative processes on a general state space. Ann.Inst.Henri Poincaré, Sect.B, 14, 119–143.

    MathSciNet  MATH  Google Scholar 

  • Nummelin, E. (1979). A conservation property for general GI/G/1 queues with an application to tandem queues. Adv.Appl.Probab., 11, 660–672.

    Article  MathSciNet  MATH  Google Scholar 

  • Nunen (van), J.A.E.E. (1976). Contracting Markov decision processes. Amsterdam, Mathematical Centre Tracts, 71.

    Google Scholar 

  • Nunen (van), J.A.E.E. & M.L. Puterman (1981). On solving G/M/s queueing control systems. Proc.Jahrestag Oper.Research, DGOR, Essen, 483-490.

    Google Scholar 

  • Nunen (van), J.A.E.E. & S. Stidham jun. (1981). Action-dependent stopping times and Markov decision process with unbounded rewards. OR Spektrum, 3, 145–152.

    Article  MATH  Google Scholar 

  • Nunen (van), J.A.E.E. & J. Wessels (1976). FORMASY: Forecasting and Recruitment in MAnpower SYstems. Statistica Neerlandica, 30, 173–193.

    Article  MathSciNet  MATH  Google Scholar 

  • Nunen (van), J.A.E.E. & J. Wessels (1979). On theory and algorithms for Markov decision problems with the total reward criterion. OR, Spektrum, 1, 57–67.

    Article  MATH  Google Scholar 

  • Nunen (van), J.A.E.E. & J. Wessels (1984). On using discrete random models within decision support systems. Eur.J.Oper.Res., 15, 141–159.

    Article  MATH  Google Scholar 

  • Oakes, D. (1976). Random overlapping intervals — a generalization of Erlang’s loss formula. Ann.of Probab., 4, 940–946.

    Article  MathSciNet  MATH  Google Scholar 

  • Odoni, A.R. & E. Roth (1983). An empirical investigation of the transient behavior of stationary queueing systems. Oper.Res., 31, 432–455.

    Article  MATH  Google Scholar 

  • Ohi, F. (see T. Nishida).

    Google Scholar 

  • Ohno, K. (1981). A unified approach to algorithms with a suboptimality test in discounted semi-Markov decision processes. J.Oper. Res.Soc.Japan, 24, 296–324.

    MathSciNet  MATH  Google Scholar 

  • Ohta, H. (1980) GERT. Analysis of the economic design of control chart. IAPQR Trans., 5, 57–65.

    MATH  Google Scholar 

  • Onicescu, O., G. Oprisan & G. Popescu (1983). Renewal processes with complete connections. Rev.Roum.Math.Pures Appl., 28, 985–998.

    MathSciNet  MATH  Google Scholar 

  • Opderbeck, H. (see W.W. Chu).

    Google Scholar 

  • Opitz, O. & M. Schader (1975). Operations Research Verfahren und Marketingsprobleme. Math.Systems in Econ., Verlag Anton Hain. Oprisan, G. (see O.Onicescu).

    Google Scholar 

  • Oprisan, G. (1976). On the J-X processes. Rev.Roum.Math.Pures Appl., 21, 717–724.

    MathSciNet  MATH  Google Scholar 

  • Oprisan, G. (1977). Some limit theorems for semi-Markov processes with an arbitrary state space. Proc.5th Conf.Probab.Theory, Brasov, 1974, 247–256.

    MathSciNet  Google Scholar 

  • Oral, M. & S.S. Rao (1980). An objective function for inventory control models. Proc.Int.Conf.Stochastic Programming, Oxford, 403-426.

    Google Scholar 

  • Osaki, S. (see A.L. Goel, M. Kinugasa, H. Mine, T. Nakagawa & M. Nakamura).

    Google Scholar 

  • Osaki, S. & M. Takeda (1979). A two-unit paralleled redundant system with bivariate exponential failure law and allowed down time. Cah.Cent.Etud.Rech.Opér., 21, 55–62.

    MathSciNet  MATH  Google Scholar 

  • Osaki, S. & F. Sugimoto (1976). Optimum repair limit replacement policies for a system subject to intermittent blows. Cah.Cent. Etud.Rech.Opér., 18, 485–491.

    MathSciNet  MATH  Google Scholar 

  • Osawa, H. (see M. Doi).

    Google Scholar 

  • Ovchinnikov, V.N. (1976). Asymptotic behavior of the time till the first failure of a model with inhomogeneous reservation and rapid repair. Izvestija Akad.Nauk SSSR, Tehn.Kibernet., 82-90 (Russian).

    Google Scholar 

  • Pages, A. (see M. Gondran).

    Google Scholar 

  • Pandit, S.M., H.J. Steudel & S.M. Wu (1977). A multiple time series approach to modelling the manufacturing job-shop as a network of queues. Manage.Sci., 24, 456–463.

    Article  MATH  Google Scholar 

  • Pau, L.F. (1981). Failure diagnosis and performance monitoring. Control & Systems Theory, Vol.11, Marcel Dekker, New York.

    Google Scholar 

  • Pavlov, I.V. & I.A. Ushakov (1978). The asymptotic distribution of the time until a semi-Markov process gats out of a kernel. Eng.Cybern., 16, 68–72.

    MATH  Google Scholar 

  • Pearce, C.E.M. (1982). A generalization of Rapp’s formula. J.Austr. Math.Soc, Ser.B, 23, 291–296.

    Article  MathSciNet  MATH  Google Scholar 

  • Pedrono, R. (see J.M. Helary).

    Google Scholar 

  • Pelikhov, V.P. (see V.V. Kulba).

    Google Scholar 

  • Pellaumail, J. (1978). Probabilités stationnaires de réseaux dont les probabilités de transfert dépendent de l’état. Proc.ler Colloq.Math.Appl., AFCET-SMF, Palaiseau, I, 265-275.

    Google Scholar 

  • Pellaumail, J. (1978). Formule de produit pour réseaux à probabilités de transfert dépendant de l’état. C.R.Acad.Sci.Paris, Ser.A, 287, 157–159.

    MathSciNet  MATH  Google Scholar 

  • Pellaumail, J. (1979). Formule du produit et décomposition de réseaux de files d’attente. Ann.Inst.Henri Poincaré, Sect.B, 15, 261–286.

    MathSciNet  MATH  Google Scholar 

  • Perros, H.G. (see F.G. Foster).

    Google Scholar 

  • Peshes, L.Ya. (see V.E. Kan).

    Google Scholar 

  • Pezhinska, G. (1983). Estimates of expectations for the approach moments of renewal points for Markov renewal processes. Dokl.Akad.Nauk Ukr.SSR, Ser.A, 8-10 (Russian).

    Google Scholar 

  • Phatarfod, R.M. (1982). On some applications of Wald’s identity to dams. Stochastic Processes Appl., 13, 279–292.

    Article  MathSciNet  MATH  Google Scholar 

  • Phelps, R.I. (1983). Optimal policy for minimal repair. J.Oper.Res. Soc, 34, 425–427.

    Article  MATH  Google Scholar 

  • Phillips, M.J. (1981). A characterization of the negative exponential distribution with application to reliability theory. J.Appl. Probab., 18, 652–659.

    Article  MathSciNet  MATH  Google Scholar 

  • Pickens, G. (ss Ch.J. Mode).

    Google Scholar 

  • Pinter, J. (1977). Investigations on the maximal distance of empirical distribution series. Alkalmazott Mat.Lapok., 1, 189–195 (Hungarian).

    MathSciNet  Google Scholar 

  • Pittel, B. (1979). Closed exponential networks of queues with saturation: The Jackson-type stationary distribution and its asymptotic analysis. Math.Oper.Res., 4, 357–378.

    Article  MathSciNet  MATH  Google Scholar 

  • Platzman, L. (1977). Improved conditions for convergence in un-discounted Markov renewal programming. Operations Res., 25, 29–533.

    Article  MathSciNet  Google Scholar 

  • Pliska, S.R. (1975). A semi-group representation of the maximum expected reward vector in continuous parameter Markov decision theory. SIAM J.Control 13, 1115–1129.

    Article  MathSciNet  MATH  Google Scholar 

  • Pliska, S.R. (1976). Optimization of multitype branching processes. Management Sci., 23, 117–124.

    Article  MathSciNet  MATH  Google Scholar 

  • Plucinski, E. (1979). On some properties of discrete stochastic processes. Demonstr.Math., 12, 1089–1110.

    MathSciNet  MATH  Google Scholar 

  • Pogosyan, A.L. (see Eh.A. Danielyan).

    Google Scholar 

  • Politsjuk, L.I. & A.F. Turbin (1977). Asymptotic expansions for some characteristics of semi-Markov processes. Theor.Probab.Math. Stat., 8, 121–126.

    Google Scholar 

  • Pollett, P.K. (see T.C. Brown).

    Google Scholar 

  • Pooch, U.W. (see R. Chattergy).

    Google Scholar 

  • Popescu, G. (see O. Onicescu).

    Google Scholar 

  • Popov, V.A. (see A.L. Litvinov).

    Google Scholar 

  • Popov, N.N. (1977). Mass service systems directed by semi-Markov processes. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 94-101 (Russian).

    Google Scholar 

  • Popovici, Al.A. (1978). A Markovian stochastic model of the profit’s general rate formation. Econom.Comput.Econom.Cybernetics, Studies Res., 85-106.

    Google Scholar 

  • Porteus, E.L. (1980). Improved iterative computation of the expected discounted return in Markov and semi-Markov chains. Z.Oper.Res., Ser.A, 24, 155–170.

    MathSciNet  MATH  Google Scholar 

  • Potter, R.G. (see F.E. Kobrin).

    Google Scholar 

  • Prehn, U. (see K. Fleischmann).

    Google Scholar 

  • Prelov, V.V. (see R.L. Dobrushin).

    Google Scholar 

  • Premoli, A. (see A. Bobbio).

    Google Scholar 

  • Prilutskij, M.Kh. (see E.N. Kazantsev).

    Google Scholar 

  • Prizva, G.I. & L.V. Tihomirova (1978). On the first passage time distribution for Markov processes with discrete intervention of chance. Theory Probab.Math.Stat., 12, 129–135.

    MATH  Google Scholar 

  • Proschan, F. (see R.E. Barlow).

    Google Scholar 

  • Proschan, F. & J. Sethuraman (1976). Stochastic comparison of order statistics from heterogeneous populations, with applications to reliability. J.Multivariate Analysis, 6, 608–616.

    Article  MathSciNet  MATH  Google Scholar 

  • Protonotatios, E.N. (see A.G. Bobos & J.S. Nicolis).

    Google Scholar 

  • Pruscha, H. (1983). On continuous time learning models. Lecture Notes Statistics, 20, 175–181.

    Article  MathSciNet  Google Scholar 

  • Pujolle, G. (see E. Gelenbe).

    Google Scholar 

  • Pujolle, G. (1979). The influence of protocols on the stability conditions in packet switching networks. IEEE Trans.Commun. COM-27, 611-619.

    Google Scholar 

  • Purdue, P. (see D. Linton).

    Google Scholar 

  • Purdue, P. & D. Weiner (1977). A semi-Markov approach to stochastic compartmental models. Commun.Stat., Theory Methods A6, 1231-1243.

    Google Scholar 

  • Puri Prem, S. (1978). A generalization of a formula of Pollaczek and Spitzer as applied to a storage model. Sankhya, Ser.A, 40, 237–252.

    MathSciNet  MATH  Google Scholar 

  • Puri Prem, S. (1979). On certain problems involving non-identifiability of distributions arising in stochastic modelling. Proc. Int.Conf.Optimizing methods in Statistics, Bombay,1977, 403-418.

    Google Scholar 

  • Puri Prem, S. & S.W. Wollford (1981). On a generalized storage model with moment assumptions. J.Appl.Probab., 18, 473–481.

    Article  MathSciNet  MATH  Google Scholar 

  • Puterman, M.L. (see J.van Nunen).

    Google Scholar 

  • Pyke, R. & R.A. Schaufele (1981). Correction to: The existence and uniqueness of stationary measures for Markov-renewal processes. Ann.of Probab., 9, 348.

    Article  MathSciNet  MATH  Google Scholar 

  • Quelle, G. (1976). Dynamic programming of expectation and variance. J.Math.Analysis Appl., 55, 239–252.

    MathSciNet  MATH  Google Scholar 

  • Rabe, H. (see U. Jansen).

    Google Scholar 

  • Racicot, R.L. (1976). Approximate confidence intervals for reliability of a series system. IEEE Trans.Reliab., R-25, 265–269.

    Article  Google Scholar 

  • Rajarshi, M.B. (1974). Success runs in a two-state Markov chain. J.Appl.Probab., 11, 190–192.

    Article  MathSciNet  MATH  Google Scholar 

  • Ramalhoto, M.F. (see D.H. Girmes).

    Google Scholar 

  • Ramakrishnan, K.G. (see J. McKenna & D. Mitra).

    Google Scholar 

  • Ramamurthy, K. (see K.B. Athreya & N.K. Jaiswal).

    Google Scholar 

  • Ramanarayanan, R. (1981). Explicit steady state solution for a Markovian inventory system. Stat.Neerl., 35, 215–219.

    Article  MathSciNet  MATH  Google Scholar 

  • Ramanarayanan, R. & K. Usha (1981). General analysis of systems in which a 2-unit system is a sub-system. Math.Operationsforsch. Stat., 12, 629–637.

    MathSciNet  MATH  Google Scholar 

  • Ramaswami, V. (1981). Algorithms for a continuous-review (s, S) inventory system. J.Appl.Probab., 18, 461–472.

    Article  MathSciNet  MATH  Google Scholar 

  • Rangan, A. (see A.H. Kairo).

    Google Scholar 

  • Rangaswamy, N.S. (see N.K. Jaiswal).

    Google Scholar 

  • Rao Chennupati, R. (see A.M. Kshirsagar).

    Google Scholar 

  • Rao, M.R. (see Y.M.I. Dirickx).

    Google Scholar 

  • Rao, S.S. (see M. Oral).

    Google Scholar 

  • Rappaport, D. (see J. Dayan).

    Google Scholar 

  • Raugi, A. (1980). Quelques remarques sur le théorème de la limite centrale sur un groupe de Lie. C.R.Acad.Sci.Paris, Ser.A, 290, 103–106.

    MathSciNet  MATH  Google Scholar 

  • Ravichandran, N. & R. Subramanian (1980). An n-unit priority redundant system. J.Math.Phys.Sci., 14, 85–94.

    MathSciNet  MATH  Google Scholar 

  • Reetz, D.A. (1976). A decision exclusion algorithm for a class of Markovian decision processes. Z.Operat.Res., Ser.A, 20, 125–131.

    MathSciNet  MATH  Google Scholar 

  • Reetz, D.A. (1980). Kontrahierende endliche Markoffsche Entscheidungsprozesse. G. Marchai un H.J. Matzenbacher Wissenschaftsverlag, Berlin.

    Google Scholar 

  • Reiman, M.I. (see J.M. Harrison).

    Google Scholar 

  • Reinhard, J.M. (see J. Janssen).

    Google Scholar 

  • Reinhard, J.M. (1980). Jeux de survie économique: un modèle semi-markovien. Cah.Cent.Etud.Rech.Oper., 22, 101–110.

    MathSciNet  MATH  Google Scholar 

  • Reinhard, J.M. (1981). A semi-Markovian game of economic survival. Scand.Actuarial J., 23-38.

    Google Scholar 

  • Reinhard, J.M. (1982). Identités du type Baxter-Spitzer pour une classe de promenades aléatoires semi-markoviennes. Ann.Inst. Henri Poincaré, Sect.B, 18, 319–333.

    MathSciNet  MATH  Google Scholar 

  • Reiser, M. (see S.S. Lavenberg).

    Google Scholar 

  • Reiser, M. (1977). Numerical methods in separable queueing networks. Algorithm.Meth.Probab., Stud.Manage.Sci., 7, 113–142.

    Google Scholar 

  • Reiser, M. (1981). Mean value analysis and convolution method for queue-dependent servers in closed queueing systems. Performance Eval., 1, 7–18.

    Article  MathSciNet  MATH  Google Scholar 

  • Renger, K. (see G. Lauenstein).

    Google Scholar 

  • Resnick, S.I. (see J.M. Harrison).

    Google Scholar 

  • Reznikov, S.I. (1979). A new proof for a limit theorem of the phase enlargement type for semi-Markov processes. Teor.Sluchajnykh Protsessov, 7, 85-103 (Russian).

    Google Scholar 

  • Reznikov, S.I. (1980). A limit theorem of the type of phase enlargement for random processes which are complemented to weakly inhomogeneous Markov processes. Dopov.Akad.Nauk Ukr.RSR, Ser.A, 16-18 (Ukrainian).

    Google Scholar 

  • Reznikov, S.I. (1980). State enlargement of random processes that are complemented to Markov processes. Ukr.Math.J., 31, 539–544.

    Article  MATH  Google Scholar 

  • Ricciardi, L.M. (1980). Stochastic equations in neurobiology and population biology. Lecture Notes Biomath., 39, 248–263.

    Article  MathSciNet  Google Scholar 

  • Richter, K. (1982). Dynamische Aufgaben der diskreten Optimierung. Akademie-Verlag, Berlin.

    MATH  Google Scholar 

  • Rieder, U. (1975). Bayesian dynamic programming. Adv.Appl.Probab., 7, 330–348.

    Article  MathSciNet  MATH  Google Scholar 

  • Rieder, U. (1976). On the characterization of optimal policies in non-stationary dynamic programs. Z.Angew.Math.mech., 56, Sonderheft, T359-T360.

    Google Scholar 

  • Rishel, R. (1982). A partially observed inventory problem. Lect. Notes Control Inf.Sci., 43, 345–353.

    Article  MathSciNet  Google Scholar 

  • Ritchie, E. & P. Wilcox (1977). Renewal theory forecasting for stock control. Eur.J.Oper.Res., 1, 90–93.

    Article  MATH  Google Scholar 

  • Robinson, D. (1978). Optimization of priority queues — a semi-Markov decision chain approach. Manage.Sci., 24, 545–553.

    Article  MATH  Google Scholar 

  • Rohal-Ilkiv, B. & J. Skakala (1977). 2-unit redundant systems with replacement & repair. IEEE Trans.Re1iab., R-26, 294–296.

    Google Scholar 

  • Rolski, T. (1977). A relation between imbedded Markov chains in piecewise Markov processes. Bull.Acad.Polon.Sci., Ser.Sci. Math.astron.phys., 25, 181–189.

    MathSciNet  MATH  Google Scholar 

  • Romanov, A.K. & A.I. Terekhov (1980). Some models of the workforce dynamics in organizations. Optimizatsiya, 25, 124–138 (Russian).

    Google Scholar 

  • Rosberg, Z. (1980). A positive recurrence criterion associated with multidimensional queueing systems. J.Appl.Probab., 17, 790–801.

    Article  MathSciNet  MATH  Google Scholar 

  • Rosberg, Z. (1982). Semi-Markov decision processes with polynomial reward. J.Appl.Probab., 19, 301–309.

    Article  MathSciNet  MATH  Google Scholar 

  • Rosemann, H. (1981). Zuverlaessigkeit und Verfuegbarkeit techniser Anlagen und Geraete. Mit praktischen Beispielen von Berechnung und Einsatz in Schwachstellenanalysen. Springer-Verlag, Berlin.

    Google Scholar 

  • Rosenshine, M. & R.C. Rue (1981). Optimal control for entry of many classes of customers to an M/M/1 queue. Nav.Res.Logist.Q., 28, 489–495.

    Article  MathSciNet  MATH  Google Scholar 

  • Ross, S.M. (1976). On the time to first failure in multicomponent exponential reliability systems. Stochastic Processes Appl., 4, 167–173.

    Article  MathSciNet  MATH  Google Scholar 

  • Roth, E. (see A.R. Odoni).

    Google Scholar 

  • Roussas, G.G. (see M.G. Akritas).

    Google Scholar 

  • Rubchinskij, A.A. (see B.A. Gennison).

    Google Scholar 

  • Rubin, I. (1979). Message delays in FDMA and TDMA communcation channels. IEEE Trans.Commun.C0M-27, 769-777.

    Google Scholar 

  • Rubinovitch, M. (see Z. Barzily).

    Google Scholar 

  • Rumyantsev, N.V. (1982). Investigation of a service system with heating at the end of the occupation time by methods of the theory of semi-Markov processes. Kibernetika, 120-122 (Russian).

    Google Scholar 

  • Rue, R.C. (see M. Rosenshine).

    Google Scholar 

  • Ryan, T.A. jun. (1976). A multidimensional renewal theorem. Ann.of Probab., 4, 656–661.

    Article  MATH  Google Scholar 

  • Rybko, A.N. (1981). Stationary distributions of time-homogeneous Markov processes modelling message switching communication networks. Probl.Inf.Transm., 17, 49–63.

    MathSciNet  MATH  Google Scholar 

  • Rybko, A.N. (1982). Existence conditions for a steady-state mode for two types of communications networks with message switching. Probl.Inf.Transm., 18, 76–84.

    MathSciNet  MATH  Google Scholar 

  • Rykov, V. (see S. Jolkof).

    Google Scholar 

  • Ryzhikov, Yu.I (see G.K. Nikiforov).

    Google Scholar 

  • Ryzhikov, Yu.I. (1977). Servicing of priorityless flow of non-uniform requests in a multichannel Markov system. Probl.control Inform.Theory 6, 431–436.

    MATH  Google Scholar 

  • Sadjaki, D. (see F. Bestwick).

    Google Scholar 

  • Sahay, B. (see W. Lennox).

    Google Scholar 

  • Sahin, I. (see Y. Balcer).

    Google Scholar 

  • Sahin, I. (1978). Cumulative constrained sojourn times in semi-Markov processes with an application to pensionable service. J.Appl. Probab., 15, 531–542.

    Article  MathSciNet  MATH  Google Scholar 

  • Sakino, E. (see T. Inagaki).

    Google Scholar 

  • Sanderson, A.C. (see T.W. Calvert).

    Google Scholar 

  • Santner, T.J. (see C.C. Brown).

    Google Scholar 

  • Shanthikumar, J.G. (see R.G. Sargent).

    Google Scholar 

  • Satia, J.K. (see R.E. Lave).

    Google Scholar 

  • Satyanarayana, A. (1982). A unified formula for analysis of some network reliability problems. IEEE Trans.Reliab. R-31, 23–32.

    Article  Google Scholar 

  • Sauer, C.J. (see S.S. Lavenberg).

    Google Scholar 

  • Sauer, W. (1980). Eine symbolische Methode zur Berechnung der mittleren Dauer stochastischer technologischer Prozesse. Wiss. Z.Tech.Univ.Dresd., 29, 261–265.

    MathSciNet  MATH  Google Scholar 

  • Saw, Y. (see M. Motoori).

    Google Scholar 

  • Schader, M. (see O. Optiz).

    Google Scholar 

  • Schael, M. (see M. Kolonko).

    Google Scholar 

  • Schael, M. (1975). Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal. Z.Wahrscheinlichkeitstheorie verw.Gebiete, 32, 179–196.

    Article  MATH  Google Scholar 

  • Schael, M. (1975). On dynamic programming: Compactness of the space of policies. Stochastic Processes Appl., 3, 345–364.

    Article  MathSciNet  MATH  Google Scholar 

  • Schael, M. (1979). On dynamic programming and statistical decision theory. Ann.Statist., 7, 432–445.

    Article  MathSciNet  MATH  Google Scholar 

  • Schassberger, R. (see A.D. Barbour, W.E. Helm & A. Hordijk).

    Google Scholar 

  • Schassberger, R. (1976). On the equilibrium distribution of a class of finite-stage generalized semi-Markov processes. Math.Oper. Res., 1, 395–406.

    Article  MathSciNet  MATH  Google Scholar 

  • Schassberger, R. (1978). Insensitivity of steady-state distributions of generalized semi-Markov processes, I, II. Ann.of Probab., 5, 87-89, 1977 & 6, 85–93.

    MathSciNet  MATH  Google Scholar 

  • Schassberger, R. (1978). The insensitivity of stationary probabilities in networks of queues. Adv.Appl.Probab., 10, 906–912.

    Article  MathSciNet  MATH  Google Scholar 

  • Schassberger, R. (1978). Insensitivity of steady-state distributions of generalized semi-Markov processes with speeds. Adv.Appl. Probab., 10, 836–851.

    Article  MathSciNet  MATH  Google Scholar 

  • Schassberger, R. (1979). A definition of discrete product form distributions. Z.Oper.Res., Ser.A 23, 189–195.

    MathSciNet  MATH  Google Scholar 

  • Schaufele, R.A. (see R. Pyke).

    Google Scholar 

  • Schaufele, R.A. (1981). A class of time-reversible semi-Markov processes. Can.J.Stat., 9, 39–56.

    Article  MathSciNet  MATH  Google Scholar 

  • Scheaffer, R.L. (see R.S. Leavenworth).

    Google Scholar 

  • Schellhaas, H. (1974). Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung. Z.Operat.Res., Ser.A 18, 91–104.

    MathSciNet  MATH  Google Scholar 

  • Schellhaas, H. (1979). Ueber Semi-Markoffsche Entscheidungsprozesse mit endlichem Horizont. Proc.DGOR Meet.Oper.Res., Berlin, 122-129.

    Google Scholar 

  • Schellhaas, H. (1979). Semi-regenerative processes with unbounded rewards. Math.Oper.Res., 4, 70–78.

    Article  MathSciNet  MATH  Google Scholar 

  • Schellhaas, H. (1980). Markov renewal decision processes with finite horizon. OR Spektrum 2, 33–40.

    Article  MATH  Google Scholar 

  • Schneeweiss, Ch. (1974). Dynamisches Programmieren. Physica Paperback, Physica-Verlag, Wien.

    Google Scholar 

  • Scheuer, E.M. (see L.A. Baxter & W.R. Blischke).

    Google Scholar 

  • Schick, I.C. (see S.B. Gershwin).

    Google Scholar 

  • Schmee, J. (see E. Hannan).

    Google Scholar 

  • Schmidt, V. (see U. Arndt).

    Google Scholar 

  • Schramm, K. (1980). Konvergenzvergleiche bei Loesungen linearer Differenzengleichungen mit konstanten Koefficienten. Z.Oper. Res., Ser.A 24, 125–136.

    MathSciNet  MATH  Google Scholar 

  • Schweitzer, P.J. (see A. Federgruen, B. Gavish & A. Hordijk).

    Google Scholar 

  • Schweitzer, P.J. (1982). Solving MDP functional equation by lexicographic optimization. RAIR0, Rech.Opér. 16, 91–98.

    MathSciNet  MATH  Google Scholar 

  • Schweitzer, P.J. (1983). On the solvability of Bellman’s functional equations for Markov renewal programming. J.Math.Analysis Appl., 96, 13–23.

    Article  MathSciNet  MATH  Google Scholar 

  • Schwetman, H.D. (see G. Balbo).

    Google Scholar 

  • Scif, F.J. (1981). Stochastic and cooperative model of excocytotic secretion of thyrotropin. Proc.6th Conf.Probability Theory, Brasov, 513-520.

    Google Scholar 

  • Semenov, A.T. (1976). Sojourn times of a semi-Markov random walk on the semi-axis. Lith.Math.J. 15, 659–664.

    Article  MATH  Google Scholar 

  • Sengupta, J.K. (see S.K. Gupta).

    Google Scholar 

  • Serdakov, A.S. (see O.N. Martynenko).

    Google Scholar 

  • Sereda, V.I. (see V.V. Anisimov).

    Google Scholar 

  • Serfozo, R.F. (1979). An equivalence between continuous and discrete time Markov decision processes. Oper.Res., 27, 616–620.

    Article  MathSciNet  MATH  Google Scholar 

  • Sergachev, O.V. (1979). On the analysis of dynamic operating modes of deterministic automata. Autom.Control Comput.Sci., 13, 13–17.

    MATH  Google Scholar 

  • Sethuraman, J. (see F. Proschan).

    Google Scholar 

  • Sevcik, K.C. (1982). Queueing networks and their computer system applications: An introductory survey. Proc.NAT ASI Deterministic and Stochastic Scheduling, Durham, 211-222.

    Google Scholar 

  • Shahul, H.M.A. (see S. Kalpakam).

    Google Scholar 

  • Shakhbazov, A.A. (1982). Limiting distribution of the time of first entry for semi-Markov processes and its application in reliability theory. Eng.Cybern., 20, 82–90.

    MATH  Google Scholar 

  • Shakhbazov, A.A. & A.D. Soloviev (1981). Nonhomogeneous standby with renewal. Eng.Cybern., 19, 30–38.

    MATH  Google Scholar 

  • Shanthikumar, J.G. & R.G. Sargent (1981). An algorithmic solution for queueing model of a computer system with interactive and batch jobs. Performance Eval., 1, 344–357.

    MathSciNet  MATH  Google Scholar 

  • Sharma, J. (see K.B. Misra).

    Google Scholar 

  • Sharma, S.C. (see Y.P. Gupta).

    Google Scholar 

  • Sharma, S.C. (1976). Cumulative processes associated with Markov renewal processes in space. J.Math.Sci., 10, 63–68.

    Google Scholar 

  • Shedler, G.S. (see D.L. Iglehart).

    Google Scholar 

  • Shedler, G.S. & D.R. Slutz (1981). Irreducibility in closed multiclass networks of queues with priorities: passage times of a marked job. Performance Eval., 1, 334–343.

    MathSciNet  MATH  Google Scholar 

  • Shedler, G.S. & J. Southard (1982). Regenerative simulation of networks of queues with general service times: passage through subnetworks. IBM J.Res.Dev., 26, 625–633.

    Article  MathSciNet  MATH  Google Scholar 

  • Shibanov, S.E. (see A.S. Chebotarev).

    Google Scholar 

  • Shishonok, N.A. (see V.E. Dikarev).

    Google Scholar 

  • Shlesinger, M.F. (see U. Landman).

    Google Scholar 

  • Shura-Bura, A.E. (see E.V. Dzirkal).

    Google Scholar 

  • Shurenkov, V.M. (see Ju.S. Davidovic & Ya.I. Elejko).

    Google Scholar 

  • Shurenkov, V.M. (1977). A time substitution which preserves the semi-Markov property and regularity conditions. Theory Probab.Math. Stat., 14, 159–163.

    MATH  Google Scholar 

  • Sibirskaya, T.K. (1982). On a certain approach to the determination of the characteristics of closed queueing networks in analytic form. Izvestija Akad.Nauk Mold.SSR, Ser.Fiz.-Tekh.Mat.Nauk, 55-59 (Russian).

    Google Scholar 

  • Siedersieben, J. (1981). Dynamically optimized replacement with a Markovian renewal process. J.Appl.Probab., 18, 641–651.

    Article  MathSciNet  Google Scholar 

  • Sigalotti, L. (1976). Particulari processi markoffiani d’arrivo che si arrestano in intervalli finiti di tempo e che presentano la scambiabilita degli incrementi. Rend.Ist.Mat.Univ.Trieste, 7, 173–181 (Italian).

    MathSciNet  MATH  Google Scholar 

  • Silvestrov, D.S. (see D. Banach & E.I, Kaplan).

    Google Scholar 

  • Silvestrov, D.S. (1980). Mean hitting times of semi-Markov processes and queueing networks. Elektron.Informationsverarbeitung Kybernetik, 16, 399–415 (Russian).

    MathSciNet  Google Scholar 

  • Silvestrov, D.S. (1980). Exponential bounds in ergodic theorems for regenerative processes. Elektron.Informationsverarbeitung Kybernetik, 16, 461–463 (Russian).

    MathSciNet  Google Scholar 

  • Silvestrov, D.S. (1980). Synchronized regenerative processes and explicit estimates of the convergence rate in ergodic theorems. Dopov.Akad.nauk Ukr.RSR, Ser.A, 21-24 (Ukrainian).

    Google Scholar 

  • Silvestrov, D.S. & G.T. Tursunov (1980). General limit theorems for sums of controlled random variables. II. Theory Probab.Math. Stat., 20, 131–141.

    Google Scholar 

  • Simon, B. (see R.L. Disney).

    Google Scholar 

  • Singh, C. (1980). Equivalent rate approach to semi-Markov processes. IEEE Trans.Reliab. R-29, 273–274.

    Article  Google Scholar 

  • Sinha, S.M. (see M. Agarwal & D.V.S. Kapil).

    Google Scholar 

  • Sityuk, V.N. (see V.V. Anisimov).

    Google Scholar 

  • Sityuk, V.N. (1981). On the limit behaviour of semi-Markov systems with inhomogeneous probabilities of failures. Dokl.Akad.Nauk Ukr.SSR, Ser.A, 24-27 (Russian).

    Google Scholar 

  • Skakala, J. (see B. Rohal-Ilkiv).

    Google Scholar 

  • Skitovitch, V.P. (1976). A system of mass maintenance with deleted and restored instruments. Control, reliability and navigation. No 3. Interuniv.Collect.Sci.Works, Saransk, 72-76 (Russian).

    Google Scholar 

  • Sklyarevich, F.A. (1980). Allowance for structural variability of computer systems. Autom.Control Comput.Sci., 14, 52–56 (Russian).

    MATH  Google Scholar 

  • Skorohod, A.V. (see I.I. Gikman & T.I. Nasirova).

    Google Scholar 

  • Sladky, K. (1977). On the optimality conditions for semi-Markov decision processes. Trans.7th Prague Conf. Vol.A, 1974, 555–562.

    MathSciNet  Google Scholar 

  • Slutz, D.R. (see G.S. Shedler).

    Google Scholar 

  • Smagin, V.A. (1975). Mean frequency of failures of a system with unreliable spare parts. Izvestija Akad.Nauk SSSR, Tehn.Kibernet., 118-120 (Russian).

    Google Scholar 

  • Smirnov, S.N. (see G.P. Klimov).

    Google Scholar 

  • Sniedovich, M. (1978). Dynamic programming and principles of optimality. J.Math.Analysis Appl., 65, 586–606.

    Article  MathSciNet  MATH  Google Scholar 

  • Sobel, M.J. (1982). The variance of discounted Markov decision processes. J.Appl.Probab., 19, 794–802.

    Article  MathSciNet  MATH  Google Scholar 

  • Soloviev, A.D. (see B.V. Gnedenko & A.A. Shakhbazov).

    Google Scholar 

  • Sommer, C.J. (see S.W. Lagakos).

    Google Scholar 

  • Sonderman, D. (1980). Comparing semi-Markov processes. Math.Oper. Res., 5, 110–119.

    Article  MathSciNet  MATH  Google Scholar 

  • Sonnenschein, J. (see R. Consael).

    Google Scholar 

  • Southard, J. (see G.S. Shedler).

    Google Scholar 

  • Soyka, M.G. (see Ch.J. Mode).

    Google Scholar 

  • Soyster, A.D. & D.I. Toof (1976). Some comparative and design aspects of fixed cycle production. Naval Res.Logist.Q., 23, 437–454.

    Article  MathSciNet  MATH  Google Scholar 

  • Spaniol, O. (1979). Modelling of local computer networks. Proc.4th Int.Symp.Performance of comput Systems, Vienna, 503-516.

    Google Scholar 

  • Spreen, D. (see A. Federgruen).

    Google Scholar 

  • Spreen, D. (1981). Reducing the computational complexity of the multichain policy iteration algorithm in undiscounted Markov renewal programming. Methods Oper.Res., 44, 203–211.

    MATH  Google Scholar 

  • Spreen, D. (1981). A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs. Z.Oper.Res., Ser.A 25, 225–233.

    MathSciNet  MATH  Google Scholar 

  • Srinivasan, S.K. (see D. Bhaskar).

    Google Scholar 

  • Srinivasan, S.K. (1974). Stochastic point processes. Ch.Griffin & Co.

    Google Scholar 

  • Srinivasan, S.K. & R. Subramanian (1980). Probabilistic analysis of redundant systems. Lecture Notes in Economics & Mathematical Systems, 175.

    Google Scholar 

  • Srinivasan, S.K. & N. Venugopalacharyulu (1976). Analytic solution of a finite dam with bounded input. J.Math.Phys.Sci., Madras, 10, 141–164.

    MathSciNet  MATH  Google Scholar 

  • Srivastava, H.M. (see H.B. Kekre).

    Google Scholar 

  • Stadje, W. (1980). Reducierte Semi-Markov Prozesse. Methods Oper. Res., 37, 467–476.

    MATH  Google Scholar 

  • Staniewsky, P. & R. Weinfeld (1980). Optimization of denumerable semi-Markov decision processes. Syst.Sci., 6, 129–141.

    Google Scholar 

  • Stefanski, L.A. (1982). An application of renewal theory to software reliability. Proc.27th Conf.Design of Experiments, Raleigh, 101-118.

    Google Scholar 

  • Steinhardt, U. (see K. Neumann).

    Google Scholar 

  • Stengos, D. & L.C. Thomas (1980). The blast furnaces problem. Eur. J.Oper.Res., 4, 330–336.

    Article  MATH  Google Scholar 

  • Stepanov, S.N. (1981). Probabilistic characteristics of an incomplete accessible multi-phase service system with several types of repeated call. Probl.Control Inf.Theory, 10, 387–401 (Russian).

    MATH  Google Scholar 

  • Steudel, H.J. (see S.M. Pandit).

    Google Scholar 

  • Stidham, S. jun (see Y.Jo Kyung, S.G. Johansen & J.van Nunen).

    Google Scholar 

  • Stiff1er, J.J. (1978). The reliability of a fault-tolerant configuration having variable coverage. IEEE Trans.Comput.C-27, 1195-1197.

    Google Scholar 

  • Stokalski, A. (1976). Optimization of the control schedule for Markov models of an operation system. Podstawy Sterowania, 6, 57–70 (Polish).

    MathSciNet  MATH  Google Scholar 

  • Stoyan, D. (see D. Koenig).

    Google Scholar 

  • Stoyan, D. (1977). Qualitative Eigenschaften und Abschaetzungen stochastischer Modelle. R. Oldenbourg Verlag, Muenchen. Streller, A. (see P. Franken).

    Google Scholar 

  • Subramanian, R. (see K.P. Kistner, N. Ravichandran & S.K. Srinivasan). Sugimoto, F. (see S. Osaki).

    Google Scholar 

  • Sukhov, Yu.M. (see R.L. Dobrushin & M.Ya. Kelbert).

    Google Scholar 

  • Sum, H. (see I.I. Ezov).

    Google Scholar 

  • Szasz, D. (1974). A limit theorem for semi-Markov processes. J.Appl. Probab., 11, 521–528.

    Article  MathSciNet  MATH  Google Scholar 

  • Tadzhiev, A. (see V.S. Korolyuk).

    Google Scholar 

  • Tadzhiev, A. (1978). Asymptomatic expansion for the distribution of absorption time of a semi-Markov process. Ukr.Math.J., 30, 331–335.

    Article  MATH  Google Scholar 

  • Tadzhiev, A. (1978). Asymptomatic expansion for the distribution of absorption time of a semi-Markov process. The case of several ergodic subsets. Izvestija Akad.Nauk Turkm.SSR, Ser.Fiz.-teh. him.geol.Nauk., 12-18 (Russian).

    Google Scholar 

  • Takacs, L. (1976). On seome recurrence equations in a Banach algebra Acta Sci.Math., 38, 399–416.

    MathSciNet  MATH  Google Scholar 

  • Takacs, L. (1977). On the ordered partial sums of real random variables. J.Appl.Probab., 14, 75–88.

    Article  MathSciNet  MATH  Google Scholar 

  • Takacs, L. (1977). Combinatorial methods in the theory of stochastic processes, 2nd edition. R.E.Krieger Publ.Co., New York.

    MATH  Google Scholar 

  • Takacs, L. (1978). On fluctuations of sums of random variables. Studies in Probab.Ergodic Theory, Adv.Math., Suppl.Stud.Vol., 2, 45–93.

    MathSciNet  Google Scholar 

  • Takahashi, H. & M. Woodroofe (1981). Asymptotic expansions in nonlinear renewal theory. Commun.Stat., Theory Methods A 10, 2113–2135.

    Article  MathSciNet  Google Scholar 

  • Takami, I. (see T. Inagaki).

    Google Scholar 

  • Takeda, M. (see S. Osaki).

    Google Scholar 

  • Tamaki, M. (1979). Recognizing both the maximum and the second maximum of a sequence. J.Appl.Probab., 16, 803–812.

    Article  MathSciNet  MATH  Google Scholar 

  • Tamaki, M. (1982). An optimal parking problem. J.Appl.Probab., 19, 803–814.

    Article  MathSciNet  MATH  Google Scholar 

  • Tamarkin, M.B. (see V.D. Maishakov).

    Google Scholar 

  • Tambouratzis, D.G. (1979). A generalization of the M/G/1 queue. Bull.Greek Math.Soc., 20, 106–120.

    MathSciNet  MATH  Google Scholar 

  • Tammela, Y. (1980). Optimal control of production processes with complex structure. A model with complete information. Izvestija Akad.Nauk Ehst.SSR, Fiz., Math., 29, 201–207 (Russian).

    MathSciNet  MATH  Google Scholar 

  • Tan, H.H. (1975). An algorithm to compute the resolvent of a stochastic matrix with application to Markov decision processes. IEEE Trans.Systems Ma; Cybernetics, SMC-5, 617-620.

    Google Scholar 

  • Tanaka, K. (see H. Homma & S. Iwase).

    Google Scholar 

  • Tanaka, K. & K. Wakuta (1976). On Markov games with the expected average reward criterion, II. Sci.Rep.Niigata Univ., Ser.A 13, 49–54.

    MathSciNet  MATH  Google Scholar 

  • Tanaka, K. & K. Wakuta (1976). On semi-Markov games. Sci.Rep.Niigata Univ., Ser.A 13, 55–64.

    MathSciNet  MATH  Google Scholar 

  • Tanaka, K. & K. Wakuta (1978). On continuous time Markov games with countable state space. J.Operations Res.Soc.Japan, 21, 17–28.

    MathSciNet  MATH  Google Scholar 

  • Taylor, H.M. (1975). Optimal replacement under additive damage and other failure models. Naval Res.Logist.Quart., 22, 1–18.

    Article  MathSciNet  MATH  Google Scholar 

  • Tatsuno, K. (see T. Nishida).

    Google Scholar 

  • Teghem, J. jun. (1979). Use of discrete transforms for the study of a GI/M/s queue with impatient customer phenomena. Z.Operat.Res., Ser.A 23, 95–106.

    MathSciNet  MATH  Google Scholar 

  • Ten Hoopen, M. (1977). Incidental distortions in a point processes. Biom.J., 19, 3–7.

    MATH  Google Scholar 

  • Teplickij, M.G. (1977). Problem of the optimal control of a Markov chain with incomplete information. Izvestija Akad.Nauk.SSSR, tehn.Kibernet., 89-94 (Russian).

    Google Scholar 

  • Tepleckij, M.G. (1978). On some problems concerning control of a finite Markov chain. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 96-100 (Russian).

    Google Scholar 

  • Terekhov, A.I. (see A.K. Romanov).

    Google Scholar 

  • Teugels, J.L. (1974). On Markov success chains. Proc.Belgo-Israeli Coll.Oper.Res., Louvain, 1972, 251–264.

    MathSciNet  Google Scholar 

  • Teugels, J.L. (1976). A bibliography on semi-Markov processes. J.Comput.Appl.Math., 2, 125–144.

    Article  MathSciNet  MATH  Google Scholar 

  • Thomas, L.C. (see D. Stengos).

    Google Scholar 

  • Thomas, L.C. (1981). Second order bounds for Markov decision processes. J.Math. Anal. Appl., 80, 294–297.

    Article  MathSciNet  MATH  Google Scholar 

  • Thomas, L.C. (1982). The Wijngaard-Stidham bisection method and replacement models. IEEE Trans, Reliab. R-31, 482–484.

    Article  Google Scholar 

  • Thomas, L.C. & L. Yeh (1983). Adaptive control of M/M/1 queues — continuous-time Markov decision processes approach. J.Appl. Probab., 20, 368–379.

    Article  MathSciNet  MATH  Google Scholar 

  • Thompson, M.E. (1981). Estimation of the parameters of a semi-Markov process from censored records. Adv.Appl.Probab., 13, 804–825.

    Article  MATH  Google Scholar 

  • Thorin, O. (1982). Probabilities of ruin. Scand.Actuarial J., 65-102.

    Google Scholar 

  • Tien, T.M. (1977). Generalized piece-wise linear Markov processes for queueing and reliability theory. Math.Operationsforsch. Stat., Ser.Optimization, 8, 419–431.

    Article  MATH  Google Scholar 

  • Tihomirova, L.V. (see G.I. Prizva).

    Google Scholar 

  • Tijms, H.C. (see A. Federgruen & A. Hordijk).

    Google Scholar 

  • Tijs, S.H. (1980). Stochastic games with one big action space in each state. Methods Oper.Res., 38, 161–173.

    MATH  Google Scholar 

  • Tikhonov, V.I. (see M.A. Mironov).

    Google Scholar 

  • Timoshenko, A.R. (see V.D. Malshakov).

    Google Scholar 

  • Toeroek, T. (see E. Gardos & T. Gergely).

    Google Scholar 

  • Toeroek, T. (1979). Interleaved memory systems with Markovian. requests. Proc.4th Int.Symp.Performance Comp.Systems, Vienna, 421-428.

    Google Scholar 

  • Tomko, J. (1981). A limit theorem for Markov renewal processes. Proc.1st Pannonian Symp.Math.Statistics, Bad Tatzmannsdorff. Lecture Notes Statist., 8, 277–283.

    Article  MathSciNet  Google Scholar 

  • Tomko, J. (1981). Semi-Markov analysis of an (E//K)/G/1 queue with finite waiting room. Colloq.Math.Soc.Janos Bolyai, 24, 381–389.

    MathSciNet  Google Scholar 

  • Tomusyak, A.A. (see V.S. Korolyuk).

    Google Scholar 

  • Toof, D.I. (see A.D. Soyster).

    Google Scholar 

  • Tormey, D.C. (see J. Crowley).

    Google Scholar 

  • Towsley, D. (1980). Queueing network models with state-dependent routing. J.Assoc.Comput.Mach., 27, 323–337.

    Article  MathSciNet  MATH  Google Scholar 

  • Treier, V.N. (1974). Kinetic foundations for the theory of life-length and reliability of machines equipment. Doklady Akad. Nauk BSSR 18, 333–336 (Russian).

    MATH  Google Scholar 

  • Trueman, R.E. (1977). An introduction to quantitative methods for decision making, 2nd edition. Holt, Rinehart and Winston, New York.

    MATH  Google Scholar 

  • Tsaregradskij, I.P. (1982). On a queueing system with an infinite number of locally interacting devices. Teor.Veroyatn.Primen., 27, 583–587.

    MATH  Google Scholar 

  • Tsur, S. (1978). Analysis of queueing networks in which processes exhibit locality-transition behaviour. Inform.Processing Letters, 7, 20–23.

    Article  MATH  Google Scholar 

  • Turbin, A.F. (see S.M. Brodi, V.S. Korolyuk, V.N. Kuznetsov, B.G. Levinskij & L.I. Politsjuk).

    Google Scholar 

  • Tursunov, G.T. (see D.S. Silvestrov).

    Google Scholar 

  • Tweedie, R.L. (see E. Arjas).

    Google Scholar 

  • Unkelbach, H.D. (1979). Convergence to equilibrium in a traffic model with restricted passing. J.Appl.Probab., 16, 881–889.

    Article  MathSciNet  MATH  Google Scholar 

  • Usha, K. (see R. Ramanarayanan).

    Google Scholar 

  • Usha, K. (1979). Reliability and availability of 2-unit warm-standby system with random transition rates. IEEE Trans.Reliab. R-28, 333.

    Article  Google Scholar 

  • Ushakov, I.A. (see I.V. Pavlov).

    Google Scholar 

  • Ushakov, I.A. (1980). An approximate method of calculating complex systems with renewal. Eng.Cybern., 18, 76–83.

    Google Scholar 

  • Varaiya, P. & J. Walrand (1980). Interconnections of Markov chains and quasi-reversible queueing networks. Stochastic Processes Appl., 10, 209–219.

    Article  MathSciNet  MATH  Google Scholar 

  • Varaiya, P. & J. Walrand (1080). Sojourn times and the overtaking condition in Jacksonian networks. Adv.Appl.Probability, 12, 1000–1018.

    MathSciNet  Google Scholar 

  • Venkatakrishnan, K.S. (see K.P. Kistner).

    Google Scholar 

  • Venugopalacharyulu, N. (see S.K. Srinivasan).

    Google Scholar 

  • Verma, P.K. (see A. Chatterjee).

    Google Scholar 

  • Venues, D. (1981). Optimal stochastic control under reliability constraints. Lect.Notes Contr.Inf.Sci., 36, 227–234.

    Article  Google Scholar 

  • Vickson, R.G. (1980). Generalized value bounds and column reduction in finite Markov decision problems. Oper.Res., 28, 387–394.

    Article  MathSciNet  MATH  Google Scholar 

  • Vinogradskaya, T.M. (see B.A. Geninson).

    Google Scholar 

  • Vjazemskii, V.O. (1977). On the transformation of recurrent random flows of signals in the path of an information-measuring system. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 142-152 (Russian).

    Google Scholar 

  • Vjugin, O.V. (1977). Asymptotic moments for branching processes close to critical ones. Theory Probab.Appl., 21, 825–833.

    Article  Google Scholar 

  • Vojna, A.A. (see V.V. Anisimov).

    Google Scholar 

  • Vojna, A.A. (1980). Occupation time of a fixed set of states and consolidation of stochastic processes with arbitrary phase space. Theory Probab.Math.Stat., 20, 35–44.

    MATH  Google Scholar 

  • Vojna, A.A. (1983). Asymptotic analysis of systems with a continuous component. Cybernetics, 18, 516–524.

    Article  Google Scholar 

  • Vosvrda, M. (see C. Cvetanov).

    Google Scholar 

  • Vranceanu, G. (1978). Models for non-euclidean hyperbolic geometry. Studii Cerc.Mat., 30, 477–478 (Roumanian).

    MathSciNet  MATH  Google Scholar 

  • Vrieze, O.J. (see A. Hordijk).

    Google Scholar 

  • Wagner, H.M. (1973). Principles of operations research. With applications to managerial decisions. Moskva Verlag Mir (Russian). Wakuta, K. (see S. Iwase & K. Tanaka).

    Google Scholar 

  • Wakuta, K. (1981). Semi-Markov decision processes with incomplete state observation. J.Oper.Res.Soc.Japan, 24, 95–109.

    MathSciNet  MATH  Google Scholar 

  • Wakuta, K. (1982). Semi-Markov decision processes with incomplete state observation. Discounted cost criterion. J.Oper.Res.Soc. Japan, 25, 351–362.

    MathSciNet  MATH  Google Scholar 

  • Waldmann, K.-H. (1982). On two-state quality control under Markovian deterioration. Metrika, 29, 249–260.

    Article  MathSciNet  MATH  Google Scholar 

  • Walrand, J. (see P. Varaiya).

    Google Scholar 

  • Walrand, J. (1982). On the equivalence of flows in networks of queues. J.Appl.Probab., 19, 195–203.

    Article  MathSciNet  MATH  Google Scholar 

  • Walrand, J. (1982). Poisson flows in single class open networks of quasireversible queues. Stochastic Processes Appl., 13, 293–303.

    Article  MathSciNet  MATH  Google Scholar 

  • Walrand, J. (1983). A discrete-time queueing network. J.Appl.Probab., 20, 903–909.

    Article  MathSciNet  MATH  Google Scholar 

  • Wanrooij, G.L. (see A. Hordijk).

    Google Scholar 

  • Watanabe, Y. (see S. Nakajima).

    Google Scholar 

  • Weeda, P.J. (1974). On the relationship between the cutting operation of generalized Markov programming and optimal stopping. Amsterdam Mathematisch Centrum, BW 39, 15 p.

    Google Scholar 

  • Weeda, P.J. (1974). Some computational experiments with a special generalized Markov programming model. Amsterdam Mathematisch Centrum, BW 37, 25 p.

    Google Scholar 

  • Weeda, P.J. (1976). Sensitive time and discount optimality in Markov renewal decision problems with instantaneous actions, Amsterdam Mathematisch Centrum, BW 59, 20 p.

    Google Scholar 

  • Weeda, P.J. (1979). Finite generalized Markov programming. Amsterdam Mathematical Centre Tracts, 92.

    Google Scholar 

  • Weiner, D. (see P. Purdue).

    Google Scholar 

  • Weinfeld, R. (see P. Staniewski).

    Google Scholar 

  • Weiss, E.N. (see M.A. Cohen).

    Google Scholar 

  • Weiss, G. (see I. Meilijson).

    Google Scholar 

  • Welch, P.D. (see S.S. Lavenberg).

    Google Scholar 

  • Wessels, J. (see J.van Nunen).

    Google Scholar 

  • White, C.C. III (see K.W. Kim).

    Google Scholar 

  • White, C.C. III (1976). Procedures for the solution of a finite-horizon, partially observed, semi-Markov optimization problem. Operations Res., 24, 348–358.

    Article  MathSciNet  MATH  Google Scholar 

  • White, C.C. III (1975). Cost equality and inequality results for a partially observed stochastic optimization problem. IEEE Trans. Systems Man Cybernetics SMC-5, 576-582.

    Google Scholar 

  • White, D.J. (1978). Finite dynamic programming. An approach to finite Markov decision processes. John Wiley & Sons.

    Google Scholar 

  • White, D.J. (1981). Isotone optimal policies for structured Markov decision processes. Eur.J.Oper.Res., 7, 396–402.

    Article  MATH  Google Scholar 

  • Whitt, W. (1980). Continuity of generalized semi-Markov processes. Math.Oper.Res., 5, 494–501.

    Article  MathSciNet  MATH  Google Scholar 

  • Whitt, W. (1981). Comparing counting processes and queues. Adv.Appl. Probab. 13, 207–220.

    Article  MathSciNet  MATH  Google Scholar 

  • Whitt, W. (1982). Approximating a point process by a renewal process. I: Two basic methods. Oper.Res., 30, 125–147.

    MathSciNet  MATH  Google Scholar 

  • Whittaker, C. (see R.M. Feldman).

    Google Scholar 

  • Wickwire, K.H. (1979). The Poisson disorder problem for large intensities. Int.J.Syst.Sci., 10, 1353–1358.

    Article  MathSciNet  MATH  Google Scholar 

  • Wijngaard, J. (1982). On the calculation of the total expected cost in skip-free Markov chains: the matrix case. Operations Research, Proc.lOth Annual Meet., Goettingen, 449-453.

    Google Scholar 

  • Wilcox, P. (see E. Ritchie).

    Google Scholar 

  • Wilkins, C.W. (1980). First passage times of semi-Markov processes. Southeast Asian Bull.Math., 4, 94–100.

    MathSciNet  MATH  Google Scholar 

  • Winston, W. (see S.D. Deshmukh).

    Google Scholar 

  • Witsenhausen, H.S. (1975). On policy independence of conditional expectations. Inform, and Control, 28, 65–75.

    Article  MathSciNet  MATH  Google Scholar 

  • Wlodarczyk, M. (see I. Kozniewska).

    Google Scholar 

  • Wolff, M.-R. (1980). Dynamische Instandhaltungsplanung fuer einfache Produktionssysteme. Proc.Jahrestag Oper.Res., DGOR, Regensburg, 412-418.

    Google Scholar 

  • Wolfson, D.B. (1976). A Lindeberg-type theorem. Stochastic Processes Appl., 4, 203–213.

    Article  MathSciNet  MATH  Google Scholar 

  • Wolfson, D.B. (1977). Limit theorems for sums of a sequence of random variables defined on a Markov chain. J.Appl.Probab., 14, 614–640.

    Article  MathSciNet  MATH  Google Scholar 

  • Woodroofe, M. (see H. Takahashi).

    Google Scholar 

  • Woolford, S.W. (see P.S. Puri).

    Google Scholar 

  • Wu, R. (1981). Distribution of a class of remainder times. Acta Math. Sin., 24, 494-503 (Chinese).

    Google Scholar 

  • Wu, S.C. (1982). A semi-Markov model for survival data with covariates. Math.Biosci., 60, 197–206.

    Article  MathSciNet  MATH  Google Scholar 

  • Wu, S.M. (see S.M. Pandit).

    Google Scholar 

  • Yao, J.S. (see S. Liu Mu).

    Google Scholar 

  • Yasuda, M. (1978). Semi-Markov decision processes with countable state space and compact action space. Bull.Math.Statist., 18, 35–54.

    MathSciNet  MATH  Google Scholar 

  • Yasui, K. (see M. Motoori).

    Google Scholar 

  • Yechiali, U. (see H. Mendelson).

    Google Scholar 

  • Yeh, M. (see L.C. Thomas).

    Google Scholar 

  • Young, D. (see B.J. Largay).

    Google Scholar 

  • Yurenkov, K.E. (1976). A stochastic exchange model for a two-level-memory. Verojatn.Metody Kibern., 91-102 (Russian).

    Google Scholar 

  • Yushkevich, A.A. (1973). On a class of strategies in general Markov decision models. Theory Probab.Appl., 18, 777–779.

    Article  MATH  Google Scholar 

  • Yushkevich, A.A. (1981). On controlled semi-Markov processes with average reward criterion. Lect.Notes Control Inf.Sci., 36, 235–238.

    Article  MathSciNet  Google Scholar 

  • Yushkevich, A.A. (1982). On the semi-Markov controlled models with the average reward criterion. Theory Probab.Appl., 26, 796–803.

    Article  MathSciNet  MATH  Google Scholar 

  • Zaagman, W.H. (see G. Gestri).

    Google Scholar 

  • Zaharin, O.M. (see I.I. Ezov).

    Google Scholar 

  • Zaharin, O.M. (1979). An ergodic theorem for singly complex randomized semi-Markov processes. Ukr.Math.J., 30, 610–611.

    Article  Google Scholar 

  • Zaharin, O.M. (1979). Complex randomized semi-Markov processes. Cybernetics, 14, 903–907.

    Article  Google Scholar 

  • Zaharin, O.M. (1980). Some Markov models of systems with partial aftereffect. Cybernetics, 16, 175–188.

    Article  Google Scholar 

  • Zak, Yu.A (see N.L. Kiryan).

    Google Scholar 

  • Zakusilo, O.K. (1977). On the convergence of sums of a random number of random variables defined on an ergodic process. Theory Probab.Math.Stat., 9, 95-103. Zaslavskij, A.E. (1979). A multidimensional Markov renewal theorem and an infinite system of particles of countably many types. Theory Probab.Math.Stat., 18, 47–58.

    Google Scholar 

  • Zasushin, V.S. (1978). Adaptive control of semi-Markov processes. Izvestija Akad.Nauk SSSR, tehn.Kibernet., 207-213 (Russian).

    Google Scholar 

  • Zbyrko, M.D. (see V.N. Kuznetsov).

    Google Scholar 

  • Zelen, M. (see S.W. Lagakos).

    Google Scholar 

  • Zhutovskij, V.G. (see G.A. Chernomorov).

    Google Scholar 

  • Zhilin, V.A. (see V.V. Kalashnikov).

    Google Scholar 

  • Zirilli, F. (see F. Aluffi).

    Google Scholar 

  • Zlatorunskii, N.K. (1974). Interaction of stochastic systems with finite state space. Kibernetika, Kiev, 35-39 (Russian).

    Google Scholar 

  • Zieu, B.K. (1978). A scheme of improvement of a strategy by parts for semi-Markovian decision process. Vestnik Leningrad.Univ., 19, Mat.Men.Astron., 137-138 (Russian).

    Google Scholar 

  • Zijlstra, M. (1981). Renewal replacement policies for one unit systems. Eur.J.Oper.Res., 8, 289–293.

    Article  MathSciNet  MATH  Google Scholar 

  • Zoelzer, G.A. (1976). Anwendung linearer Programmierung bei Markov-Modellen fuer Personalstruktur-Probleme. Proc.Annual Meet.Oper. Res., DGOR, 70-76.

    Google Scholar 

  • Zuckerman, D. (1978). Optimal stopping in a semi-Markov shock model. J.Appl.Probab., 15, 629–634.

    Article  MathSciNet  MATH  Google Scholar 

  • Zuckerman, D. (1978). Optimal replacement policy for the case where the damage process is a one-sided Levy process. Stochastic Processes Appl., 7, 141–151.

    Article  MathSciNet  MATH  Google Scholar 

  • Zuckerman, D. (1980). Optimal stopping in terminating one-sided processes with unbounded reward functions. Z.Oper.Res., Ser.A, 24, 145–153.

    MathSciNet  MATH  Google Scholar 

  • Concluding remark: this bibliography complements a first part which appeared in 1976 in J.Comp.Appl.Math., 2, 125-144. The number of papers covered here is close to a thousand from more than 800 authors. There is no claim whatever on completeness. The reader’s attention is drawn on translations made of journals published in Russian.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer Science+Business Media New York

About this chapter

Cite this chapter

Teugels, J.L. (1986). A Second bibliography on semi-Markov processes. In: Janssen, J. (eds) Semi-Markov Models. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0574-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0574-1_31

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0576-5

  • Online ISBN: 978-1-4899-0574-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics