Scalar outcomes suffice for finitary probabilistic testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4421 LNCS, Issue , 2007, Pages 363-378

  Deng, Yuxin ^a   Van Glabbeek, Rob ^a,b   Morgan, Carroll ^a   Zhang, Chenyi ^a,b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONCURRENT ENGINEERING; EQUIVALENCE CLASSES; PROBABILISTIC LOGICS; PROBLEM SOLVING;

BISIMULATION; PROBABILISTIC GENERALISATION; PROBABILISTIC TESTING; SCALAR-VALUED PHENOMENA;

STATISTICAL TESTS;

EID: 37149040504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_25     Document Type: Conference Paper

References (21)

1. S. ABRAMSKY & A. JUNG (1994): Domain theory. In S. Abramsky, D.M. Gabbay & T.S.E. Maibaum, editors: Handbook of Logic and Computer Science, volume 3, Clarendon Press, pp. 1-168.
2. C.D. ALIPRANTIS & K.C. BORDER (1999): Infinite Dimensional Analysis. Springer, second edition.
3. S. CATTANI & R. SEGALA (2002): Decision algorithms for probabilistic bisimulation. In Proc. CONCUR 2002, LNCS 2421, Springer, pp. 371-85.
4. R. DE NICOLA & M. HENNESSY (1984): Testing equivalences for processes. Theoretical Computer Science 34, pp. 83-133.
5. H. HANSSON & B. JONSSON (1990): A calculus for communicating systems with time and probabilities. In Proc. of the Real-Time Systems Symposium (RTSS '90), IEEE Computer Society Press, pp. 278-87.
6. HE JIFENG, K. SEIDEL & A.K. MCIVER (1997): Probabilistic models for the guarded command language. Science of Computer Programming 28, pp. 171-92.
7. C.A.R. HOARE (1985): Communicating Sequential Processes. Prentice Hall.
8. B. JONSSON, C. HO-STUART & WANG YI (1994): Testing and refinement for nondeterministic and probabilistic processes. In Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, Springer, pp. 418-30.
9. B. JONSSON & WANG YI (2002): Testing preorders for probabilistic processes can be characterized by simulations. Theoretical Computer Science 282(1), pp. 33-51.
10. D. KOZEN (1985): A probabilistic PDL. JnI. Comp. Sys. Sciences30(2), pp. 162-78.
11. J. MATOUSEK (2002): Lectures on Discrete Geometry. Springer.
12. A.K. MclVER & CC. MORGAN (2002): Games, probability and the quantitative μ-calculus qMu. In Proc. LPAR, LNAI 2514, Springer, pp. 292-310.
13. A.K. MCIVER & C.C. MORGAN (2005): Abstraction, Refinement and Proof for Probabilistic Systems. Tech. Mono. Comp. Sci., Springer.
14. C.C. MORGAN, A.K. MCIVER & K. SEIDEL (1996): Probabilistic predicate transformers. ACM Trans. on Programming Languages and Systems 18(3), pp. 325-53.
15. A. PHILIPPOU, I. LEE & O. SOKOLSKY (2000): Weak bisimulation for probabilistic systems. In Proc. CONCUR 2000, Springer, pp. 334-49.
16. M.L. PUTERMAN (1994): Markov Decision Processes. Wiley.
17. R. SEGALA (1996): Testing probabilistic automata. In Proc. CONCUR '96, LNCS 1119, Springer, pp. 299-314.
18. R. SEGALA & N. A. LYNCH (1994): Probabilistic simulations for probabilistic processes. In Proc. CONCUR '94, LNCS 836, Springer, pp. 481-96.
19. M.I.A. STOELINGA & F.W. VAANDRAGER (2003): A testing scenario for probabilistic automata. In Proc. ICALP '03, LNCS 2719, Springer, pp. 407-18.
20. M. Y. VARDI (1985): Automatic verification of probabilistic concurrent finite state programs. In Proc. FOCS '85, IEEE Computer Society Press, pp. 327-38.
21. WANG YI & K.G. LARSEN (1992): Testing probabilistic and nondeterministic processes. In Proc. IFIP TC6/WG6.1 Twelfth Intern. Symp. on Protocol Specification, Testing and Verification, IFIP Transactions C-8, North-Holland, pp. 47-61.