The category of Markov kernels

Electronic Notes in Theoretical Computer Science

Volumn 22, Issue , 1999, Pages 171-187

  Panangaden, Prakash ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; NETWORK PROTOCOLS; PROBABILISTIC LOGICS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

IMPERATIVE LANGUAGES; MARKOV KERNELS; PROBABILISTIC SEMANTICS; PROBABILITY THEORY;

MARKOV PROCESSES;

EID: 18944365879     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80602-4     Document Type: Conference Paper

References (21)

1. Abramsky S., Blute R., Panangaden P. Nuclear and trace ideals in tensor- categories. Journal of Pure and Applied Algebra. 1999;. available from www-acaps.cs.mcgill.ca/~prakash/
2. Abramsky S. Retracing some paths in process algebra. Montanari and Sassone Proceedings of CONCUR 96, number 1119 in Lecture Notes In Computer Science. 1996;1-17 Springer-Verlag
3. Ash R.B. Real Analysis and Probability. 1972;Academic Press
4. Barr M. *-Autonomous Categories. Number 752 in Lecture Notes in Mathematics. 1980;Springer-Verlag
5. 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.
6. Billingsley P. Probability and Measure. 1995;Wiley-Interscience
7. Blute R. Linear logic, coherence and dinaturality. Theoretical Computer Science. 115:1993;3-41
8. Desharnais J., Edalat A., Panangaden P. A logical characterization of bisimulation for labeled Markov processes. In Proceedings of the 13th IEEE Symposium On Logic In Computer Science, Indianapolis. June 1998;478-489 IEEE Press
9. Dudley R.M. Real Analysis and Probability. 1989;Wadsworth and Brookes/Cole
10. E. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach. In Proceedings of the 24th International Colloquium On Automata Languages And Programming, 1997.
11. Giry M. A categorical approach to probability theory. Banaschewski B. Categorical Aspects of Topology and Analysis, number 915 in Lecture Notes In Mathematics. 1981;68-85 Springer-Verlag
12. Gupta V., Jagadeesan R., Panangaden P. Stochastic processes as concurrent constraint programs. Proceedings of the 26th Proceedings Of The Annual ACM Symposium On Principles Of Programming Languages. 1999
13. Hoffman-Jørgenson J. Probability With a View Towards Applications. 2 volumes:1994;Chapman and Hall
14. Kozen D. Semantics of probabilistic programs. Journal of Computer and Systems Sciences. 22:1981;328-350
15. Kozen D. A probabilistic PDL. Journal of Computer and Systems Sciences. 30:(2):1985;162-178
16. Lawvere F.W. Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. U.S.A. 50:1963;869-872
17. Manes E., Arbib M. Algebraic Approaches to Program Semantics. 1986;Springer-Verlag
18. Saunders Mac Lane. Categories for the Working Mathematician. volume 5 of Graduate texts in Mathematics. 1971;Springer-Verlag, New York
19. P. Panangaden. Stochastic techniques in concurrency. www.sable.mcgill.ca/ ~prakash, 1997.
20. P. Panangaden. Probabilistic relations. In C. Baier, M. Huth, M. Kwiatkowska, and M. Ryan, editors, Preliminary Proceedings of PROBMIV′98, pages 59-74, 1998.
21. Probabilistic systems group, collected reports. Available from www.comlab.ox.ac.uk in the directory /oucl/groups/probs/bibliography.html.