Logic in Computer Science, Symposium on (2005)
June 26, 2005 to June 29, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2005.35
J. Hillston , University of Edinburgh
In the 1980s, process algebras became widely accepted formalisms for describing and analysing concurrency. Extensions of the formalisms, incorporating some aspects of systems which had previously been abstracted, were developed for a number of different purposes. In the area of performance analysis models must quantify both timing and probability. Addressing this domain led to the formulation of stochastic process algebras. In this paper we give a brief overview of stochastic process algebras and the problems which motivated them, before focusing on their relationship with the underlying mathematical stochastic process. This is presented in the context of the PEPA formalism.
J. Hillston, "Process Algebras for Quantitative Analysis", Logic in Computer Science, Symposium on, vol. 00, no. , pp. 239-248, 2005, doi:10.1109/LICS.2005.35