%0 Journal Article
%@ 0360-0300
%A De Nicola, Rocco
%A Latella, Diego
%A Loreti, Michele
%A Massink, Mieke
%D 2013
%F eprints:2707
%I ACM
%J ACM Computing Surveys
%K Combinatorics; Probability and statistics; Models of computation
%N 1
%P 1-35
%T A uniform definition of stochastic process calculi
%U http://eprints.imtlucca.it/2707/
%V 46
%X We introduce a unifying framework to provide the semantics of process algebras, including their quantitative variants useful for modeling quantitative aspects of behaviors. The unifying framework is then used to describe some of the most representative stochastic process algebras. This provides a general and clear support for an understanding of their similarities and differences. The framework is based on State to Function Labeled Transition Systems, FuTSs for short, that are state transition structures where each transition is a triple of the form (s,α,