Stochastic relations: Foundations for markov transition systems

Stochastic Relations: Foundations for Markov Transition Systems

Volumn , Issue , 2007, Pages 1-346

  Doberkat, Ernst Erich ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67650276741     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781584889427     Document Type: Book

References (103)

1. Abowd, G., Allen, R., and Garlan, D. (1993). Using style to understand descriptions of software architecture. In Notkin, D., editor, SIGSOFT’93, volume 18 of Software Engineering Notes, pages 9 – 20. ACM. 〈p. 125, 126, 129〉
2. Abramsky, S., Blute, R., and Panangaden, P. (1999). Nuclear and trace ideal in tensored *-categories. J. Pure Appl. Algebra, 143(1 – 3):3 – 47. 〈p. 248, 249〉
3. Arbab, F. and Rutten, J. J. M. M. (2002). A coinductive calculus of component connectors. Technical Report SEN-R0216, CWI, Amsterdam. 〈p. xx, 129〉
4. Arveson, W. (1976). An Invitation to C*-Algebra. Graduate Texts in Mathematics. Springer-Verlag, New York. 〈p. xviii, 81, 248〉
5. Aumann, G. (1952). Relle Funktionen. Number 68 in Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin, Heidelberg, New York. 〈p. 222〉
6. Baier, C., Haverkort, B., Hermanns, H., and Katoen, J.-P. (2003). Model-checking algorithms for continuous time Markov chains. IEEE Trans. Softw. Eng., 29(6):524 – 541. 〈p. 326〉
7. Barbosa, L. M. (2001). Components as Coalgebras. PhD thesis, Universidade do Minho. 〈p. 126, 129〉
8. Barr, M. and Wells, C. (1985). Toposes, Triples and Theories. Number 278 in Grundlehren der mathematischen Wissenschaften. Springer-Verlag, New York, Berlin, Heidelberg, Tokyo. 〈p. 82〉
9. Barr, M. and Wells, C. (1999). Category Theory for Computing Science. Les Publications CRM, Montreal. 〈p. 82, 86〉
10. Billingsley, P. (1968). Convergence of Probability Measures. John Wiley & Sons, New York, 1st edition. 〈p. 81〉
11. Billingsley, P. (1995). Probability and Measure. John Wiley & Sons, New York. 〈p. 81〉
12. Billingsley, P. (1999). Convergence of Probability Measures. John Wiley & Sons, New York, 2nd edition. 〈p. 82〉
13. Blackburn, P., de Rjike, M., and Venema, Y. (2001). Modal Logic. Number 53 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK. 〈p. xi, 161, 254, 256, 316〉
14. Borceux, F. (1994a). Handbook of Categorical Algebra 1: Basic Category Theory, volume 50 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, UK. 〈p. 82〉
15. Borceux, F. (1994b). Handbook of Categorical Algebra 2: Categories and Structures, volume 51 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, UK. 〈p. 82〉
16. Bourbaki, N. (1989). General Topology, Chapters 5–10. Elements of Mathematics. Springer-Verlag, Berlin, Heidelberg, New York. 〈p. 11〉
17. Broy, M. and Stølen, K. (2001). Specification and Development of Interactive Systems. Monographs in Computer Science. Springer-Verlag, New York. 〈p. 127, 129〉
18. Bruni, R., Lanese, I., and Montanari, U. (2005). Complete axioms for stateless connectors. In Fiadeiro, J. L. and Rutten, J., editors, Proc. Algebra and Coalgebra in Computer Science, number 3629 in Lect. Notes Comp. Sci., pages 98 – 113. Springer-Verlag. 〈p. 129〉
19. Bryans, J., Bowman, H., and Derrick, J. (2003). Model checking stochastic automata. ACM Trans. Computational Logic, 4(4):452 – 493. 〈p. 127〉
20. Carboni, A., Lack, S., and Walters, R. (1993). Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra, 84:145 – 158. 〈p. 127, 129〉
21. Castaing, C. (1967). Sur les multi-applications mesurables. Rev. Française d’Informatique et de Recherche Operationelle, 1:91 – 126. 〈p. 81〉
22. Castaing, C. and Valadier, M. (1977). Convex Analysis and Measurable Multifunctions. Number 580 in Lect. Notes Math. Springer-Verlag, Berlin, Heidelberg, New York. 〈p. 81〉
23. Cîrstea, C. (2004). On logics for coalgebraic simulation. Elctr. Notes in Theor. Comp. Sci., 106:63 – 90. 〈p. 249〉
24. Cîrstea, C. and Pattinson, D. (2004). Modular construction on modal logics. In Gardner, P. and Yoshida, N., editors, Proc. CONCUR’04, number 3170 in Lect. Notes Comp. Sci., pages 258 – 275. 〈p. 325〉
25. Clarke, E. M., Grumberg, O., and Peled, D. A. (1999). Model Checking. The MIT Press, Cambridge, MA. 〈p. 326〉
26. D’Argenio, P. (1999). Algebras and Automata for Timed and Stochastic Systems. 7 〈p. 127〉
27. Desharnais, J., Edalat, A., and Panangaden, P. (2002). Bisimulation of labelled Markov-processes. Information and Computation, 179(2):163 – 193. 〈p. 128, 178, 266, 270, 326〉
28. Desharnais, J., Jagadeesan, R., Gupta, V., and Panangaden, P. (2000). Approximating labeled Markov processes. In Proc. 15th Ann. IEEE Symp. on Logic in Computer Science, pages 95 – 106, June. IEEE Computer Society. 〈p. 128, 248〉
29. Desharnais, J. and Panangaden, P. (2003). Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. Log. Alg. Programming, 56(1-2):99 – 115. 〈p. 286, 326〉
30. Doberkat, E.-E. (1981). Inserting an new element into a heap. BIT, 21(3):255 – 269. 〈p. 245, 246〉
31. Doberkat, E.-E. (2003). Semi-pullbacks and bisimulations in categories of stochastic relations. In Proc. ICALP’03, volume 2719 of Lect. Notes Comp. Sci., pages 996 – 1007, Berlin. Springer-Verlag. 〈p. 178, 270, 326〉
32. Doberkat, E.-E. (2004). The converse of a probabilistic relation. J. Logic and Algebraic Progr., 62(1):133 – 154. 〈p. 238〉
33. Doberkat, E.-E. (2006a). Hyperfinite approximations to labeled Markov transition systems. In Johnson, M. and Vene, V., editors, Proc. AMAST 2006, volume 4019 of Lect. Notes Comp. Sci., pages 127 – 141, Berlin. Springer-Verlag. 〈p. 128〉
34. Doberkat, E.-E. (2006b). Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence. Technical report, Chair for Software-Technology. 〈p. 325〉
35. Doberkat, E.-E., Engels, G., Hausmann, J. H., Lohmann, M., Pleumann, J., and Schröder, J. (2005). Software Engineering and eLearning: The Mu-SofT project. Technical report, Chair for Software Technology, University of Dortmund. 〈p. 129〉
36. Doberkat, E.-E., Schmidt, F., and Veltmann, C. (2000). Re-engineering the German integrated system for measuring and assessing environmental radioactivity. Environmental Modelling & Software, 15:267 – 278. 〈p. 96〉
37. Edalat, A. (1999). Semi-pullbacks and bisimulation in categories of Markov processes. Math. Struct. in Comp. Science, 9(5):523 – 543. 〈p. 158, 170, 173, 177〉
38. Elstrodt, J. (1999). Maß-und Integrationstheorie. Springer-Verlag, Berlin-Heidelberg-New York, 2 edition. 〈p. xiv〉
39. Fedorchuk, V. V. (1991). Probability measures in topology. Russian Math. Surveys, pages 45 – 93. (Uspekhi Mat. Nauk 46:1 (1991), 41 – 80). 〈p. 155〉
40. Fiadeiro, J. L. (2005). Categories for Software Engineering. Springer-Verlag, Berlin, Heidelberg. 〈p. 82〉
41. Fiadeiro, J. L. and Maibaum, T. (1996). A mathematical toolbox for the software architect. In Kramer, J. and Wolf, A., editors, Proc. 8th Intl. Workshop on Software Specification and Design. IEEE Computer Society Press. 〈p. 97, 126, 129〉
42. Fremlin, D. H. (2003). Measure Theory — vol. 4: Topological Measure Spaces. Torres Fremlin, Colchester. 〈p. 151, 152〉
43. Freyd, P. and Scedrov, A. (1990). Categories, Allegories. North Holland. 〈p. 249〉
44. Fuchssteiner, B. and Lusky, W. (1981). Convex Cones, volume 56 of North-Holland Mathematical Studies. North-Holland Publishing Company, Amsterdam. 〈p. 152〉
45. Giry, M. (1981). A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis, number 915 in Lect. Notes Math., pages 68 – 85, Berlin. Springer-Verlag. 〈p. 89, 128〉
46. Graham, R. E., Knuth, D. E., and Patashnik, O. (1989). Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading, MA. 〈p. 243〉
47. Gumm, H. P. and Schröder, T. (2005). Types and coalgebraic structure. Algebra univers., 53:229 – 252. 〈p. 249〉
48. Halmos, P. R. (1950). Measure Theory. Van Nostrand Reinhold, New York. 〈p. 6, 36, 42, 53, 57, 67〉
49. Heckmann, R. (1994). Probabilistic domains. In Tison, S., editor, Proc. 19th Int. Colloquium on Trees in Algebra and Programming, number 787 in Lect. Notes Comp. Sci., pages 142 – 156, Berlin. Springer-Verlag. 〈p. 155〉
50. Hennessy, M. and Milner, R. (1980). On observing nondeterminism and concurrency. In Proc. ICALP’80, number 85 in Lect. Notes Comp. Sci., pages 395 – 409, Berlin. Springer-Verlag. 〈p. 248, 325〉
51. Hewitt, E. and Stromberg, K. R. (1965). Real and Abstract Analysis. Springer-Verlag, Berlin, Heidelberg, New York. 〈p. 66〉
52. Himmelberg, C. J. (1975). Measurable relations. Fund. Math., 87:53 – 72. 〈p. 81〉
53. Himmelberg, C. J. and van Vleck, F. S. (1974). Multifunctions on abstract measurable spaces and applications to stochastic decision theory. Ann. Mat. Pura Appl., 101:229–236. 〈p. 81〉
54. Jacobs, K. (1978). Measure and Integral. Academic Press, New York. 〈p. 164〉
55. Joyal, A., Nielsen, M., and Winskel, G. (1996). Bisimulation from open maps. Information and Computation, 127(2):164 – 185. 〈p. 248〉
56. Kechris, A. S. (1994). Classical Descriptive Set Theory. Graduate Texts in Mathematics. Springer-Verlag, Berlin, Heidelberg, New York. 〈p. xviii, 61, 68, 81, 82, 248〉
57. Keisler, H. J. (1988). Infinitesimals in probability theory. In Cutland, N., editor, Nonstandard analysis and its applications, number 10 in London Mathematical Society Student Texts, pages 106 – 139. Cambridge University Press, Cambridge, UK. 〈p. 93〉
58. Kellerer, H. G. (Sommersemester 1972). Topologische Maßtheorie (in German). Lecture notes, Mathematisches Institut, Ruhr-Universität Bochum. 〈p. 11, 82〉
59. Knuth, D. E. (1973a). The Art of Computer Programming. Vol. I, Fundamental Algorithms. Addison-Wesley, Reading, Mass., 2 edition. 〈p. 243〉
60. Knuth, D. E. (1973b). The Art of Computer Programming. Vol. III, Sorting and Searching. Addison-Wesley, Reading, Mass. 〈p. 244–246〉
61. Kuratowski, K. (1966). Topology, volume I. PWN-Polish Scientific Publishers and Academic Press, Warsaw and New York. 〈p. 16, 81〉
62. Kurz, A. (2000). Logics for Coalgebras and Applications to Computer Science. PhD thesis, Institut für Informatik, Ludwigs-Maximilian-Universität München. 〈p. 248〉
63. Lajios, G. (2006). Zur kategoriellen Beschreibung von Schichtenarchitekturen. PhD thesis, Chair for Software Technology, University of Dortmund. 〈p. 127, 129, 177〉
64. Lang, S. (1965). Algebra. Addison-Wesley, Reading, Mass. 〈p. 204, 223, 249〉
65. Larsen, K. G. and Skou, A. (1991). Bisimulation through probabilistic testing. Information and Computation, 94:1 – 28. 〈p. 128, 256, 326〉
66. Lindstrøm, T. (1988). An invitation to nonstandard analysis. In Cutland, N., editor, Nonstandard analysis and its applications, number 10 in London Mathematical Society Student Texts, pages 1 – 105. Cambridge University Press, Cambridge, UK. 〈p. 93, 261〉
67. Loève, M. (1962). Probability Theory. Van Nostrand Company, Princeton, NJ, third edition. Later editions as Graduate Text in Mathematics, Springer. 〈p. 81〉
68. MacLane, S. (1997). Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer-Verlag, Berlin. 〈p. 74, 81, 82, 100, 128, 129, 132〉
69. Medvidovics, N., Rosenblum, D. S., Redmiles, D. F., and Robbins, J. E. (2002). Modeling software architectures in the Unified Modeling Language. ACM Trans. Softw. Eng. Method., 11(1):2 – 57. 〈p. 129〉
70. Moggi, E. (1989). An abstract view of programming languages. Lecture Notes, Stanford University. 〈p. 129〉
71. Moggi, E. (1991). Notions of computation and monads. Information and Computation, 93:55 – 92. 〈p. 129〉
72. Morgan, C., McIver, A., and Seidel, K. (1996). Probabilistic predicate transformers. ACM Trans. Prog. Lang. Syst., 18(3):325 – 353. 〈p. 94, 155〉
73. Moss, L. S. (1999). Coalgebraic logic. Annals of Pure and Applied Logic, 96:277 – 317. 〈p. 325〉
74. Moss, L. S. and Viglizzo, I. D. (2004). Harsanyi type spaces and final coalgebras constructed from satisfied theories. Electr. Notes Theor. Comp. Sci., pages 279 – 295. 〈p. 249〉
75. Panangaden, P. (1997). Stochastic techniques in concurrency. Technical report, BRICS, Dept. of Comp. Sci., Univ. of Aarhus. 〈p. 128〉
76. Panangaden, P. (1998). Probabilistic relations. In Baier, C., Huth, M., Kwiatkowska, M., and Ryan, M., editors, Proc. PROBMIV, pages 59 – 74. 〈p. 128〉
77. Parthasarathy, K. R. (1967). Probability Measures on Metric Spaces. Academic Press, New York. 〈p. 48, 81, 82, 238〉
78. Pattinson, D. (2004). Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic, 45(1):19 – 33. 〈p. 248, 325〉
79. Pleumann, J. (2004). Erfahrungen mit dem multimedialen didaktischen Modellierungswerkzeug DAVE. In Engels, G. and Seehusen, S., editors, Proc. 2nd German e-Learning Conference for Computer Science, number 52 in LNI, pages 55 – 66. Gesellschaft für Informatik, Springer-Verlag. 〈p. 129〉
80. Pumplün, D. (2003). Positively convex modules and ordered normed linear spaces. J. Convex Analysis, 10(1):109 – 127. 〈p. 143, 155〉
81. Rutten, J. J. M. M. (2000). Universal coalgebra: a theory of systems. Theoretical Computer Science, 249(1):3 – 80. Special issue on modern algebra and its applications. 〈p. xi, xviii, xx, 94, 177, 204, 222, 229, 248, 249〉
82. Rutten, J. J. M. M. (2002). Bisimulation in enumerative combinatorics. ENTCS, 65(1):1 – 19. 〈p. xx, 242〉
83. Rutten, J. J. M. M. (2003). Behavioral differential equations: a coinductive calculus of streams, automata and power series. Theor. Comp. Sci., 308:1 – 53. 〈p. 242〉
84. Schäl, M. (1974). A selection theorem for optimization problems. Arch. Math., 25(219 – 224). 〈p. 128〉
85. Semadeni, Z. (1973). Monads and their Eilenberg-Moore algebras in functional analysis. Queen’s Papers Pure Appl. Math., 33. 〈p. 128〉
86. Shaw, M. (2001). The coming-of-age of software architecture research. In Proc. 23rd International Conference on Software Engineering, pages 656 – 664. 〈p. 125〉
87. Shaw, M., DeLine, R., Klein, D. V., Ross, T. L., Young, D. M., and Zelesnik, G. (1995). Abstractions for software architecture and tools to support them. IEEE Trans. Softw. Eng., 21(4):314 – 335. 〈p. 125〉
88. Shaw, M. and Garlan, D. (1995). Formulations and formalisms in software architecture. In van Leeuwen, J., editor, Computer Science Today: Recent Trends and Developments, number 1000 in Lect. Notes Comp. Sci. Springer-Verlag. 〈p. 125, 129〉
89. Shaw, M. and Garlan, D. (1996). Software Architecture — Perspectives on an Emerging Discipline. Prentice-Hall. 〈p. 96, 125, 129〉
90. Shiryaev, A. N. (1996). Probability, volume 95 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, Heidelberg, New York, second edition. 〈p. 81〉
91. Sokolova, A. (2005). Coalgebraic Analysis of Probabilistic Systems. PhD thesis, Department of Computer Science, University of Eindhoven. 〈p. 128〉
92. Spivey, J. M. (1989). The Z Notation — A Reference Manual. Prentice-Hall. 〈p. 125〉
93. Srivastava, S. M. (1998). A Course on Borel Sets. Graduate Texts in Mathematics. Springer-Verlag, Berlin. 〈p. xviii, 24, 68, 81, 167, 178, 205, 222, 248〉
94. Swirszcz, T. (1974). Monadic functors and convexity. Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys., 22:39 – 42. 〈p. 155〉
95. Taylor, P. (1999). Practical Foundations of Mathematics, volume 59 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge. 〈p. 127〉
96. van Breugel, F., Mislove, M., Ouaknine, J., and Worrell, J. (2005). Domain theory, testing and simulation for labelled Markov processes. Theoret. Comp. Sci., 333:171 – 197. 〈p. 248〉
97. van Breugel, F., Shalit, S., and Worrell, J. (2002). Testing labelled Markov processes. In Proc. ICALP’2002, number 2380 in Lect. Notes Comp. Sci., pages 537–548, Berlin. Springer-Verlag. 〈p. 155〉
98. Viglizzo, I. D. (2005). Final sequences and final coalgebras for measurable spaces. In Fiadeiro, J. L. and Rutten, J., editors, Proc. Algebra and Coalgebra in Computer Science, number 3629 in Lect. Notes Comp. Sci., pages 395 – 407. Springer-Verlag. 〈p. 249〉
99. Wadler, P. (1992). Comprehending monads. Math. Struct. Comp. Sci., pages 461 – 493. 〈p. 82〉
100. Wagner, D. H. (1977). A survey of measurable selection theorems. SIAM J. Control Optim., 15(5):859 – 903. 〈p. 81〉
101. Wagon, S. (1981). Circle-squaring in the twentieth century. Math. Intell., 3(4):176 – 181. 〈p. xiv〉
102. Wermelinger, M. and Fiadeiro, J. L. (1998). Connectors for mobile programs. IEEE Trans. Softw. Eng., 24(5):331 – 341. 〈p. 97, 121, 126, 129〉
103. Williams, J. W. J. (1964). Algorithm 232: Heapsort. Comm. ACM, 7:347 – 348. 〈p. 245〉