A testing equivalence for reactive probabilistic processes

Electronic Notes in Theoretical Computer Science

Volumn 16, Issue 2, 1998, Pages 114-132

  Kwiatkowska, M Z ^a   Norman, G J ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SIMULATION; MATHEMATICAL MODELS; RANDOM PROCESSES;

PROBABILISTIC BISIMULATIONS; PROBABILISTIC EQUIVALENCES; PROCESS ALGEBRAS; REACTIVE PROBABILISTIC TRANSITION SYSTEMS;

PROBABILITY;

EID: 0006470244     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00121-5     Document Type: Conference Paper

References (27)

1. Abramsky S. Observational equivalence as a testing equivalence. Theoretical Computer Science. 53:1987;225-241
2. C. Baier. Polynomial time algorithms for testing probabilistic bisimulation and simulation. In Proc. CAV'96, volume 1102 of Lecture Notes in Computer Science, pages 38-49, Springer Verlag, 1996.
3. C. Baier and M.Z. Kwiatkowska. Domain equations for probabilistic processes (Extended Abstract). In Proc. EXPRESS Workshop, volume 7, Electronic Notes in Theoretical Computer Science, Elsevier, 1997.
4. Bergstra J.A., Klop J.W. Process algebra for synchronous communication. Information and Computation. 60:1984;109-134
5. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. Proc. Foundations of Software Technology and Theoretical Computer Science, in volume 1026 of Lecture Notes in Computer Science, pages 499-513, Springer Verlag, 1995.
6. B. Bloom and A.R. Meyer. A remark on bisimulation between probabilistic processes. In A.R. Meyer and M.A. Taitslin, editors, Symp. on Logical Foundations of Computer Science, volume 363 of Lecture Notes in Computer Science, pages 26-40, Springer Verlag, 1989.
7. Brookes S.D., Hoare C.A.R., Roscoe A.W. A theory of communicating sequential processes. Journal of the ACM. 31:(3):1984;560-599
8. J. Desharnais, A. Edalat and P. Panangaden. A logical characterization of bisimulation for labeled Markov processes. In Proc. 13th IEEE Symposium on Logic in Computer Science (LICS), pages 478-487, 1998.
9. A. Giacalone, C-C. Jou and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In M. Broy and C.B. Jones, editors, Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, pages 443-458, 1990.
10. R.J. van Glabbeek. The linear time-branching time spectrum. In J.C.M. Beaten and J.W. Klop editors, Proc. CONCUR'90, volume 458 of Lecture Notes in Computer Science, pages 278-297, Springer Verlag, 1990.
11. R.J. van Glabbeek, S.A. Smolka, B. Steffen and C.M.N. Tofts. Reactive, generative and stratified models of probabilistic processes. In Proc. 5th IEEE Int. Symp. on Logic in Computer Science (LICS), pages 130-141, 1990.
12. H.A. Hansson. Time and probability in the formal design of distributed systems. Volume 1 of Real-Time Safety Critical Systems, Elsevier, 1994.
13. Hennessy M.C.B., Milner R. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery. 32:(1):1985;137-161
14. M. Huth and M.Z. Kwiatkowska. Quantitative analysis and model checking. In Proc. 12th IEEE Int. Symp. on Logic in Computer Science (LICS), pages 111-122, 1997.
15. M. Huth. The interval domain: a matchmaker for aCTL and aPCTL. Technical Report CIS-97-17, Department of Computing and Information Sciences, Kansas State University, 1997.
16. M. Huth and M.Z. Kwiatkowska. Comparing CTL and PCTL on labeled Markov chains. In PROCOMET'98, IFIP, Chapman & Hall, 1998.
17. C-C. Jou and S.A. Smolka. Equivalences, congruences and complete axiomatisations for probabilistic processes. In J.C.M. Baeten and J.W. Klop, editors, CONCUR'90, volume 458 of Lecture Notes in Computer Science, pages 367-383, Springer Verlag, 1990.
18. M.Z. Kwiatkowska and G.J. Norman. A fully abstract metric-space denotational semantics for reactive probabilistic processes. In Proc. COMPROX'98, volume 13 of Electronic Notes in Theoretical Computer Science, Elsevier, 1998.
19. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Information and Computation. 94:(1):1991;1-28
20. G. Lowe. Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report, 1993. Available at http://www.mcs.le.ac. uk/~glowe/publications.html.
21. Milner R. Communication and concurrency. 1989;Prentice Hall
22. Morgan C., McIver A., Seidel K., Sanders J.W. Refinement-oriented probability for CSP. Formal Aspects of Computing. 8:(6):1996;617-647
23. G.J. Norman. Metric semantics for reactive probabilistic processes. Ph.D Thesis, School of Computer Science, The University of Birmingham, November 1997.
24. Roscoe A.W. The theory and practice of concurrency. Prentice Hall International Series in Computer Science. 1997
25. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proc. CONCUR'94, volume 836 of Lecture Notes in Computer Science, pages 481-496, Springer, 1994.
26. Seidel K. Probabilistic communicating processes. Theoretical Computer Science. 152:1995;219-249
27. Wang Yi and K.G. Larsen. Testing probabilistic and non-deterministic processes. Protocol Specification, Testing and Verification XII: 47-61, Florida, USA, 1992