A hierarchy of probabilistic system types

Theoretical Computer Science

Volumn 327, Issue 1-2, 2004, Pages 3-22

  Bartels, Falk ^a   Sokolova, Ana ^b   De Vink, Erik ^c  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Bisimulation; Coalgebra; Cocongruence; Preservation and reflection of bisimulation; Probabilistic bisimulation; Probabilistic transition systems

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; EMBEDDED SYSTEMS; PROBABILISTIC LOGICS; RANDOM PROCESSES; SEMANTICS;

COALGEBRA; COCONGRUENCE; PRESERVATION AND REFLECTION OF BISIMULATION; PROBABILISTIC BISIMULATION; PROBABILISTIC TRANSITION SYSTEMS;

COMPUTATION THEORY;

EID: 4944226235     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.019     Document Type: Conference Paper

References (28)

1. P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, A. Poigné (Eds.), Proceedings of the Third CTCS, Lecture Notes in Computer Sciences, Vol. 389, Springer, Berlin, 1989, pp. 357-365.
2. F. Bartels, A. Sokolova, E.P. de Vink, A hierarchy of probabilistic system types, in: H.P. Gumm (Ed.), Proceedings of the CMCS'03, ENTCS, Vol. 82, 2003.
3. M. Bernardo, Theory and application of extended Markovian process algebra, Ph.D. Thesis, University of Bologna, 1999.
4. P. D'Argenio, H. Hermanns, J.-P. Katoen, On generative parallel composition, in: Proceedings of the Probmiv'98, ENTCS, Vol. 22, Elsevier, Amsterdam, 1998.
5. J. Desharnais, A. Edalat, P. Panangaden, Bisimulation for labelled Markov processes, Inform. Comput. 179 (2002) 163-193.
6. E.P. de Vink, J.J.M.M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, Theoret. Comput. Sci. 221 (1999) 271-293.
7. H.P. Gumm, T. Schröder, Coalgebraic structure from weak pullback preserving functors, in: H. Reichel (Ed.), Proceedings of the CMCS 2000, ENTCS, Vol. 33, Elsevier, Amsterdam, 2000.
8. H. Hansson, Time and probability in formal design of distributed systems, Real-Time Safety Critical Systems, Vol. 1, Elsevier, Amsterdam, 1994.
9. H. Hermanns, Interactive Markov chains, Ph.D. Thesis, Universiät Erlangen-Nürnberg, 1998, Revised version appeared as Interactive Markov chains and the Quest for Quantified Quality, Lecture Notes in Computer Science, Vol. 2428, Springer, Berlin, 2002.
10. H. Hermanns, Interactive Markov chains, Ph.D. Thesis, Universiät Erlangen-Nürnberg, 1998, Revised version appeared as Interactive Markov chains and the Quest for Quantified Quality, Lecture Notes in Computer Science, Vol. 2428, Springer, Berlin, 2002.
11. J. Hillston, A compositional approach to performance modelling, Ph.D. Thesis, University of Edinburgh, 1994. Also appeared in the CPHC/BCS Distinguished Dissertation Series, Cambridge University Press, 1996.
12. J. Hillston, A compositional approach to performance modelling, Ph.D. Thesis, University of Edinburgh, 1994. Also appeared in the CPHC/BCS Distinguished Dissertation Series, Cambridge University Press, 1996.
13. B.P.F. Jacobs, J.J.M.M. Rutten, A tutorial on (co)algebras and (co)induction, Bulletin of the EATCS 62 (1996) 222-259.
14. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, University of Edinburgh, 1989.
15. B. Jonsson, K.G. Larsen, W. Yi, Probabilistic extensions of process algebras, in: Handbook of Process Algebras, Elsevier, North Holland, 2001.
16. A. Kurz, Logics for coalgebras and applications to computer science, Ph.D. Thesis, Ludwig-Maximilians-Universität München, 2000.
17. K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, Inform. Comput. 94 (1991) 1-28.
18. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
19. L.S. Moss, Coalgebraic logic, Ann. Pure Appl. Logic 96 (1999) 277-317.
20. A. Pnueli, L. Zuck, Probabilistic verification, Inform. Comput. 103 (1993) 1-29.
21. J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Theoret. Comput. Sci. 249 (2000) 3-80.
22. J.J.M.M. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: REX School/Symposium, Lecture Notes in Computer Science, Vol. 666, Springer, Berlin, 1993, pp. 530-582.
23. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. Thesis, Department of EECS, MIT, Cambridge, MA, 1995.
24. R. Segala, N.A. Lynch, Probabilistic simulations forprobabilistic processes, in: Proceedings of the Concur'94, Lecture Notes in Computer Sciences, Vol. 836, Springer, Berlin, 1994, pp. 481-496.
25. A. Sokolova, E.P. de Vink, Probabilistic automata: system types, parallel composition and comparison, in: C. Baier, B.R. Haverkort, H. Hermanns, J.-P. Katoen, M. Siegle (Eds.), Validation of Stochastic Systems, Lecture Notes in Computer Science, Vol. 2925, Springer, Berlin, 2004, pp. 1-44.
26. R.J. Van Glabbeek, S.A. Smolka, B. Steffen, Reactive, generative, and stratified models of probabilistic processes, Inform. Comput. 121 (1995) 59-80.
27. M.Y. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proceedings of the FOCS'85, Portland, Oregon, 1985, pp. 327-338.
28. U. Wolter, On correlations, cokernels, and coequations, in: H. Reichel (Ed.), Proceedings of the CMCS 2000, ENTCS, Vol. 33, 2000, 20pp.