%X This paper presents a process-algebraic interpretation of the Layered Queueing Network model. The semantics of layered multi-class servers, resource contention, multiplicity of threads and processors are mapped into a model described in the stochastic process algebra PEPA. The accuracy of the translation is validated through a case study of a distributed computer system and the numerical results are used to discuss the relative strengths and weaknesses of the different forms of analysis available in both approaches, i.e., simulation, mean-value analysis, and differential approximation.
%L eprints2573
%D 2010
%A Mirco Tribastone
%R doi:10.1145/1712605.1712634
%B Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering - WOSP/SIPEW '10
%P 183-194
%T Relating layered queueing networks and process algebra models
%I ACM