TY  - CHAP
UR  - http://dx.doi.org/10.1007/978-3-642-21461-5_2
KW  - probabilistic transition systems ? linear time ? testing equivalence ? safety 
TI  - Linear-Time and May-Testing in a Probabilistic Reactive Setting
AV  - none
N2  - We consider reactive probabilistic labelled transition systems (rplts), a model where internal choices are refined by probabilistic choices. In this setting, we study the relationship between linear-time and may-testing semantics, where an angelic view of nondeterminism is taken. Building on the model of d-trees of Cleaveland et al., we first introduce a clean model of probabilistic may-testing, based on simple concepts from measure theory. In particular, we define a probability space where statements of the form ?p may pass test o? naturally correspond to measurable events. We then obtain an observer-independent characterization of the may-testing preorder, based on comparing the probability of sets of traces, rather than of individual traces. This entails that may-testing is strictly finer than linear-time semantics. Next, we characterize the may-testing preorder in terms of the probability of satisfying safety properties, expressed as languages of infinite trees rather than traces. We then identify a significative subclass of rplts where linear and may-testing semantics do coincide: these are the separated rplts, where actions are partitioned into probabilistic and nondeterministic ones, and at each state only one type is available. 
M1  - 6722
SN  - 0302-9743
EP  - 43
T2  - Formal Techniques for Distributed Systems (FMOODS/FORTE 2011)
N1  - © IFIP International Federation for Information Processing 2011
ID  - eprints420
Y1  - 2011///
SP  - 29
T3  - Lecture Notes in Computer Science
PB  - Springer
A1  - Acciai, Lucia
A1  - Boreale, Michele
A1  - De Nicola, Rocco
ED  - Bruni, Roberto
ED  - Dingel, Juergen
ER  -