Characterising testing preorders for finite probabilistic processes

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 313-322

  Deng, Yuxin ^a,d   Van Glabbeek, Rob ^b,d   Hennessy, Matthew ^c   Morgan, Carroll ^d   Zhang, Chenyi ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b CSIRO   (Australia)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

^d UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FAILURE SIMULATION; MODAL LOGIC; NONDETERMINISTIC CHOICE; PREORDERS; PROBABILISTIC PROCESS;

COMPUTATION THEORY;

EID: 70449106598     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.15     Document Type: Conference Paper

References (35)

1. E. Bandini & R. Segala (2001): Axiomatizations for probabilistic bisimulation. In Proc. ICALP'01, LNCS 2076, Springer, pp. 370-381. (Pubitemid 33300814)
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. (Pubitemid 129609609)
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. (Pubitemid 46330567)
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. (Pubitemid 46367782)
9. 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.
10. 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.
11. C. Gregorio-Rodríguez & M. NúnTez (1999): Denotational semantics for probabilistic refusal testing. ENTCS 22, pp. 111-137.
12. 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.
13. He Jifeng, K. Seidel & A.K. McIver (1997): Probabilistic models for the guarded command language. Science of Computer Programming 28, pp. 171-192. (Pubitemid 127412773)
14. M. Hennessy (1988): An Algebraic Theory of Processes. MIT Press.
15. C.A.R. Hoare (1985): Communicating Sequential Processes. Prentice-Hall.
16. C. Jones & G.D. Plotkin (1989): A probabilistic powerdomain of evaluations. In Proc. LICS'89, Computer Society Press, pp. 186-195.
17. B. Jonsson, C. Ho-Stuart & Wang Yi (1994): Testing and refinement for nondeterministic and probabilistic processes. In Proc. FTRTFT'94, LNCS 863, Springer, pp. 418-430.
18. B. Jonsson & Wang Yi (1995): Compositional testing preorders for probabilistic processes. In Proc. LICS'95, IEEE Computer Society Press, pp. 431-441.
19. B. Jonsson & Wang Yi (2002): Testing preorders for probabilistic processes can be characterized by simulations. Theoretical Computer Science 282(1), pp. 33-51. (Pubitemid 34715710)
20. C.-C. Jou & S.A. Smolka (1990): Equivalences, congruences, and complete axiomatizations for probabilistic processes. In Proc. CONCUR '90, LNCS 458, Springer, pp. 367-383.
21. M.Z. Kwiatkowska & G. Norman (1998): A testing equivalence for reactive probabilistic processes. ENTCS 16(2), pp. 114-132. (Pubitemid 40715937)
22. K.G. Larsen & A. Skou (1991): Bisimulation through probabilistic testing. Information and Computation 94(1), pp. 1-28. (Pubitemid 21694897)
23. G. Lowe (1993): Representing nondeterminism and probabilistic behaviour in reactive processes. Technical Report TR-11-93, Computing laboratory, Oxford University.
24. N. Lynch, R. Segala & F.W. Vaandrager (2003): Compositionality for probabilistic automata. In Proc. CONCUR'03, LNCS 2761, Springer, pp. 204-222.
25. R. Milner (1989): Communication and Concurrency. Prentice-Hall.
26. M.W. Mislove (2000): Nondeterminism and probabilistic choice: Obeying the laws. In Proc. CONCUR'00, LNCS 1877, Springer, pp. 350-364.
27. 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.
28. M. Núñez (2003): Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming 56, pp. 117-177.
29. E.-R. Olderog & C.A.R. Hoare (1986): Specification-oriented semantics for communicating processes. Acta Informatica 23, pp. 9-66.
30. R. Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT.
31. R. Segala (1996): Testing probabilistic automata. In Proc. CONCUR'96, LNCS 1119, Springer, pp. 299-314. (Pubitemid 126117769)
32. R. Segala & N.A. Lynch (1994): Probabilistic simulations for probabilistic processes. In Proc. CONCUR'94, LNCS 836, Springer, pp. 481-496.
33. K. Seidel (1995): Probabilistic communicating processes. Theoretical Computer Science 152(2), pp. 219-249.
34. R. Tix, K. Keimel & G.D. Plotkin (2005): Semantic domains for combining probability and non-determinism. ENTCS 129, pp. 1-104.
35. Wang Yi & K.G. Larsen (1992): Testing probabilistic and nondeterministic processes. In Proc. PSTV'92, IFIP Transactions C-8, North-Holland, pp. 47-61.