Modeling systems finite automata queuing visible channels

Distinct channels queuing systems with servers of different processing capacities and separate queues are considered. In this case the results of classical queuing theory, which suppose that a state graph is a linear “birth and death” process, graph. System with distinct channels is suggested to be described by deterministic and stochastic finite automatons. This approach gives an opportunity to carry out simulation of the system behavior under different variants of entries scheduling.