Skip to main content
Log in

An approach to the analysis of random Markov processes with a finite number of states

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. A. Kaufmann and R. Cruon, Queuing. Theory and Applications [Russian translation], Mir, Moscow (1965).

    Google Scholar 

  2. A. N. Melikhov, Oriented Graphs and Finite Automatons [in Russian], Nauka Moscow (1971).

    Google Scholar 

  3. L. A. Grinshpan and E. V. Dneprovskii, “Investigation of two-phase stochastic, models of multiprogram information-computation systems with package processing,” in: Computer, Technology and Industrial Engineering [in Russian], Inst. Tekh. Kibernetiki Akad. Nauk BelorussSSR, Minsk, (September, 1974).

    Google Scholar 

  4. O. M. Yurkevich, “On servicing simultaneously arriving ‘impatient clients” in systems with instrument failures,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3 (1972).

  5. V. A. Popov and M. L. Litvinov, “Analysis of queuing systems with nonordinary flows of events,” Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4 (1973).

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 116–119, March–April, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grinshpan, L.A. An approach to the analysis of random Markov processes with a finite number of states. Cybern Syst Anal 14, 273–277 (1978). https://doi.org/10.1007/BF01069364

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation