Bisimulation for probabilistic transition systems: A coalgebraic approach

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 271-293

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

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Bisimulation; Borel measures; Coalgebras; Final coalgebra; Probabilistic transition systems; Ultrametric spaces

Indexed keywords

EID: 0001437652     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00035-3     Document Type: Article

References (43)

1. P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes, vol. 14, Center for the Study of Languages and Information, Stanford, 1988.
2. P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, A. Poigne (Eds.), Proc. Category Theory and Computer Science, Lecture Notes in Computer Science, vol. 389, 1989, pp. 357-365.
3. P. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, J. Comput. Systems Sci. 39 (1989) 343-375.
4. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (1993) 299-315. See also the addendum, Theoret. Comput. Sci. 124 (1994) 189-192.
5. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (1993) 299-315. See also the addendum, Theoret. Comput. Sci. 124 (1994) 189-192.
6. R. Blute, J. Deshamais, A. Edalat, P. Panangaden, Bisimulation for labeled Markov processes, in: Proc. 12 Annual IEEE Symp. On Logic In Computer Science, pp. 149-159, Warsaw, 1997. Full version submitted to Inform. and Comput.
7. M. Bernardo, R. Gorrieri, Extended Markovian process algebra, in: U. Montanari, V. Sassone (Eds.), Proc. CONCUR'96, Lecture Notes in Computer Science, vol. 1119, 1996, pp. 315-330.
8. C. Baier, M. Kwiatkowska, Domain equations for probabilistic processes, Technical Report CSR-97-7, University of Birmingham, 1997. Also appeared in Proc. EXPRESS'97, Electronic Notes in Theoretical Computer Science, vol. 7, Elsevier Science, Amsterdam, 1997.
9. A. Benveniste, B.C. Levy, E. Fabre, Paul Le Guernic, A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems, Theoret. Comput. Sci. 152 (1995) 171-217.
10. B. Bollobás, Graph Theory, Graduate Texts in Mathematics, vol. 63, Springer, Berlin, 1979.
11. M.M. Bonsangue, Topological Dualities in Semantics, Ph.D. Thesis, Vrije Universiteit Amsterdam, 1996. A revised version appeared as Electronic Notes in Theoretical Computer Science, vol. 8, Elsevier Science, Amsterdam, 1997.
12. J.W. de Bakker, E.P. de Vink, Control Flow Semantics, The MIT Press, Cambridge, MA, 1996.
13. J. Desharnais, A. Edalat, P. Panangaden, A logical characterization of bisimulation for labeled Markov processes, Proc. 13th Annual IEEE Symp. On Logic In Computer Science, Indianapolis, 1998, pp. 478-487.
14. A. Edalat, Domain theory and integration, Theoret. Comput. Sci. 151 (1995) 163-193.
15. A. Edalat, Dynamical systems, measures and fractals via domain theory, Inform. Comput. 120 (1995) 32-48.
16. M. Giry, A categorical approach to probability theory, in: B. Banaschewski (Ed.), Proc. Categorical Aspects of Topology and Analysis, Lecture Notes in Mathematics, vol. 915, 1981, pp. 68-85.
17. A. Giacalone, C. Jou, S.A. Smolka, Algebraic reasoning for probabilistic concurrent systems, in: M. Broy, C.B Jones (Eds.), Proc. Working Conference on Programming Concepts and Methods, IFIP TC2, Sea of Gallilee, 1990.
18. R.J. van Glabbeek, S.A. Smolka, B. Steffen, Reactive, generative and stratified models of probabilistic processes, Informat. Comput. 121 (1995) 59-80. Preliminary version (co-authored by C.M.N. Tofts) appeared in Proc. LICS'90, Philadelphia, 1990.
19. R.J. van Glabbeek, S.A. Smolka, B. Steffen, Reactive, generative and stratified models of probabilistic processes, Informat. Comput. 121 (1995) 59-80. Preliminary version (co-authored by C.M.N. Tofts) appeared in Proc. LICS'90, Philadelphia, 1990.
20. T.A. Henzinger, Hybrid automata with finite bisimulations, in: Z. Fülöp, F. Gécseg (Eds.), Proc. ICALP'95, Lecture Notes in Computer Science, vol. 944, 1995, pp. 324-335.
21. B. Jacobs, Objects and classes, co-algebraically, in: B. Freitag, C.B. Jones, C. Lengauer, H.-J. Schek (Eds.), Object-Orientation with Parallelism and Persistence, Kluwer, Dordrecht, 1996.
22. B. Jonsson, K.G. Larsen, Specification and refinement of probabilistic processes, Proc. LICS'91, Amsterdam, 1991, pp. 266-277.
23. A. Joyal, M. Nielsen, G. Winskel, Bisimulation from open maps, Inform. Comput. 127 (1996) 164-185.
24. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, University of Edinburgh, 1989.
25. C. Jones, G. Plotkin, A probabilistic powerdomain of evaluations, Proc. LICS'89, Asilomar, 1989, pp. 186-195.
26. B. Jacobs, J.J.M.M. Rutten, A tutorial on (co)algebras and (co)induction, Bull. EATCS 62 (1997) 222-259.
27. A.S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol. 156, Springer, Berlin, 1995.
28. R.M. Keller, Formal verification of parallel programs, Commun. ACM 19 (1976) 371-384.
29. M. Kwiatkowska, G. Norman, Probabilistic metric semantics for a simple language with recursion, in: W. Penczek, A. Szalas (Eds.), Proc. MFCS'96, Lecture Notes in Computer Science, vol. 1113, 1996, pp. 419-430.
30. K. Kunen, J.E. Vaughan (Eds.), Handbook of Set-Theoretic Topology, North-Holland, Amsterdam, 1984.
31. K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, Inform. Comput. 94 (1991) 1-28.
32. J. Meseguer, J.A. Goguen, Initiality, induction, and computability, in: M. Nivat, J.C. Reynolds (Eds.), Algebraic Methods in Semantics, Cambridge University Press, Cambridge, 1985, pp. 459-541.
33. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, 1980.
34. L.S. Moss, Coalgebraic logic, Draft, 1997, Ann. Pure Appl. Logic, to appear.
35. D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th GI Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, vol. 104, 1981, pp. 167-183.
36. G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Aarhus University, 1981.
37. H. Reichel, An approach to object semantics based on terminal coalgebras, Math. Struct. Comput. Sci. 5 (1995) 129-152.
38. J.J.M.M. Rutten, D. Turi, On the foundations of final semantics: non-standard sets, metric spaces, partial orders, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. REX Workshop on Semantics: Foundations and Applications, Lecture Notes in Computer Science, vol. 666, 1993, pp. 477-530.
39. J.J.M.M. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. REX School/Symposium 'A Decade of Concurrency', Lecture Notes in Computer Science, vol. 803, 1994, pp. 530-582.
40. W. Rudin, Real and Complex Analysis, McGraw-Hill, New York, 1966.
41. J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Report CS-R9652, CWI, 1996. Ftp-available at ftp.cwi.nl as pub/CWIreports/AP/CS-R9652.ps.Z. To appear in Theoretical Computer Science.
42. R. Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, Ph.D. Thesis, MIT, 1995.
43. K. Seidel, Probabilistic communicating processes, Theoret. Comput. Sci. 152 (1995) 219-249.