TY  - CHAP
ED  - Wirsing, Martin
ED  - Hofmann, Martin
ED  - Rauschmayer, Axel
A1  - Bernardo, Marco
A1  - De Nicola, Rocco
A1  - Loreti, Michele
PB  - Springer
T3  - Lecture Notes in Computer Science
SP  - 35
Y1  - 2010///
ID  - eprints271
EP  - 56
T2  - Trustworthly Global Computing (TGC 2010)
SN  - 978-3-642-15639-7
M1  - 6084
N2  - Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uniform model for providing an operational semantics to many stochastic process algebras. In this paper, we define Uniform Labeled TRAnsition Systems (ULTraS) as a generalization of RTS that can be exploited to uniformly describe also nondeterministic and probabilistic variants of process algebras. We then present a general notion of behavioral relation for ULTraS that can be instantiated to capture bisimulation and trace equivalences for fully nondeterministic, fully probabilistic, and fully stochastic processes.

TI  - Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
AV  - none
UR  - http://dx.doi.org/10.1007/978-3-642-15640-3_3
ER  -