TY  - CHAP
Y1  - 2009///
A1  - De Nicola, Rocco
A1  - Latella, Diego
A1  - Loreti, Michele
A1  - Massink, Mieke
UR  - http://dx.doi.org/10.1007/978-3-642-02930-1_36
M1  - 5556
N1  - The original publication is available at www.springerlink.com
AV  - public
T3  - Lecture Notes in Computer Science
SP  - 435
TI  - Rate-Based Transition Systems for Stochastic Process Calculi
PB  - Springer
T2  - Automata, Languages and Programming (ICALP (2) 2009)
ED  - Albers, Susanne
ED  - Marchetti-Spaccamela, Alberto
ED  - Matias, Yossi
ED  - E. Nikoletseas, Sotiris
ED  - Thomas, Wolfgang
SN  - 978-3-642-02929-5
EP  - 446
ID  - eprints275
N2  - 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. 
ER  -