relation: http://eprints.imtlucca.it/420/
title: Linear-Time and May-Testing in a Probabilistic Reactive Setting
creator: Acciai, Lucia
creator: Boreale, Michele
creator: De Nicola, Rocco
subject: QA75 Electronic computers. Computer science
description: 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. 
publisher: Springer
contributor: Bruni, Roberto
contributor: Dingel, Juergen
date: 2011
type: Book Section
type: PeerReviewed
identifier:   Acciai, Lucia and Boreale, Michele and De Nicola, Rocco  Linear-Time and May-Testing in a Probabilistic Reactive Setting.   In:  Formal Techniques for Distributed Systems (FMOODS/FORTE 2011).   Lecture Notes in Computer Science, 6722 .  Springer, pp. 29-43.       (2011)  
relation: http://dx.doi.org/10.1007/978-3-642-21461-5_2
relation: 10.1007/978-3-642-21461-5_2