AESOP home

Publications

PEPA Queues: Capturing customer behaviour in queueing networks

Ashok Argent-Katwala, Jeremy T. Bradley

Conference or Workshop Paper
QAPL'07, 5th Workshop on Quantitative Aspects of Programming Languages
August, 2007
Electronic Notes in Theoretical Computer Science
Volume 190
Issue 3
pp.3–25
Elsevier
DOI 10.1016/j.entcs.2007.07.002
Abstract

Queueing network formalisms are very good at describing the spatial movement of customers, but typically poor at describing how customers change as they move through the network. We present the PEPA Queues formalism, which uses the popular stochastic process algebra PEPA to represent the individual state and behaviour of customers and servers. We offer a formal semantics for PEPA Queues, plus a direct translation to PEPA, allowing access to the existing tools for analysing PEPA models. Finally, we use the ipc/DNAmaca tool-chain to provide passage-time analysis of a dual Web server example.

PDF of full publication (181.1 kilobytes)
(need help viewing PDF files?)
GZipped Postscript of full publication (139 kilobytes)
(need help viewing GZipped Postscript files?)
PDF of presentation slides (130.2 kilobytes)

Information from pubs.doc.ic.ac.uk/pepa-queues.