Characterising testing preorders for finite probabilistic processes

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

  Deng, Yuxin ^a,b   van Glabbeek, Rob ^b   Hennessy, Matthew ^c   Morgan, Carroll ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Axiomatisation; Probabilistic processes; Simulation; Testing semantics

Indexed keywords

AXIOMATI-SATION; FAILURE SIMULATION; MODAL LOGIC; NONDETERMINISTIC CHOICE; PREORDERS; PROBABILISTIC PROCESS; SIMULATION; TESTING SEMANTICS;

COMPUTER SCIENCE; COMPUTERS;

SEMANTICS;

EID: 70349848214     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:4)2008     Document Type: Article

References (41)

1. E. Bandini & R. Segala (2001): Axiomatizations for probabilistic bisimulation. In Proc. ICALP'01, LNCS 2076, Springer, pp. 370-381.
2. S. D. Brookes, C. A. R. Hoare & A. W. Roscoe (1984): A theory of communicating sequential processes. Journal of the ACM 31(3), pp. 560-599.
3. D. Cazorla, F. Cuartero, V. V. Ruiz, F. L. Pelayo & J. J. Pardo (2003): Algebraic theory of probabilistic and nondeterministic processes. Journal of Logic and Algebraic Programming 55, pp. 57-103.
4. I. Christoff (1990): Testing equivalences and fully abstract models for probabilistic processes. In Proc. CONCUR'90, LNCS 458, Springer, pp. 126-140.
5. R. Cleaveland, Z. Dayar, S. A. Smolka & S. Yuen (1999): Testing preorders for probabilistic processes. Information and Computation 154(2), pp. 93-148.
6. R. De Nicola & M. Hennessy (1984): Testing equivalences for processes. Theoretical Computer Science 34, pp. 83-133.
7. Y. Deng & C. Palamidessi (2007): Axiomatizations for probabilistic finite-state behaviors. Theoretical Computer Science 373(1-2), pp. 92-114.
8. Y. Deng, R. J. van Glabbeek, M. Hennessy, C. C. Morgan & C. Zhang (2007): Remarks on testing probabilistic processes. ENTCS 172, pp. 359-397.
9. Y. Deng, R. J. van Glabbeek, M. Hennessy, C. C. Morgan & C. Zhang (2007): Characterising testing preorders for finite probabilistic processes. In Proc. LICS'07, IEEE Computer Society Press, pp. 313-322.
10. Y. Deng, R. J. van Glabbeek, C. C. Morgan & C. Zhang (2007): Scalar outcomes suffice for finitary probabilistic testing. In Proc. ESOP'07, LNCS 4421, Springer, pp. 363-368.
11. R. J. van Glabbeek (1993): The linear time-branching time spectrum II; the semantics of sequential systems with silent moves. In Proc. CONCUR'93, LNCS 715, Springer, pp. 66-81.
12. C. Gregorio-Rodríguez & M. Núñez (1999): Denotational semantics for probabilistic refusal testing. ENTCS 22, pp. 111-137.
13. H. Hansson & B. Jonsson (1990): A calculus for communicating systems with time and probabilities. In Proc. RTSS'90, IEEE Computer Society Press, pp. 278-287.
14. He Jifeng, K. Seidel & A. K. McIver (1997): Probabilistic models for the guarded command language. Science of Computer Programming 28, pp. 171-192.
15. M. Hennessy (1988): An Algebraic Theory of Processes. MIT Press.
16. M. Hennessy & R. Milner (1985): Algebraic Laws for Nondeterminism and Concurrency. Journal of the ACM 32(1), pp. 137-161.
17. C. A. R. Hoare (1985): Communicating Sequential Processes. Prentice-Hall.
18. C. Jones 1990: Probabilistic Non-Determinism. PhD thesis, Department of Computer Science, University of Edinburgh.
19. C. Jones & G. D. Plotkin (1989): A probabilistic powerdomain of evaluations. In Proc. LICS'89, Computer Society Press, pp. 186-195.
20. B. Jonsson, C. Ho-Stuart & Wang Yi (1994): Testing and refinement for nondeterministic and proba-bilistic processes. In Proc. FTRTFT'94, LNCS 863, Springer, pp. 418-430.
21. B. Jonsson & K. G. Larsen (1991): Specification and refinement of probabilistic processes. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science, Computer Society Press, pp. 266-277.
22. B. Jonsson & Wang Yi (1995): Compositional testing preorders for probabilistic processes. In Proc. LICS'95, IEEE Computer Society Press, pp. 431-441.
23. B. Jonsson & Wang Yi (2002): Testing preorders for probabilistic processes can be characterized by simulations. Theoretical Computer Science 282(1), pp. 33-51.
24. C.-C. Jou & S. A. Smolka (1990): Equivalences, congruences, and complete axiomatizations for proba-bilistic processes. In Proc. CONCUR '90, LNCS 458, Springer, pp. 367-383.
25. D. Kozen (1981): Semantics of Probabilistic Programs. Journal of Computer and System Sciences 22, pp. 328-350.
26. M. Z. Kwiatkowska & G. Norman (1998): A testing equivalence for reactive probabilistic processes. ENTCS 16(2), pp. 114-132.
27. K. G. Larsen & A. Skou (1991): Bisimulation through probabilistic testing. Information and Computation 94(1), pp. 1-28.
28. G. Lowe (1993): Representing nondeterminism and probabilistic behaviour in reactive processes. Technical Report TR-11-93, Computing laboratory, Oxford University.
29. N. Lynch, R. Segala & F. W. Vaandrager (2003): Compositionality for probabilistic automata. In Proc. CONCUR'03, LNCS 2761, Springer, pp. 204-222.
30. R. Milner (1989): Communication and Concurrency. Prentice-Hall.
31. M. W. Mislove (2000): Nondeterminism and probabilistic choice: Obeying the laws. In Proc. CON-CUR'00, LNCS 1877, Springer, pp. 350-364.
32. C. C. Morgan, A. K. McIver, K. Seidel & J. W. Sanders (1996): Refinement oriented probability for CSP. Formal Aspects of Computing 8, pp. 617-647.
33. M. Núñez (2003): Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Program-ming 56, pp. 117-177.
34. E.-R. Olderog & C. A. R. Hoare (1986): Specification-oriented semantics for communicating processes. Acta Informatica 23, pp. 9-66.
35. M. L. Puterman (1994): Markov Decision Processes. Wiley.
36. R. Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT.
37. R. Segala (1996): Testing probabilistic automata. In Proc. CONCUR'96, LNCS 1119, Springer, pp. 299-314.
38. R. Segala & N. A. Lynch (1994): Probabilistic simulations for probabilistic processes. In Proc. CON-CUR'94, LNCS 836, Springer, pp. 481-496.
39. K. Seidel (1995): Probabilistic communicating processes. Theoretical Computer Science 152(2), pp. 219-249.
40. R. Tix, K. Keimel & G. D. Plotkin (2005): Semantic domains for combining probability and non-determinism. ENTCS 129, pp. 1-104.
41. Wang Yi & K. G. Larsen (1992): Testing probabilistic and nondeterministic processes. In Proc. PSTV'92, IFIP Transactions C-8, North-Holland, pp. 47-61.