Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes

Two of the most studied extensions of trace and testing equivalences to nondeterministic and probabilistic processes induce distinctions that have been questioned and lack properties that are desirable. Probabilistic trace-distribution equivalence differentiates systems that can perform the same set of traces with the same probabilities, and is not a congruence for parallel composition. Probabilistic testing equivalence, which relies only on extremal success probabilities, is backward compatible with testing equivalences for restricted classes of processes, such as fully nondeterministic processes or generative/reactive probabilistic processes, only if specific sets of tests are admitted. In this paper, new versions of probabilistic trace and testing equivalences are presented for the general class of nondeterministic and probabilistic processes. The new trace equivalence is coarser because it compares execution probabilities of single traces instead of entire trace distributions, and turns out to be compositional. The new testing equivalence requires matching all resolutions of nondeterminism on the basis of their success probabilities, rather than comparing only extremal success probabilities, and considers success probabilities in a trace-by-trace fashion, rather than cumulatively on entire resolutions. It is fully backward compatible with testing equivalences for restricted classes of processes; as a consequence, the trace-by-trace approach uniformly captures the standard probabilistic testing equivalences for generative and reactive probabilistic processes. The paper discusses in full details the new equivalences and provides a simple spectrum that relates them with existing ones in the setting of nondeterministic and probabilistic processes.

[1]  Sonja Georgievska,et al.  Retaining the Probabilities in Probabilistic Testing Theory , 2010, FoSSaCS.

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

[3]  Azaria Paz,et al.  Probabilistic automata , 2003 .

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

[5]  Ling Cheung,et al.  A testing scenario for probabilistic processes , 2007, JACM.

[6]  Rocco De Nicola,et al.  Extensional equivalences for transition systems , 1987, Acta Informatica.

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

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

[9]  Roberto Segala,et al.  Axiomatization of trace semantics for stochastic nondeterministic processes , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

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

[11]  Rocco De Nicola,et al.  A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences , 2013, Inf. Comput..

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

[13]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

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

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

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

[17]  Erik P. de Vink,et al.  Probabilistic Automata: System Types, Parallel Composition and Comparison , 2004, Validation of Stochastic Systems.

[18]  Carroll Morgan,et al.  Characterising Testing Preorders for Finite Probabilistic Processes , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[19]  Sonja Georgievska,et al.  Probabilistic may/must testing: retaining probabilities by restricted schedulers , 2012, Formal Aspects of Computing.

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

[21]  Cyrus Derman,et al.  Finite State Markovian Decision Processes , 1970 .

[22]  Rocco De Nicola,et al.  Relating strong behavioral equivalences for processes with nondeterminism and probabilities , 2013, Theor. Comput. Sci..

[23]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

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

[25]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

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

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

[28]  Nancy A. Lynch,et al.  Switched PIOA: Parallel composition via distributed scheduling , 2006, Theor. Comput. Sci..

[29]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

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

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

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

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

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

[35]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

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

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

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

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

[40]  Rocco De Nicola,et al.  Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes , 2012, FoSSaCS.

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

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