TY - JOUR
N2 - In the present paper, the most important aspects of computer algebra systems applications in complicated calculations for classical queueing theory models and their novel modifications are discussed. We mainly present huge computational possibilities of Mathematica environment and effective methods of obtaining symbolic results connected with the most important performance characteristics of queueing systems. First of all, we investigate effective solutions to computational problems appearing in queueing theory such as: finding final probabilities for Markov chains with a huge number of states, calculating derivatives of complicated rational functions of one or many variables with the use of classical and generalized L’Hospital’s rules, obtaining exact formulae of Stieltjes convolutions, calculating chosen integral transforms used often in the above-mentioned theory and possible applications of generalized density function of random variables and vectors in these computations. Some exemplary calculations for practical models belonging both to classical models and their generalizations are attached as well.
L1 - http://sd.czasopisma.pan.pl/Content/130881/PDF-MASTER/BPASTS_2024_72_4_3853.pdf
L2 - http://sd.czasopisma.pan.pl/Content/130881
PY - 2024
IS - 4
EP - e150199
DO - 10.24425/bpasts.2024.150199
KW - classical queueing models
KW - queueing systems with random volume customers and sectorized memory buffer
KW - generalized L'Hospital's rule
KW - Stieltjes convolution
KW - Laplace and Laplace–Stieltjes transforms
A1 - Ziółkowski, Marcin
VL - 72
DA - 2024.0.01
T1 - On applications of computer algebra systems in queueing theory calculations
SP - e150199
UR - http://sd.czasopisma.pan.pl/dlibra/publication/edition/130881
T2 - Bulletin of the Polish Academy of Sciences Technical Sciences
ER -