Bisimulation for labelled Markov processes

Information and Computation

Volumn 179, Issue 2, 2002, Pages 163-193

  Desharnais, Josée ^a   Edalat, Abbas ^b   Panangaden, Prakash ^c  

^a UNIVERSITÉ LAVAL   (Canada)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; COMPUTER SIMULATION; PROBABILISTIC LOGICS;

BISIMULATION;

MARKOV PROCESSES;

EID: 0037115172     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2962     Document Type: Conference Paper

References (53)

1. [AD94] Alur, R., and Dill, D. (1994), A theory of timed automata, Theoret. Comput. Sci. 126, 183-235.
2. [AHS96] Alur, R., Henzinger, T., and Sontag, E. (Eds.) (1996), "Hybrid Systems III," Lecture Notes in Computer Science, Vol. 1066, Springer-Verlag, Berlin.
3. [AJKvO97] Alur, R., Jagadeesan, L., Kott, J.J., and von Olnhausen, J.E. (1997), Model-checking of real-time systems: A telecommunications application, in "Proceedings of the 19th International Conference on Software Engineering.".
4. [AKNS97] Antsaklis, P., Kohn, W., Nerode, A., and Sastry, S. (Eds.) (1997), "Hybrid Systems IV," Lecture Notes in Computer Science, Vol. 1273, Springer-Verlag, Berlin.
5. [AM89] Aczel, P., and Mendler, N. (1989), A final-coalgebra theorem, in "Category Theory and Computer Science," Lecture Notes in Computer Science, Vol. 389, pp. 357-365, Springer-Verlag, Berlin/New York.
6. [Arn94] Arnold, A. (1994), "Finite Transition Systems," Prentice-Hall, Englewood Cliffs, NJ.
7. [Arv76] Arveson, W. (1976), "An Invitation to C*-Algebra," Springer-Verlag, Berlin.
8. [Ash72] Ash, R.B. (1972), "Real Analysis and Probability," Academic Press, San Diego.
9. [BDEP97] Blute, R., Desharnais, J., Edalat, A., and Panangaden, P. (1997), Bisimulation for labelled markov processes, in "Proceedings of the Twelfth IEEE Symposium on Logic in Computer Science, Warsaw, Poland.".
10. [Bil95] Billingsley, P. (1995), "Probability and Measure," Wiley-Interscience, New York.
11. [BK96] Baier, C., and Kwiatkowska, M. (1996), Domain equations for probabilistic processes, available at http://www.cs.bham.ac.uk/mzk/.
12. [BLFG95] Benveniste, A., Levy, B.C., Fabre, E., and Le Guernic, P. (1995), A calculus of stochastic systems for the specification, simulation and hidden state estimation of mixed stochastic/nonstochastic systems, Theoret. Comput. Sci. 152, 171-217.
13. [Cle90] Cleaveland, R. (1990), On automatically explaining bisimulation inequivalence, in "Computer-Aided Verification CAV 90" (E.M. Clarke and R.P. Kurshan, Eds.), Lecture Notes in Computer Science, Vol. 531, pp. 364-372, Springer-Verlag, Berlin/New York.
14. [CM65] Cox, D.R., and Miller, H.D. (1965). "The Theory of Stochastic Processes," Chapman & Hall, London.
15. [CN95] Cheng, A., and Nielsen, M. (1995), Open maps at work, in "Proceedings of the 15th Annual Conference on Foundations of Software Technology and Theoretical Computer Science" (P.S. Thiagarajan, Ed.), Lecture Notes in Computer Science, Vol. 1026, Springer-Verlag, Berlin.
16. [CSZ92] Cleaveland, R., Smolka, S., and Zwarico, A. (1992), Testing preorders for probabilistic processes, in "Proceedings of the International Colloquium on Automata Languages and Programming 1992," Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin.
17. [DEP98] Desharnais, J., Edalat, A., and Panangaden, P. (1998), A logical characterization of bisimulation for labeled Markov processes, in "Proceedings of the 13th IEEE Symposium on Logic in Computer Science, Indianapolis," pp. 478-489, IEEE Press, New York.
18. [Dud89] Dudley, R.M. (1989), "Real Analysis and Probability," Wadsworth and Brookes/Cole.
19. [dVR97] de Vink, E., and Rutten, J.J.M.M. (1997), Bisimulation for probabilistic transition systems: A coalgebraic approach, in "Proceedings of the 24th International Colloquium on Automata Languages and Programming.".
20. [Eda99] Edalat, A. (1999), "Semi-Pullbacks and Bisimulation in Categories of Markov Processes," Mathematical Structures in Computer Science.
21. [Gir81] Giry, M. (1981), A categorical approach to probability theory, in "Categorical Aspects of Topology and Analysis" (B. Banaschewski, Ed.), Lecture Notes in Mathematics, Vol. 915, pp. 68-85, Springer-Verlag, Berlin.
22. [GJP99] Gupta, V., Jagadeesan, R., and Panangaden, P. (1999), Stochastic processes as concurrent constraint programs, in "Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages.".
23. [GSS95] Gupta, V., Saraswat, V., and Struss, P. (1995), A model of a photocopier paper path, in "Proceedings of the 2nd IJCAI Workshop on Engineering Problems for Qualitative Reasoning.".
24. [Hal74] Halmos, P. (1974), "Measure Theory," Graduate Texts in Mathematics, No. 18, Springer-Verlag, Berlin. Originally published in 1950.
25. [HHWT97] Henzinger, T., Ho, P.-H., and Wong-Toi, H. (1997), Hytech: A model checker for hybrid systems, Software Tools for Technology Transfer 1, 110-122.
26. [Hil94] Hillston, J. (1994), "A Compositional Approach to Performance Modelling," Ph.D. thesis, University of Edinburgh. To be published as a Distinguished Dissertation by Cambridge Univ. Press.
27. [HK96] Huth, M., and Kwiatkowska, M. (1996), "On Probabilistic Model Checking," Technical Report CSR-96-15, University of Birmingham, available at http://www.cs.bham.ac.uk/mzk/.
28. [Hoa85] Hoare, C.A.R. (1985), "Communicating Sequential Processes," Series in Computer Science, Prentice-Hall International, London.
29. [JL91] Jonsson, B., and Larsen, K. (1991), Specification and refinement of probabilistic processes, in "Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science.".
30. [JNW96] Joyal., A., Nielsen, M., and Winskel, G. (1996), Bisimulation from open maps, Inform. and Comput. 127, 164-185.
31. [JS90] Jou, C.-C., and Smolka, S.A. (1990), Equivalences, congruences, and complete axiomatizations for probabilistic processes, in "CONCUR 90 First International Conference on Concurrency Theory" (J.C.M. Baeten and J.W. Klop, Eds.), Lecture Notes in Computer Science, Vol. 458, Springer-Verlag, Berlin.
32. [JY95] Jonsson, B., and Yi, W. (1995), Compositional testing preorders for probabilistic processes, in "Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science," pp. 431-441.
33. [Koz81] Kozen, D. (1981), Semantics of probabilistic programs, J. Comput. System Sci. 22, 328-350.
34. [Koz85] Kozen, D. (1985), A probabilistic PDL, J. Comput. System Sci. 30 (2), 162-178.
35. [KT66] Kingman, J.F.C., and Taylor, S.J. (1966), "Introduction to Measure and Probability," Cambridge Univ. Press, Cambridge, UK.
36. [LS91] Larsen, K.G., and Skou, A. (1991), Bisimulation through probablistic testing, Inform. and Comput. 94, 1-28.
37. [Mil80] Milner, R. (1980), "A Calculus for Communicating Systems" Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin.
38. [Mil89] Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
39. [Mil90] Milner, R. (1990), "Handbook of Theoretical Computer Science," Vol. B, Chap. Operational and Algebraic Senmantics of Concurrent Processes, pp. 1201-1242, MIT Press, Cambridge, MA.
40. [Pan98] Panangaden, P. (1999), Probabilistic relations, in "PRO MIV98" (C. Baier, M. Huth, M. Kwiatkowska, and M. Ryan, Eds.), pp. 59-74.
41. [Par67] Parthasarathy, K.R. (1967), "Probability Measures on Metric Spaces." Academic Press, San Diego.
42. [Pop94] Popkorn, S. (1994), "First Steps in Modal Logic," Cambridge Univ. Press, Cambridge, UK.
43. [Pro] Probabilistic systems group, Collected Reports, available at www.comlab.ox.ac.uk in the directory /oucl/groups/probs/bibliography.html.
44. [RdV97] Rutten, J.J.M.M., and de Vink, E. (1997), Bisimulation for probabilistic transition systems: A coalgebraic approach, in "Proceedings of ICALP 97" (P. Degano, Ed.), Lecture Notes in Computer Science, Vol. 1256, pp. 460-470, Springer-Verlag, Berlin.
45. [Rud66] Rudin, W. (1966), "Real and Complex Analysis," McGraw-Hill, New York.
46. [Rut95] Rutten, J.J.M.M. (1995), A calculus of transition systems (towards universal coalgebra), in "Modal Logic and Process Algebra, A Bisimulation Perspective" (A. Ponse, M. de Rijke, and Y. Venema, Eds.), CSLI Lecture Notes, Vol. 53, available at www.cwi.nl/janr.
47. [Rut96] Rutten, J.J.M.M. (1996), "Universal Coalgebra: A Theory of Systems," Technical Report CSR9652, CWI Amsterdam, available at www.cwi.nl/janr/papers/.
48. [SD78] Saheb-Djahromi, N. (1978), Probabilistic LCF, in "Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol. 64, Springer-Verlag, Berlin.
49. [SD80] Saheb-Djahromi, N. (1980), Cpos of measures for nondeterminism, Theoret. Comput. Sci. 12, 19-37.
50. [SL94] Segala, R., and Lynch, N. (1994), Probabilistic simulations for probabilistic processes, in "Proceedings of CONCUR94" (B. Jonsson and J. Parrow, Eds.), Lecture Notes in Computer Science, Vol. 836, pp. 481-496, Springer-Verlag, Berlin.
51. [Son90] Sontag, E. (1990), "Mathematical Control Theory," Texts in Applied Mathematics, No. 6, Springer-Verlag, Berlin.
52. [vGSST90] van Glabbeek, R., Smolka, S., Steffen, B., and Tofts, C. (1990), Reactive generative and stratified models for probabilistic processes, in "Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science.".
53. [WN95] Winskel, G., and Nielsen, M. (1995), Models for concurrency, in "Handbook of Logic in Computer Science," Vol. 4, Oxford Univ. Press, London.