%0 Book Section
%A De Nicola, Rocco
%A Latella, Diego
%A Loreti, Michele
%A Massink, Mieke
%B Automata, Languages and Programming (ICALP (2) 2009)
%D 2009
%E Albers, Susanne
%E Marchetti-Spaccamela, Alberto
%E Matias, Yossi
%E E. Nikoletseas, Sotiris
%E Thomas, Wolfgang
%F eprints:275
%I Springer
%P 435-446
%S Lecture Notes in Computer Science
%T Rate-Based Transition Systems for Stochastic Process Calculi
%U http://eprints.imtlucca.it/275/
%V 5556
%X A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition relation used in our variant associates to each process, for each action, the set of possible futures paired with a measure indicating their rates. We show how RTS can be used for providing the operational semantics of stochastic extensions of classical formalisms, namely CSP and CCS. We also show that our semantics for stochastic CCS guarantees associativity of parallel composition. Similarly, in contrast with the original definition by Priami, we argue that a semantics for stochastic π-calculus can be provided that guarantees associativity of parallel composition. 
%Z The original publication is available at www.springerlink.com