The demonic product of probabilistic relations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2303, Issue , 2002, Pages 114-128

  Doberkat, Ernst Erich ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Bisimulation; Concurrency; Demonic product; Probabilistic relations

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; CONCURRENCY; DEMONIC PRODUCT; PROBABILISTIC RELATIONS;

COMPUTATION THEORY;

EID: 84948987725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_9     Document Type: Conference Paper

References (19)

1. S. Abramsky, R. Blute, and P. Panangaden. Nuclear and trace ideal in tensored *-categories. Technical report, School of Computer Science, McGill University, Montreal, June 1998.
2. C. Brink, W. Kahl, and G. Schmidt, editors. Relational Methods in Computer Science. Advances in Computing Science. Springer-Verlag, Wien, New York, 1997.
3. E. P. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Technical Report SEN-R9825, CWI, Amsterdam, 1998.
4. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation of labelled markovprocesses. Technical report, Sc hool of Computer Science, McGill University, Montreal, 1998.
5. J. Desharnais, A. Mili, and T. T. Nguyen. Refinement and demonic semantics. In [2], pages 166-184.
6. E.-E. Doberkat. Stochastic Automata — Nondeterminism, Stability, and Prediction, volume 113 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1981.
7. E. E. Doberkat. The converse of a probabilistic relation. Technical Report 113, Chair for Software Technology, University of Dortmund, June 2001.
8. E.-E. Doberkat. The demonic product of probabilistic relations. Technical Report 116, Chair for Software Technology, University of Dortmund, September 2001. Available as Technische-Berichte/Doberkat SWT-Memo-116. ps. gz in directory ftp://ls10-www.cs.uni-dortmund.de/pub/.
9. E.-E. Doberkat. The hierarchical refinement of probabilistic relations. Technical Report 118, Chair for Software Technology, Univ ersity of Dortmund, November 2001.
10. M. Giry. A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis, v olume 915 of Lecture Notes in Mathematics, pages 68–85, Berlin, 1981. Springer-Verlag.
11. C. J. Himmelberg. Measurable relations. Fund. Math., 87:53–72, 1975.
12. S. Mac Lane. Categories for the Working Mathematician. Number 5 in Graduate Texts in Mathematics. Springer-Verlag, Berlin, 2 edition, 1997.
13. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1–28, 1991.
14. R. Milner. A Calculus of CommunicatingSystems. Number 92 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1980.
15. L. S. Moss. Coalgebraic logic. Annals of Pure and Applied Logic, 96:277–317, 1999.
16. P. Panangaden. Probabilistic relations. In C. Baier, M. Huth, M. Kwiatkowska, and M. Ryan, editors, Proc. PROBMIV, pages 59–74, 1998. Also available from the School of Computer Science, McGill University, Montreal.
17. K. R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, New York, 1967.
18. J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, Amsterdam, 1996.
19. S. M. Srivastava. A Course on Borel Sets. Number 180 in Graduate Texts in Mathematics. Springer-Verlag, Berlin, 1998.