A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
PEPA Queues: Capturing Customer Behaviour in Queueing Networks
2007
Electronical Notes in Theoretical Computer Science
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,
doi:10.1016/j.entcs.2007.07.002
fatcat:7gqpcipfefey5m6l73sscwjp7u