摘要：The paper presents the theoretical evaluation of the complexity of an algorithm, based on embedded Markov chains, for computing steady state probabilities. Experimental research with different infinitesimal generator matrices was performed to support theoretical evaluations. Results showed that modified algorithm can be more effective for sparse matrices. An example of a queuing system is presented to demonstrate the automatic creation of the model of the system based on the proposed modelling method.
关键词：Steady state probabilities;complexity of the algorithm;numerical model;queuing system
