Abstract
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.
Article PDF
Similar content being viewed by others
References
Acciai L, Boreale M, De Nicola R (2011) Linear and may-testing semantics in a probabilistic reactive setting. FMOODS-FORTE’11, LNCS 6722. Springer, Berlin, pp 29–43
Alvim MS, Andrés ME, Palamidessi C, van Rossum P (2010) Safe equivalences for security properties. IFIP TCS’10, pp 55–70
Andrés ME, Palamidessi C, van Rossum P, Sokolova A (2011) Information hiding in probabilistic concurrent systems. Theor Comput Sci 412(28): 3072–3089
Baeten JCM, Bergstra JA, Klop JW (1987) Ready-trace semantics for concrete process algebra with the priority operator. Comput J 30(6): 498–506
Baeten JCM, Basten T, Reniers MA (2010) Process algebra: equational theories of communicating processes. Cambridge University Press
Bianco A, de Alfaro L (1995) Model checking of probabilistic and nondeterministic systems. FSTTCS ’95, LNCS 1026. Springer, Berlin, pp 499–513
Brookes SD, Hoare CAR, Roscoe AW (1984) A theory of communicating sequential processes. J ACM 31(3): 560–599
Calin G, Crouzen P, D’Argenio PR, Hahn EM, Zhang L (2010) Time-bounded reachability in distributed input/output interactive probabilistic chains. SPIN’10, LNCS 6349. Springer, Berlin, pp 193–211
Canetti R (2001) Universally composable security: a new paradigm for cryptographic protocols. FOCS’01. IEEE, pp 136–145
Cazorla D, Cuartero F, Valero V, Pelayo FL, Pardo JJ (2003) Algebraic theory of probabilistic and nondeterministic processes. J Logic Algebraic Programm 55(1–2): 57–103
Chatzikokolakis K, Palamidessi C (2007) Making random choices invisible to the scheduler. CONCUR’07, LNCS 4703. Springer, Berlin, pp 42–58
Cheung L, Lynch N, Segala R, Vaandrager F (2006) Switched PIOA: parallel composition via distributed scheduling. Theor Comput Sci 365(1–2): 83–108
Cheung L, Stoelinga MIA, Vaandrager FW (2007) A testing scenario for probabilistic processes. J ACM 54(6): 29–12945
de Alfaro L, Henzinger T, Jhala R (2001) Compositional methods for probabilistic systems. In: CONCUR’01, LNCS 2154. Springer, Berlin, pp 351–365
De Nicola R, Hennessy MCB (1984) Testing equivalences for processes. Theor Comput Sci 34: 83–133
Deng Y, van Glabbeek R, Hennessy M, Morgan C (2009) Testing finitary probabilistic processes (extended abstract). In: CONCUR’09. LNCS 5710. Springer, Berlin, pp 274–288
Deng Y, van Glabbeek RJ, Hennessy M, Morgan C (2008) Characterising testing preorders for finite probabilistic processes. Logical Methods Comput Sci 4(4): 4–133
Doob JL (1953) Stochastic processes. Wiley, New York
Doyen L, Henzinger TA, Raskin J-F (2008) Equivalence of labeled Markov chains. Int J Found Comput Sci 19(3): 549–563
Georgievska S (2011) Probability and hiding in concurrent processes. PhD thesis, Eindhoven University of Technology
Georgievska S, Andova S (2010) Composing systems while preserving probabilities. EPEW 2010, LNCS 6342. Springer, Berlin, pp 268–283
Georgievska S, Andova S (2010) Retaining the probabilities in probabilistic testing theory. FOSSACS’10, LNCS 6014. Springer, Berlin, pp 79–93
Georgievska S, Andova S (2010) Testing reactive probabilistic processes. QAPL’10, EPTCS 28, pp 99–113
Georgievska S, Andova S (2012) Probabilistic CSP: preserving the laws via restricted schedulers. MMB & DFT 2012, LNCS 7201. Springer, Berlin, pp 136–150
Giro S (2010) On the automatic verification of distributed probabilistic automata with partial information. PhD thesis, Universidad Nacional de Córdoba
Giro S, D’Argenio P (2009) On the expressive power of schedulers in distributed probabilistic systems. QAPL’09, ENTCS 253(3). Elsevier, Amsterdam, pp pp 45–71
van Glabbeek RJ (1993) The linear time-branching time spectrum II. CONCUR’93, LNCS 715. Springer, Berlin, pp 66–81
van Glabbeek RJ (2001) The linear time-branching time spectrum I; the semantics of concrete, sequential processes. Handbook of process algebra, chap 1. Elsevier, Amsterdam, pp 3–99
van Glabbeek RJ, Luttik B, Trčka N (2009) Branching bisimilarity with explicit divergence. Fundam Inf 93: 371–392
Gomez FC, De Frutos Escrig D., Ruiz VV (1997) A sound and complete proof system for probabilistic processes. ARTS’97, LNCS 1231. Springer, Berlin, pp 340–352
Hansson HA (1994) Time and probability in formal design of distributed systems. Elsevier, Amsterdam
Hennessy M (1988) Algebraic theory of processes. MIT Press, New York
Hoare CAR (1985) Communicating sequential processes. Prentice Hall, Englewood Cliffs
Howard RA (1971) Semi-Markov and decision processes. Wiley, London
Jonsson B, Wang Y (2002) Testing preorders for probabilistic processes can be characterized by simulations. Theor Comput Sci 282(1): 33–51
Kaelbling LP, Littman ML, Cassandra AR (1998) Planning and acting in partially observable stochastic domains. Artif Intell J 101: 99–134
Kumar KN, Cleaveland R, Smolka SA (1998) Infinite probabilistic and nonprobabilistic testing. FSTTCS’98, LNCS 1530. Springer, Berlin, pp 209–220
Kwiatkowska M, Norman G (1998) A testing equivalence for reactive probabilistic processes. EXPRESS’98, ENTCS 16. Elsevier, Amsterdam, pp 1–19
Kwiatkowska MZ, Norman GJ (1998) A fully abstract metric-space denotational semantics for reactive probabilistic processes. COMPROX ’98, ENTCS 13. Elsevier, Amsterdam, pp 1–33
Larsen KG, Skou A (1991) Bisimulation through probabilistic testing. Inf Comput 94: 1–28
Lindley DV (1980) Introduction to probability and statistics from a Bayesian viewpoint. Cambridge University Press, Cambridge
López N, Núñez M, Rodríguez I (2006) Specification, testing and implementation relations for symbolic-probabilistic systems. Theor Comput Sci 353(1): 228–248
Lowe G (1993) Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93. Oxford University Computing Labs
Lynch N, Segala R, Vaandrager F (2007) Observing branching structure through probabilistic contexts. SIAM J Comput 37(4): 977–1013
McIver A, Morgan C (2004) Abstraction, refinement and proof for probabilistic systems (Monographs in Computer Science). Springer, Berlin
Milner R (1980) A calculus of communicating systems. Springer, Berlin
Morgan C, McIver A, Seidel K (1996) Probabilistic predicate transformers. ACM Trans Program Lang Syst 18(3): 325–353
Morgan C, McIver A, Seidel K, Sanders JW (1996) Refinement-oriented probability for CSP. Formal Aspects Comput 8(6): 617–647
De Nicola R (1987) Extensional equivalences for transition systems. Acta Inf 24(2): 211–237
Palmeri MC, De Nicola R, Massink M (2007) Basic observables for probabilistic may testing. QEST ’07. IEEE Computer Society, pp 189–200
Pnueli A (1985) Linear and branching structures in the semantics and logics of reactive systems. ICALP’85, LNCS 194. Springer, Berlin, pp 15–32
Puterman ML (1994) Markov decision processes. Wiley, New York
Rensink A, W Vogler W (2007) Fair testing. Inf Comput 205: 125–198
Roscoe AW (1998) The theory and practice of concurrency. Prentice Hall, Englewood Cliffs
Segala R (1995) Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT
Segala R (1996) Testing probabilistic automata. CONCUR’96, LNCS 1119. Springer, Berlin, pp 299–314
Seidel K (1995) Probabilistic communicating processes. Theor Comput Sci 152: 219–249
Seidel K, Morgan C, McIver A (1997) Probabilistic imperative programming: a rigorous approach. Proceedings of formal methods Pacific ’97. Springer Series in Discrete Mathematics and Theoretical Computer Science, Singapore, Springer, Berlin
Sondik EJ (1971) The optimal control of partially observable Markov processes. PhD thesis, Stanford University
Wang Y, Larsen KG (1992) Testing probabilistic and nondeterministic processes. Proceedings of IFIP TC6/WG6.1 twelth international symposium on protocol specification, testing and verification XII, pp 47–61
Wu S-H, Smolka SA, Stark E (1997) Composition and behaviors of probabilistic I/O automata. Theor Comput Sci 176(1–2): 1–38
Open Access
This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Georgievska, S., Andova, S. Probabilistic may/must testing: retaining probabilities by restricted schedulers. Form Asp Comp 24, 727–748 (2012). https://doi.org/10.1007/s00165-012-0236-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-012-0236-5