TY - CHAP ED - Birkedal, Lars PB - Springer-Verlag A1 - Bernardo, Marco A1 - De Nicola, Rocco A1 - Loreti, Michele SP - 195 T3 - Lecture Notes in Computer Science Y1 - 2012/// ID - eprints1266 N1 - 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. T2 - Foundations of Software Science and Computational Structures EP - 209 SN - 978-3-642-28728-2 N2 - 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. TI - Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes AV - none UR - http://dx.doi.org/10.1007/978-3-642-28729-9_13 ER -