eprintid: 420
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/04/20
datestamp: 2011-06-16 09:04:57
lastmod: 2011-07-11 14:36:24
status_changed: 2011-06-16 09:04:57
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Acciai, Lucia
creators_name: Boreale, Michele
creators_name: De Nicola, Rocco
creators_id: 
creators_id: 
creators_id: r.denicola@imtlucca.it
title: Linear-Time and May-Testing in a Probabilistic Reactive Setting
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: probabilistic transition systems – linear time – testing equivalence – safety 
note: © IFIP International Federation for Information Processing 2011
abstract: 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. 
date: 2011
date_type: published
series: Lecture Notes in Computer Science
volume: 6722
publisher: Springer
pagerange: 29-43
id_number: 10.1007/978-3-642-21461-5_2
refereed: TRUE
issn: 0302-9743
book_title: Formal Techniques for Distributed Systems (FMOODS/FORTE 2011)
editors_name: Bruni, Roberto
editors_name: Dingel, Juergen
official_url: http://dx.doi.org/10.1007/978-3-642-21461-5_2
citation:   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)