|
Avtomatika i Telemekhanika, 2013, Issue 9, Pages 20–33
(Mi at6096)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Stochastic Systems, Queuing Systems
Heuristic approximation method for a random flow of events by an MC-flow with arbitrary number of states
E. N. Bekkermana, S. G. Kataeva, S. S. Kataevab a Tomsk State Pedagogical University, Tomsk, Russia
b Tomsk State University, Tomsk, Russia
Abstract:
This paper considers the approximation problem for an observable random flow of events using an MC-flow. A separation algorithm for stationarity segments is suggested. In addition, we propose an evaluation algorithm for the number of states and intensity of the approximating MC-flow by event occurrence instants in the observable flow.
Citation:
E. N. Bekkerman, S. G. Kataev, S. S. Kataeva, “Heuristic approximation method for a random flow of events by an MC-flow with arbitrary number of states”, Avtomat. i Telemekh., 2013, no. 9, 20–33; Autom. Remote Control, 74:9 (2013), 1449–1459
Linking options:
https://www.mathnet.ru/eng/at6096 https://www.mathnet.ru/eng/at/y2013/i9/p20
|
Statistics & downloads: |
Abstract page: | 229 | Full-text PDF : | 52 | References: | 39 | First page: | 25 |
|