Compositional testing preorders for probabilistic processes

Transitions systems are well established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for refinement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for nonprobabilistic systems to a probabilistic setting. We consider a model of probabilistic transition systems, containing probabilistic choice and nondeterministic choice as independent concepts. We present a notion of testing for these systems. Our main contributions are denotational characterizations of the testing preorders. The characterizations are given in terms of chains for may testing and refusal chains for must testing, that are analogous to traces and failures in denotational models of CSP. Refinement corresponds to inclusion between chains and refusal chains modulo closure operations. The preorders are shown to be compositional. We also show that when restricted to nonprobabilistic systems, these preorders collapse to the standard simulation and refusal simulation.

[1]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[2]  Wang Yi,et al.  Algebraic Reasoning for Real-Time Probabilistic Processes with Uncertain Information , 1994, FTRTFT.

[3]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[4]  Bengt Jonsson,et al.  A framework for reasoning about time and reliability , 1989, [1989] Proceedings. Real-Time Systems Symposium.

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

[6]  Michael K. Molloy.  Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

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

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

[9]  Dexter Kozen,et al.  A probabilistic PDL , 1983, J. Comput. Syst. Sci..

[10]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[11]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

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

[13]  Zohar Manna,et al.  The anchored version of the temporal framework , 1988, REX Workshop.

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

[15]  S. Purushothaman Iyer,et al.  Reasoning About Probabilistic Behavior in Concurrent Systems , 1987, IEEE Transactions on Software Engineering.

[16]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[17]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, Theor. Comput. Sci..

[18]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

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

[20]  Gavin Lowe,et al.  Probabilities and priorities in timed CSP , 1993 .

[21]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

[22]  Rance Cleaveland,et al.  Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes , 1994, CONCUR.

[23]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[24]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

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

[26]  Kim Guldstrand Larsen,et al.  Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[28]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[30]  Wang Yi,et al.  Testing and Refinement for Nondeterministic and Probabilistic Processes , 1994, FTRTFT.

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