Characterising Testing Preorders for Finite Probabilistic Processes

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both problems for finite processes with silent moves. It characterises the may preorder in terms of simulation, and the must preorder in terms of failure simulation. It also gives a characterisation of both preorders using a modal logic. Finally it axiomatises both preorders over a probabilistic version of CSP.

[1]  Annabelle McIver,et al.  Probabilistic Models for the Guarded Command Language , 1997, Sci. Comput. Program..

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

[3]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[4]  Wang Yi,et al.  Testing preorders for probabilistic processes can be characterized by simulations , 2002, Theor. Comput. Sci..

[5]  Karen Seidel,et al.  Probabilistic Communicating Processes , 1992, Theor. Comput. Sci..

[6]  Scott A. Smolka,et al.  Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes , 1990, CONCUR.

[7]  Roberto Segala,et al.  Axiomatizations for Probabilistic Bisimulation , 2001, ICALP.

[8]  Klaus Keimel,et al.  Semantic Domains for Combining Probability and Non-Determinism , 2005, Electronic Notes in Theoretical Computer Science.

[9]  Roberto Segala,et al.  Testing Probabilistic Automata , 1996, CONCUR.

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

[11]  Manuel Núñez,et al.  Denotational Semantics for Probabilistic Refusal Testing , 1998, PROBMIV.

[12]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

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

[14]  Nancy A. Lynch,et al.  Compositionality for Probabilistic Automata , 2003, CONCUR.

[15]  Gavin Lowe,et al.  Representing Nondeterministic and Probabilistic Behaviour in Reactive Processes , 1993 .

[16]  Gavin Lowe,et al.  Probabilistic and Prioritized Models of Timed CSP , 1995, Theor. Comput. Sci..

[17]  Carroll Morgan,et al.  Scalar Outcomes Suffice for Finitary Probabilistic Testing , 2007, ESOP.

[18]  Marta Z. Kwiatkowska,et al.  A Testing Equivalence for Reactive Probabilistic Processes , 1998, EXPRESS.

[19]  Manuel Núñez,et al.  Acceptance Trees for Probabilistic Processes , 1995, CONCUR.

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

[21]  Michael W. Mislove.  Nondeterminism and Probabilistic Choice: Obeying the Laws , 2000, CONCUR.

[22]  C. A. R. Hoare,et al.  Specification-oriented semantics for Communicating Processes , 1983, Acta Informatica.

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

[24]  Albert R. Meyer,et al.  A Remark on Bisimulation Between Probabilistic Processes , 1989, Logic at Botik.

[25]  C. Jones,et al.  A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[26]  Rance Cleaveland,et al.  Testing Preorders for Probabilistic Processes , 1992, Inf. Comput..

[27]  Yuxin Deng,et al.  Axiomatizations for Probabilistic Finite-State Behaviors , 2005, FoSSaCS.

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

[29]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[30]  Yuxin Deng,et al.  Axiomatizations for probabilistic finite-state behaviors , 2007, Theor. Comput. Sci..

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

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

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

[34]  Kim G. Larsen,et al.  Bisimulation through probabilistic testing (preliminary report) , 1989, POPL '89.

[35]  Valentín Valero Ruiz,et al.  Algebraic theory of probabilistic and nondeterministic processes , 2003, J. Log. Algebraic Methods Program..

[36]  R. V. Glabbeek.  The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[37]  Joël Ouaknine,et al.  Axioms for Probability and Nondeterminism , 2004, EXPRESS.

[38]  Manuel Núñez,et al.  Algebraic theory of probabilistic processes , 2003, J. Log. Algebraic Methods Program..

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

[40]  Wang Yi,et al.  Compositional testing preorders for probabilistic processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[41]  Annabelle McIver,et al.  Refinement-oriented probability for CSP , 1996, Formal Aspects of Computing.

[42]  Carroll Morgan,et al.  Remarks on Testing Probabilistic Processes , 2007, Computation, Meaning, and Logic.

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

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

[45]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[46]  Dexter Kozen,et al.  Semantics of probabilistic programs , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[47]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

[48]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.