Anisimov, V. V.Artalejo, J. R.2019-01-312019-01-3120021134-5764http://hdl.handle.net/11693/48609It is well-known that an analytical solution of multiserver retrial queues is difficult and does not lead to numerical implementation. Thus, many papers approximate the original intractable system by the so-called generalized truncated systems which are simpler and converge to the original model. Most papers assume heuristically the convergence but do not provide a rigorous mathematical proof. In this paper, we present a proof based on a synchronization procedure. To this end, we concentrate on the M/M/c retrial queue and the approximation developed by Neuts and Rao (1990). However, the methodology can be employed to establish the convergence of several generalized truncated systems and a variety of Markovian multiserver retrial queues.EnglishRetrial queuesStationary distributionGeneralized truncated systemsSynchronizationStochastic comparabilityArticle10.1007/BF02578940