Labelled Markov processes

Labelled Markov Processes

Volumn , Issue , 2009, Pages 1-199

  Panangaden, Prakash ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967579158     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/P595     Document Type: Book

References (113)

1. [Abr91a] S. Abramsky. A domain equation for bisimulation. Information and Computation, 92(2): 161-218, 1991.
2. [Abr91b] S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51: 1-77, 1991.
3. [AMESD98] M. Alvarez-Manilla, A. Edalat, and N. Saheb-Djahromi. An extension result for continuous valuations. Electronic Notes in Theoretical Computer Science, 13, 1998.
4. [AN87] E. J. Anderson and P. Nash. Linear Programming in Infinitedimensional Spaces. Discrete Mathematics and Computation. Wiley-Interscience, 1987.
5. [Arv76] W. Arveson. An Invitation to C*-Algebra. Springer-Verlag, 1976.
6. [Ash72] R. B. Ash. Real Analysis and Probability. Academic Press, 1972.
7. [ASSB96] Adnan Aziz, Kumud Sanwal, Vigyan Singhal, and Robert K. Brayton. Verifying continuous time Markov chains. In Proc. of Conference on Computer-Aided Verification, 1996.
8. [Bai] C. Baier. Zeno paths occur with probability zero. Private communication.
9. [Bai96] C. Baier. Polynomial time algorithms for testing probabilistic bisimulation and simulation. In Proceedings of the 8th International Conference on Computer Aided Verification (CAV'96), number 1102 in Lecture Notes in Computer Science, pages 38-49, 1996.
10. [BCFPP05] Alexandre Bouchard-Côté, Norm Ferns, Prakash Panangaden, and Doina Precup. An approximation algorithm for labelled markov processes: towards realistic approximation. In Proceedings of the 2nd International Conference on the Quantitative Evaluation of Systems (QEST), pages 54-61, September 2005.
11. [BCHG+97] Christel Baier, Ed Clark, Vasiliki Hartonas-Garmhausen, Marta Kwiatkowska, and Mark Ryan. Symbolic model checking for probabilistic processes. In Proceedings of the 24th International Colloquium On Automata Languages And Programming, number 1256 in Lecture Notes In Computer Science, pages 430-440, 1997.
12. [BdA95] A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Proceedings of the 15th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, number 1026 in Lecture Notes In Computer Science, pages 499-513, 1995.
13. [BDEP97] R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the Twelfth IEEE Symposium On Logic In Computer Science, Warsaw, Poland., 1997.
14. [Ber80] J. O. Berger. Statistical Decision Theory. Springer-Verlag, 1980.
15. [BH97] C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. In Proceedings of the 1997 International Conference on Computer Aided Verification, number 1254 in Lecture Notes In Computer Science. Springer-Verlag, 1997.
16. [BHHK00] C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In CAV 2000: Proceedings of the 12th Annual Symposium on Computer-Aided Verification, number 1855 in Lecture Notes In Computer Science, pages 358-372. Springer-Verlag, 2000.
17. [Bil95] P. Billingsley. Probability and Measure. Wiley-Interscience, 1995.
18. [BK08] Christel Baier and Joost-Pieter Katoen. Principles of Model Checking. MIT Press, 2008.
19. [Bre68] L. Breiman. Probability. Addison-Wesley, 1968.
20. [Cho53] G. Choquet. Theory of capacities. Ann. Inst. Fourier (Grenoble), 5: 131-295, 1953.
21. [Chv83] Vasek Chvatal. Linear Programming. W. H. Freeman and Company, 1983.
22. [CM65] D. R. Cox and H. D. Miller. The Theory of Stochastic Processes. Chapman and Hall, 1965.
23. [dA97] L. de Alfaro. Formal Verification of Probabilistic Systems. PhDthesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.
24. [dAHM03] L. de Alfaro, T. Henzinger, and R. Majumdar. Discounting the future in systems theory. In J. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger, editors, Thirtieth International Colloquium On Automata Languages And Programming, number 2719 in Lecture Notes In Computer Science, pages 1022-1037. Springer-Verlag, 2003.
25. [dAKN+00] L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems 2000, number 1785 in Lecture Notes In Computer Science, pages 395-410. Springer-Verlag, 2000.
26. [DD03a] Vincent Danos and Josée Desharnais. A fixpoint logic for labeled Markov Processes. In Zoltan Esik and Igor Walukiewicz, editors, Proceedings of an international Workshop FICS'03 (Fixed Points in Computer Science), Warsaw, 2003.
27. [DD03b] Vincent Danos and Josée Desharnais. Labeled Markov Processes: Stronger and faster approximations. In Proceedings of the 18th Symposium on Logic in Computer Science, Ottawa, 2003. IEEE.
28. [DDP03] Vincent Danos, Josée Desharnais, and Prakash Panangaden. Conditional expectation and the approximation of labelled markov processes. In Roberto Amadio and Denis Lugiez, editors, CONCUR 2003-Concurrency Theory, volume 2761 of Lecture Notes In Computer Science, pages 477-491. Springer-Verlag, 2003.
29. [DDP04] Vincent Danos, Josée Desharnais, and Prakash Panangaden. Labelled markov processes: Stronger and faster approximations. Electronic Notes in Theoretical Computer Science, 87: 157-203, November 2004.
30. [DEP98] J. Desharnais, A. Edalat, and P. Panangaden. A logical characterization of bisimulation for labelled Markov processes. In proceedings of the 13th IEEE Symposium On Logic In Computer Science, Indianapolis, pages 478-489. IEEE Press, June 1998.
31. [DEP02] J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labeled Markov processes. Information and Computation, 179(2): 163-193, Dec 2002.
32. [Des99] J. Desharnais. Labelled Markov Processes. PhD thesis, McGill University, November 1999.
33. [DGJP99] J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. In Proceedings of CONCUR99, number 1664 in Lecture Notes in Computer Science. Springer-Verlag, 1999.
34. [DGJP00] J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximation of labeled Markov processes. In Proceedings of the Fifteenth Annual IEEE Symposium On Logic In Computer Science, pages 95-106. IEEE Computer Society Press, June 2000.
35. [DGJP02a] J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for labelled Markov processes. In Proceedings of the Seventeenth Annual IEEE Symposium On Logic In Computer Science, pages 413-422, July 2002.
36. [DGJP02b] J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Weak bisimulation is sound and complete for pctl*. In L. Brim, P. Jancar, M. Kretinsky, and A. Kucera, editors, Proceedings of 13th International Conference on Concurrency Theory, CONCUR02, number 2421 in Lecture Notes In Computer Science, pages 355-370. Springer-Verlag, 2002.
37. [DGJP03] J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labeled Markov processes. Information and Computation, 184(1): 160-200, July 2003.
38. [DGJP04] Josée Desharnais, Vineet Gupta, Radhakrishnan Jagadeesan, and Prakash Panangaden. A metric for labelled Markov processes. Theoretical Computer Science, 318(3): 323-354, June 2004.
39. [Dil88] D. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1988.
40. [Dob03] E.-E. Doberkat. Semi-pullbacks and bisimulations in categories of stochastic relations. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeinger, editors, Proceedings of the 27th International Colloquium On Automata Languages And Programming, ICALP'03, number 2719 in Lecture Notes In Computer Science, pages 996-1007. Springer-Verlag, July 2003.
41. [DP03] Josée Desharnais and Prakash Panangaden. Continuous stochastic logic characterizes bisimulation for continuous-time Markov processes. Journal of Logic and Algebraic Progamming, 56: 99-115, 2003. Special issue on Probabilistic Techniques for the Design and Analysis of Systems.
42. [Dud89] R. M. Dudley. Real Analysis and Probability. Wadsworth and Brookes/Cole, 1989.
43. [dVR99] E. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science, 221(1/2): 271-293, June 1999.
44. [Eda99] Abbas Edalat. Semi-pullbacks and bisimulation in categories of Markov processes. Mathematical Structures in Computer Science, 9(5): 523-543, 1999.
45. [FCPP06] N. Ferns, P. Castro, P. Panangaden, and D. Precup. Methods for computing state similarity in Markov decision processes. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, pages 174-181, 2006.
46. [Fel71] W. Feller. An Introduction to Probability Theory and its Applications II. John Wiley and Sons, 2nd edition, 1971.
47. [Fer08] Norm Ferns. State-Similarity Metrics for Continuous Markov Decision Processes. PhD thesis, McGill University, 2008.
48. [FPP04] Norm Ferns, Prakash Panangaden, and Doina Precup. Metrics for finite markov decision precesses. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, pages 162-169, July 2004.
49. [FPP05] Norm Ferns, Prakash Panangaden, and Doina Precup. Metrics for markov decision processes with infinite state spaces. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, pages 201-208, July 2005.
50. [Ger85] Robert Geroch. Mathematical Physics. Chicago Lectures in Physics. University of Chicago Press, 1985.
51. [Gir81] M. Giry. A categorical approach to probability theory. In B. Banaschewski, editor, Categorical Aspects of Topology and Analysis, number 915 in Lecture Notes In Mathematics, pages 68-85. Springer-Verlag, 1981.
52. [GJP04] Vineet Gupta, Radhakrishnan Jagadeesan, and Prakash Panangaden. Approximate reasoning for real-time probabilistic processes. In The Quantitative Evaluation of Systems, First International Conference QEST04, pages 304-313. IEEE Press, 2004.
53. [GJP06] Vineet Gupta, Radha Jagadeesan, and Prakash Panangaden. Approximate reasoning for real-time probabilistic processes. Logical Methods in Computer Science, 2(1): paper 4, 2006.
54. [GKK+80] G. Gierz, K. H. Hoffman, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott, editors. A compendium of continuous lattices. Springer-Verlag Berlin Heidelberg New York, 1980.
55. [GKK+03] G. Gierz, K. H. Hoffman, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. Continuous lattices and domains. Number 93 in Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2003.
56. [Hal74] P. Halmos. Measure Theory. Number 18 in Graduate Texts inMathematics. Springer-Verlag, 1974. Originally published in 1950.
57. [HCH+02] B. R. Haverkort, L. Cloth, H. Hermans, J.-P. Katoen, and C. Baier. Model checking performability properties. In Proceedings of the International COnference on Dependable Systems and Networks 2002, pages 102-113. IEEE Computer Society, June 2002.
58. [Her02] H. Hermanns. The Quest for Quantified Quality. Number 2428 in Lecture Notes In Computer Science. Springer-Verlag, 2002.
59. [Hil94] J. Hillston. A Compositional Approach to Performance Modelling. PhD thesis, University of Edinburgh, 1994. Published as a Distinguished Dissertation by Cambridge University Press in 1996.
60. [HJ90] H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pages 278-287. IEEE Computer Society Press, 1990.
61. [HJ94a] H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5): 512-535, 1994.
62. [HJ94b] J. Hoffman-Jørgenson. Probability With a View Towards Applications-2 volumes. Chapman and Hall, 1994.
63. [HK97] M. Huth and M. Kwiatkowska. Quantitative analysis and model checking. In proceedings of the 12 IEEE Symposium On Logic In Computer Science, pages 111-122. IEEE Press, 1997.
64. [Hut81] J. E. Hutchinson. Fractals and self-similarity. Indiana Univ. Math. J., 30: 713-747, 1981.
65. [Jec71] Thomas J. Jech. Lectures in Set Theory. Number 217 in Lecture Notes In Mathematics. Springer-Verlag, 1971.
66. [JL91] B. Jonsson and K. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the 6th Annual IEEE Symposium On Logic In Computer Science, 1991.
67. [Jon90] C. Jones. Probabilistic Non-determinism. PhD thesis, University of Edinburgh, 1990. CST-63-90.
68. [Jos92] M. B. Josephs. Receptive process theory. Acta Informatica, 29(1): 17-31, February 1992.
69. [JP89] C. Jones and G. D. Plotkin. A probabilistic powerdomain of evalu ations. In Proceedings of the Fourth Annual IEEE Symposium On Logic In Computer Science, pages 186-195, 1989.
70. [JS90] C.-C. Jou and S. A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. In J. C. M. Baeten and J. W. Klop, editors, CONCUR 90 First International Conference on Concurrency Theory, number 458 in Lecture Notes In Computer Science. Springer-Verlag, 1990.
71. [JT98] A. Jung and R. Tix. The troublesome probabilistic powerdomain. Electronic Notes in Theoretical Computer Science, 13, 1998.
72. [Jun88] A. Jung. Cartesian Closed Categories of Domains. PhD thesis, Technischen Hogschule Darmstadt, 1988.
73. [Kec95] Alexander S. Kechris. Classical Descriptive set Theory, volume 156 of Graduate Texts in Mathematics. Springer-Verlag, 1995.
74. [KNP04] M. Kwiatkowska, G. Norman, and D. Parker. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, chapter Modelling and Verification of Probabilistic Systems, pages 93-215. Number 23 in CRM Lecture Notes. American Mathematical Society, 2004.
75. [KNP05] M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic model checking in practice: Case studies with prism. ACM Performance Evaluation Review, 32(4): 16-21, March 2005.
76. [Koz81] D. Kozen. Semantics of probabilistic programs. Journal of Computer and Systems Sciences, 22: 328-350, 1981.
77. [Koz85] D. Kozen. A probabilistic PDL. Journal of Computer and Systems Sciences, 30(2): 162-178, 1985.
78. [KS60] J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, 1960.
79. [KT66] J. F. C. Kingman and S. J. Taylor. Introduction to Measure and Probability. Cambridge University Press, 1966.
80. [Law63] F. W. Lawvere. Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U. S. A., 50: 869-872, 1963.
81. [Law82] J. D. Lawson. Valuations on continuous lattices. In R.-E. Hoffman, editor, Continuous lattices and related topics, volume 27 of Mathematik Arbeitspapiere, pages 204-225. Universität Bremen, 1982.
82. [Law97] J. Lawson. Spaces of maximal points. Mathematical Structures in Computer Science, 7(5): 543-555, October 1997.
83. [LS91] K. G. Larsen and A. Skou. Bisimulation through probablistic testing. Information and Computation, 94: 1-28, 1991.
84. [LT89] N. A. Lynch and M. R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3): 219-246, 1989.
85. [MA86] E. Manes and M. Arbib. Algebraic Approaches to Program Semantics. Springer-Verlag, 1986.
86. [Mil80] R. Milner. A Calculus for Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
87. [MMW04] D. Pavlovic M. Mislove, J. Ouaknine and J. Worrell. Duality for labelled markov processes. In I. Walukiewicz, editor, Foundations of Software Science and Computation Structures, FOSSACS, volume 2987 of Lecture Notes In Computer Science, pages 393-407, 2004.
88. [Mos80] Yiannis N. Moschovakis. Descriptive Set Theory. Elsevier North Holland, 1980.
89. [MOW03] M. W. Mislove, J. Ouaknine, and J. B. Worrell. Axioms for probability and nondeterminism. In Proceedings of EXPRESS 2003, 2003. Appeared as an issue of ENTCS.
90. [MR95] R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
91. [Pac78] J. Pachl. Disintegration and compact measures. Math. Scand., 43: 157-168, 1978.
92. [Pan99] Prakash Panangaden. The category of Markov processes. ENTCS, 22: 17 pages, 1999. http://www.elsevier. nl/locate/entcs/volume22. html.
93. [Par67] K. R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, 1967.
94. [Par81] David Park. Title unknown. Slides for Bad Honnef Workshop on Semantics of Concurrency, 1981.
95. [PLS00] A. Philippou, I. Lee, and O. Sokolsky. Weal bisimulation for probabilistic processes. In C. Palamidessi, editor, Proceedings of CONCUR 2000, number 1877 in Lecture Notes In Computer Science, pages 334-349. Springer-Verlag, 2000.
96. [Pop94] Sally Popkorn. First Steps in Modal Logic. Cambridge University Press, 1994.
97. [PS85] J. L Peterson and A. Silberschatz. Operating System Concepts. Addison-Wesley Inc., 1985.
98. [Put94] Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, 1994.
99. [RdV97] J. J. M. M. Rutten and E. de Vink. Bisimulation for probabilistic transition systems: a coalgebraic approach. In P. Degano, editor, Proceedings of ICALP 97, number 1256 in Lecture Notes In Computer Science, pages 460-470. Springer-Verlag, 1997.
100. [Rud66] W. Rudin. Real and Complex Analysis. McGraw-Hill, 1966.
101. [San04] Davide Sangiorgi. Bisimulation and coinduction: from the origins to today. slides for an Invited Talk at LICS 2004, 2004.
102. [SD80] N. Saheb-Djahromi. Cpos of measures for nondeterminism. Theoretical Computer Science, 12(1): 19-37, 1980.
103. [Seg06] R. Segala. Probability and nondeterminism in operational models of concurrency. In Proceedings of the 17th International Conference on Concurrency Theory CONCUR '06, number 4137 in Lecture Notes In Computer Science, pages 64-78, 2006.
104. [SL94] R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proceedings of CONCUR94, number 836 in Lecture Notes In Computer Science, pages 481-496. Springer-Verlag, 1994.
105. [Sol70] R. M. Solovay. A model of set theory in which every set of reals is lebesgue measurable. Annals of Mathematics, 92: 1-56, 1970.
106. [SP82] M. B. Smyth and G. D. Plotkin. The category theoretic solution of recursive domain equations. Siam Journal of Computing, 11(4), 1982.
107. [Sri98] Sashi Mohan Srivastava. A course on Borel sets. Number 180 in Graduate Texts in Mathematics. Springer-Verlag, 1998.
108. [SV03] M. I. A. Stoelinga and F. W. Vaandrager. A testing scenario for probabilistic automata. In Proceedings of the 30th International colloquium on automata, languages and programming (ICALP'03), volume 2719 of Lecture Notes in Computer Science, pages 407-418. Springer-Verlag, 2003.
109. [Vaa91] F. W. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 387-398. IEEE Computer Society Press, July 1991.
110. [Var85] Moshe Vardi. Automatic verification of probabilistic concurrent finite-state programs. In 26th IEEE Symposium On Foundations Of Computer Science, pages 327-338, 1985.
111. [vBMOW05] Franck van Breugel, Michael Mislove, Joel Ouaknine, and James Worrell. Domain theory, testing and simulation for labelled markov processes. Theoretical Computer Science, 333(1-2): 171-197, 2005.
112. [vBW01] Franck van Breugel and James Worrell. An algorithm for quantitative verification of probabilistic systems. In K. G. Larsen and M. Nielsen, editors, Proceedings of the Twelfth International Conference on Concurrency Theory-CONCUR'01, number 2154 in Lecture Notes In Computer Science, pages 336-350. Springer-Verlag, 2001.
113. [Web] Russian Space Web. http://www.russianspaceweb. com/cosmos3. html. Web site.