Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes

We present alternative characterizations of the testing preorders for probabilistic processes proposed in [CSZ92]. For a given probabilistic process, the characterization takes the form of a mapping from probabilistic traces to the interval [0, 1], where a probabilistic trace is an alternating sequence of actions and probability distributions over actions. Our results, like those of [CSZ92], pertain to divergence-free probabilistic processes, and are presented in two stages: probabilistic tests without internal τ-transitions are considered first, followed by probabilistic tests with τ-transitions. In each case, we show that our alternative characterization is fully abstract with respect to the corresponding testing pre-order, thereby resolving an open problem in [CSZ92]. In the second case, we use the alternative characterization to show that the testing preorder is actually an equivalence relation.

[1]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, CONCUR.

[2]  Wang Yi,et al.  Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.

[3]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[4]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[5]  Rance Cleaveland,et al.  Testing Preorders for Probabilistic Processes , 1992, ICALP.

[6]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[7]  Kim G. Larsen,et al.  Compositional Verification of Probabilistic Processes , 1992, CONCUR.

[8]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[9]  Ivan Christoff,et al.  Testing Equivalences and Fully Abstract Models for Probabilistic Processes , 1990, CONCUR.

[10]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[11]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[12]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

[13]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.