Process algebra for performance evaluation

Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoen
2002 Theoretical Computer Science  
This paper surveys the theoretical developments in the ÿeld 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, clientserver architectures, networks -can accurately be described using such stochastic speciÿcation formalisms. The main emphasis of this paper is the treatment of operational semantics, notions of equivalence, and (sound and
more » ... mplete) axiomatisations of these equivalences for di erent types of Markovian process algebras, where delays are governed by exponential distributions. Starting from a simple actionless 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 total we consider four related calculi and investigate their relationship to existing Markovian process algebras. We also brie y indicate how one can proÿt from the separation of time and actions when incorporating more general, non-Markovian distributions.
doi:10.1016/s0304-3975(00)00305-4 fatcat:uab7q45gs5c43ixjzujjthe3dy