RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2013 Issue 9, Pages 20–33 (Mi at6096)

This article is cited 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.

Presented by the member of Editorial Board: A. I. Lyakhov

Received: 06.03.2012


 English version:
Automation and Remote Control, 2013, 74:9, 1449–1459

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024