PEPA Queues: Capturing Customer Behaviour in Queueing Networks

DOI10.1016/J.ENTCS.2007.07.002zbMath1279.90043OpenAlexW2133907059MaRDI QIDQ2870281

Ashok Argent-Katwala, Jeremy T. Bradley

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.07.002

zbMATH Keywords

queueing networksPEPAstochastic process algebra

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• PRISM
• PEPA
• ipc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computer performance evaluation - modelling techniques and tools. 7th International Conference, Vienna, Austria, May 3-6, 1994. Proceedings
• Functional Performance Specification with Stochastic Probes
• Product-form queueing networks with negative and positive customers
• Product form solution for an insensitive stochastic process algebra structure
• A Compositional Approach to Performance Modelling

This page was built for publication: PEPA Queues: Capturing Customer Behaviour in Queueing Networks