Bisimulation for probabilistic transition systems: A coalgebraic approach

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

Volumn 1256, Issue , 1997, Pages 460-470

  De Vink, E P ^a   Rutten, J J M M ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Bisimulation; Borel measure; Coalgebra; Final coalgebra; Probabilistic transition system; Ul trametric space

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BISIMULATIONS; BOREL MEASURES; COALGEBRAS; FINAL COALGEBRAS; PROBABILISTIC TRANSITION SYSTEM; UL-TRAMETRIC SPACE;

AUTOMATA THEORY;

EID: 84951044449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. P. Aczel. Non- Well-Founded Sets. CSLI Lecture Notes 14. Center for the Study of Languages and Information, Stanford, 1988.
2. P. Aczel and N. Mendler. A final coalgebra theorem. In D.H. Pitt et al., editors, Proc. Category Theory and Computer Science, pages 357-365. LNCS 389, 1989.
3. P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer Systems and Sciences, 39:343-375, 1989.
4. M. Barr. Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 114:299-315, 1993. See also the addendum in Theoretical Computer Science, 124:189-192, 1994.]
5. R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proc. LICS’97. Warzaw, 1997.
6. J.W. de Bakker and E.P. de Vink. Control Flow Semantics. The MIT Press, 1996.
7. A. Edalat. Domain theory and integration. In Proc. LICS’94, pages 115-124. Paris, 1994.
8. A. Giacalone, C. Jou, and S.A. Smolka. Algebraic reasoning for probabilisitic concurrent systems. In Proc. Working Conference on Programming Concepts and Methods. IFIP TC2, Sea of Gallilee, 1990.
9. R.J. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121:59-80, 1995.
10. T.A. Henzinger. Hybrid automata with finite bisimulations. In Z. Fiilop and F. Gecseg, editors, Proc. ICALP’95, pages 324-335. LNCS 944, 1995.
11. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proc. LICS’91, pages 266-277. Amsterdam, 1991.
12. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Proc. LICS’89, pages 186-195. Asilomar, 1989.
13. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1-28, 1991.
14. J.J.M.M. Rutten and D. Turi. On the foundations of final semantics: nonstandard sets, metric spaces, partial orders. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Proc. REX Workshop on Semantics: Foundations and Applications, pages 477-530. LNCS 666, 1993.
15. J.J.M.M. Rutten and D. Turi. Initial algebra and final coalgebra semantics for concurrency. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Proc. REX School/Symposium ‘A Decade of Concurrency’, pages 530-582. LNCS 803, 1994.
16. W. Rudin. Real and Complex Analysis. McGraw-Hill, 1966.
17. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Report CS-R9652, CWI, 1996. Ftp-available at www.ftp.cwi.nlaspub/CWIreports/-AP/CS-R9652.ps.Z.