eprintid: 1266
rev_number: 10
eprint_status: archive
userid: 6
dir: disk0/00/00/12/66
datestamp: 2012-05-07 09:12:53
lastmod: 2012-05-07 09:12:53
status_changed: 2012-05-07 09:12:53
type: book_section
metadata_visibility: show
creators_name: Bernardo, Marco
creators_name: De Nicola, Rocco
creators_name: Loreti, Michele
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: Proceedings of the 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 – April 1, 2012. 
abstract: One of the most studied extensions of testing theory to nondeterministic and probabilistic processes yields unrealistic probabilities estimations that give rise to two anomalies. First, probabilistic testing equivalence does not imply probabilistic trace equivalence. Second, probabilistic testing equivalence differentiates processes that perform the same sequence of actions with the same probability but make internal choices in different moments and thus, when applied to processes without probabilities, does not coincide with classical testing equivalence. In this paper, new versions of probabilistic trace and testing equivalences are presented for nondeterministic and probabilistic processes that resolve the two anomalies. Instead of focussing only on suprema and infima of the set of success probabilities of resolutions of interaction systems, our testing equivalence matches all the resolutions on the basis of the success probabilities of their identically labeled computations. A simple spectrum is provided to relate the new relations with existing ones. It is also shown that, with our approach, the standard probabilistic testing equivalences for generative and reactive probabilistic processes can be retrieved.
date: 2012
date_type: published
series: Lecture Notes in Computer Science
number: 7213
publisher: Springer-Verlag
pagerange: 195-209
event_title: Proc. FoSSaCS 2012, Volume 7213 of Lecture Notes in Computer Science
id_number: 10.1007/978-3-642-28729-9_13
refereed: TRUE
isbn: 978-3-642-28728-2
book_title: Foundations of Software Science and Computational Structures
editors_name: Birkedal, Lars
official_url: http://dx.doi.org/10.1007/978-3-642-28729-9_13
funders: Work partially supported by the FP7-IST-FET Project ASCENS, grant n. 257414
citation:   Bernardo, Marco and De Nicola, Rocco and Loreti, Michele  Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes.   In:  Foundations of Software Science and Computational Structures.   Lecture Notes in Computer Science  (7213).  Springer-Verlag, pp. 195-209.  ISBN 978-3-642-28728-2      (2012)