Process algebra for performance evaluation

This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resource-sharing systems -like large-scale computers, client-server architectures, networks -- can accurately be described using such stochastic specification formalisms. The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and complete) axiomatisations of these equivalences for different types of Markovian process algebras, where delays are governed by exponential distributions. Starting from a simple action-less algebra for describing time-homogeneous continuous-time Markov chains, we consider the integration of actions and random delays both as a single entity (like in known Markovian process algebras like TIPP, PEPA and EMPA) and as separate entities (like in the timed process algebras timed CSP and TCCS). In t...

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoen
• Keywords: Markovian Process Algebras, Process Algebras, Stochastic Process Algebras, TCS 2002, Theoretical Computer Science