%0 Conference Paper
%A Casale, Giuliano
%A Tribastone, Mirco
%B 9th Workshop on Process Algebra and Stochastically Timed Activities (PASTA)
%C London, UK
%D 2010
%F eprints:2557
%P 1-6
%T Process-algebraic modelling of priority queueing networks
%U http://eprints.imtlucca.it/2557/
%X We consider a closed multiclass queueing network model in which each class receives a different  priority level and jobs with lower priority are served only if there are no higher-priority jobs in the  queue. Such systems do not enjoy a product form solution, thus their analysis is typically carried out  through approximate mean value analysis (AMVA) techniques. We formalise the problem in PEPA in  a way amenable to differential analysis. Experimental results show that our approach is competitive  with simulation and AMVA methods.