Remarks on Testing Probabilistic Processes

Electronic Notes in Theoretical Computer Science

Volumn 172, Issue , 2007, Pages 359-397

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

^a CSIRO   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

complete axiomatisations; CSP; nondeterminism; Probabilistic processes; simulation; structural operational semantics; testing equivalences; transition systems

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; COMPUTER SIMULATION; DIFFERENTIATION (CALCULUS);

COMPLETE AXIOMATISATIONS; NONDETERMINISM; PROBABILISTIC PROCESSES; STRUCTURAL OPERATIONAL SEMANTICS; TESTING EQUIVALENCES; TRANSITION SYSTEMS;

PROBABILISTIC LOGICS;

EID: 33847639367     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.02.013     Document Type: Article

References (58)

1. Andova S., and Baeten J.C.M. Abstraction in probabilistic process algebra. Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. LNCS 2031 (2001), Springer 204-219
2. Andova S., Baeten J.C.M., and Willemse T.A.C. A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification. Proceedings of the 17th International Conference on Concurrency Theory. LNCS 4137 (2006), Springer 327-342
3. Abramsky S., and Jung A. Domain theory. Handbook of Logic and Computer Science volume 3 (1994), Clarendon Press 1-168
4. Andova S., and Willemse T.A.C. Branching bisimulation for probabilistic systems: Characteristics and decidability. Theoretical Computer Science 356 3 (2006) 325-355
5. Brookes S.D., Hoare C.A.R., and Roscoe A.W. A theory of communicating sequential processes. Journal of the ACM 31 3 (1984) 560-599
6. In: Bjørner D., and Jones C.B. (Eds). The Vienna Development Method: The Meta-Language. LNCS 61 (1978), Springer
7. Bandini E., and Segala R. Axiomatizations for probabilistic bisimulation. Proceedings of the 28th International Colloquium on Automata, Languages and Programming. LNCS 2076 (2001), Springer 370-381
8. Cazorla D., Cuartero F., Ruiz V.V., Pelayo F.L., and Pardo J.J. Algebraic theory of probabilistic and nondeterministic processes. Journal of Logic and Algebraic Programming 55 1-2 (2003) 57-103
9. Christoff I. Testing equivalences and fully abstract models for probabilistic processes. Proceedings the 3rd International Conference on Concurrency Theory. LNCS 458 (1990), Springer 126-140
10. Cleaveland R., Smolka S.A., and Zwarico A.E. Testing preorders for probabilistic processes. Proceedings of the 19th International Colloquium on Automata, Languages and Programming. LNCS 623 (1992), Springer 708-719
11. Derman C. Finite State Markovian Decision Processes (1970), Academic Press
12. De Nicola R., and Hennessy M. Testing equivalences for processes. Theoretical Computer Science 34 (1984) 83-133
13. Deng Y., and Palamidessi C. Axiomatizations for probabilistic finite-state behaviors. Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures. LNCS 3441 (2005), Springer 110-124
14. Deng Y., Palamidessi C., and Pang J. Compositional reasoning for probabilistic finite-state behaviors. Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. LNCS 3838 (2005), Springer 309-337
15. Elgot C.C., and Robinson A. Random-access stored-program machines, an approach to programming languages. Journal of the ACM 11 4 (1964) 365-399
16. A. Giacalone, C.-C. Jou & S.A. Smolka (1990): Algebraic reasoning for probabilistic concurrent systems. In Proceedings of IFIP TC 2 Working Conference on Programming Concepts and Methods, pp. 443-458
17. van Glabbeek R.J., Smolka S.A., Steffen B., and Tofts C.M.N. Reactive, generative, and stratified models of probabilistic processes. Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (1990), Computer Society Press 130-141
18. van Glabbeek R.J., and Weijland W.P. Branching time and abstraction in bisimulation semantics. Journal of the ACM 43 3 (1996) 555-600
19. Hennessy M. Powerdomains and nondeterministic recursive definitions. Proceedings of the 5th International Symposium on Programming. LNCS 137 (1982), Springer 178-193
20. Hennessy M. An Algebraic Theory of Processes (1988), MIT Press
21. Hansson H., and Jonsson B. A calculus for communicating systems with time and probabilities. Proceedings of the Real-Time Systems Symposium. (RTSS '90) (1990), Computer Society Press 278-287
22. Hoare C.A.R. Communicating Sequential Processes (1985), Prentice-Hall
23. He J., Seidel K., and McIver A.K. Probabilistic models for the guarded command language. Science of Computer Programming 28 (1997) 171-192
24. Jonsson B., Ho-Stuart C., and Yi W. Testing and refinement for nondeterministic and probabilistic processes. Proceedings of the 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. LNCS 863 (1994), Springer 418-430
25. Jonsson B., and Larsen K.G. Specification and refinement of probabilistic processes. Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science (1991), Computer Society Press 266-277
26. Jones C., and Plotkin G. A probabilistic powerdomain of evaluations. Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science (1989), Computer Society Press 186-195
27. Jonsson B., and Yi W. Compositional testing preorders for probabilistic processes. Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (1995), Computer Society Press 431-441
28. Jonsson B., and Yi W. Fully abstract characterization of probabilistic may testing. Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems. LNCS 1601 (1999), Springer 1-18
29. Jonsson B., and Yi W. Testing preorders for probabilistic processes can be characterized by simulations. Theoretical Computer Science 282 1 (2002) 33-51
30. Jonsson B., Yi W., and Larsen K.G. Probabilistic extensions of process algebras. Handbook of Process Algebra (2001), Elsevier 685-710 chapter 11
31. Kwiatkowska M.Z., and Norman G. A testing equivalence for reactive probabilistic processes. Electronic Notes in Theoretical Computer Science 16 2 (1998)
32. Landin P.J. The mechanical evaluation of expressions. Computer Journal 6 4 (1963) 308-320
33. G. Lowe (1993): Representing nondeterminism and probabilistic behaviour in reactive processes. Technical Report TR-11-93, Computing laboratory, Oxford University
34. Lowe G. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science 138 (1995) 315-352
35. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
36. Larsen K.G., and Skou A. Compositional verification of probabilistic processes. Proceedings of the 3rd International Conference on Concurrency Theory. LNCS 630 (1992), Springer 456-471
37. Lynch N., Segala R., and Vaandrager F.W. Compositionality for probabilistic automata. Proceedings of the 14th International Conference on Concurrency Theory. LNCS 2761 (2003), Springer 204-222
38. Lucas P. Formal definition of programming languages and systems. IFIP Congress volume 1 (1971) 291-297
39. Milner R. Communication and Concurrency (1989), Prentice-Hall
40. Mislove M.W. Nondeterminism and probabilistic choice: Obeying the laws. Proc. of CONCUR'00. LNCS 1877 (2000), Springer 350-364
41. McIver A.K., and Morgan C.C. Partial correctness for probabilistic programs. Theoretical Computer Science 266 1-2 (2001) 513-541
42. Morgan C.C., McIver A.K., and Seidel K. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18 3 (1996) 325-353
43. Morgan C.C., McIver A.K., Seidel K., and Sanders J.W. Refinement-oriented probability for CSP. Formal Aspects of Computing 8 6 (1996) 617-647
44. Mislove M.W., Ouaknine J., and Worrell J. Axioms for probability and nondeterminism. Electronic Notes in Theoretical Computer Science 96 (2004) 7-28
45. Olderog E.-R., and Hoare C.A.R. Specification-oriented semantics for communicating processes. Acta Informatica 23 (1986) 9-66
46. Park D.M.R. Concurrency and automata on infinite sequences. Proceedings of 5th GI Conference. LNCS 104 (1981), Springer 167-183
47. G.D. Plotkin (1981): A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus
48. Plotkin G.D. A Structural Approach to Operational Semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 17-139
49. Philippou A., Lee I., and Sokolsky O. Weak bisimulation for probabilistic systems. Proceedings of the 11th International Conference on Concurrency Theory. LNCS 1877 (2000), Springer 334-349
50. Rabin M.O. Probabilistic automata. Information and Control 6 (1963) 230-245
51. R. Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT
52. Segala R. Testing probabilistic automata. Proceedings of the 7th International Conference on Concurrency Theory. LNCS 1119 (1996), Springer 299-314
53. Segala R., and Lynch N.A. Probabilistic simulations for probabilistic processes. Proceedings of the 5th International Conference on Concurrency Theory. LNCS 836 (1994), Springer 481-496
54. Stoelinga M.I.A., and Vaandrager F.W. A testing scenario for probabilistic automata. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. LNCS 2719 (2003), Springer 407-418
55. Tix R., Keimel K., and Plotkin G.D. Semantic domains for combining probability and non-determinism. Electronic Notes in Theoretical Computer Science 129 (2005) 1-104
56. M.Y. Vardi (1985): Automatic verification of probabilistic concurrent finite-state programs. In Proceedings 26th Annual Symposium on Foundations of Computer Science, pp. 327-338
57. Varacca D., and Winskel G. Distributing probability over non-determinism. Mathematical Structures in Computer Science 16 1 (2006) 87-113
58. Yi W., and Larsen K.G. Testing probabilistic and nondeterministic processes. Proceedings of the IFIP TC6/WG6.1 Twelfth International Symposium on Protocol Specification, Testing and Verification. IFIP Transactions C-8 (1992), North-Holland 47-61