Journal Article

Probabilistic may/must testing: retaining probabilities by restricted schedulers

Andova, Suzana, Georgievska, Sonja

2012

Overview

This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing equivalence is too strong and distinguishes between processes that are observationally equivalent. The problem arises from the observation that the classical compose-and-schedule approach yields unrealistic overestimation of the probabilities, a phenomenon that has been recently well studied from the point of view of compositionality, in the context of randomized protocols and in probabilistic model checking. To that end, we propose a new testing theory, aiming at preserving the probability information in a parallel context. The resulting testing equivalence is insensitive to the exact moment the internal and the probabilistic choices occur. We also give an alternative characterization of the testing preorder as a probabilistic ready-trace preorder.

• Publisher: Springer-Verlag,Association for Computing Machinery
• Subject: Computation / Computer Science / Equivalence / Math Applications in Computer Science / Original Article / Preserving / Probabilistic methods / Probability theory / Theory of Computation