A hierarchy of probabilistic system types

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 57-75

  Bartels, Falk ^a   Sokolova, Ana ^b   De Vink, Erik ^b,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; AUTOMATION; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; PROBABILISTIC LOGICS; SET THEORY;

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

HIERARCHICAL SYSTEMS;

EID: 4944236921     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80632-7     Document Type: Conference Paper

References (23)

1. M. Bernardo. Theory and Application of Extended Markovian Process Algebra. PhD thesis, University of Bologna, 1999.
2. F. Bartels, A. Sokolova, and E.P. de Vink. Probabilistic automata based models. In VOSS GI-Dagstuhl seminar. LNCS, 2003. to appear.
3. Desharnais J., Edalat A., Panangaden P. Bisimulation for Labelled Markov Processes. Information and Computation. 179:2002;163-193
4. P. D'Argenio, H. Hermanns, and J.-P. Katoen. On generative parallel composition. In Proc. Probmiv'98, volume 22 of ENTCS. Elsevier, 1998.
5. H. Peter Gumm and Tobias Schröder. Coalgebraic structure from weak pullback preserving functors. In Horst Reichel, editor, Proc. CMCS 2000, volume 33 of ENTCS. Elsevier, 2000.
6. van Glabbeek R.J., Smolka S.A., Steffen B. Reactive, generative, and stratified models of probabilistic processes. Information and Computation. 121:1995;59-80
7. Hansson H. Time and probability in formal design of distributed systems. Real-Time Safety Critical Systems, volume 1. 1994;Elsevier
8. H. Hermanns. Interactive Markov Chains. PhD thesis, Universiät Erlangen-Nürnberg, 1998. Revised version appeared as Interactive Markov Chains and the Quest for Quantified Quality, LNCS 2428, 2002.
9. J. Hillston. A compositional approach to performance modelling. PhD thesis, University of Edinburgh, 1994. Also appeared in the CPHC/BCS Distinguished Dissertation Series, Cambridge University Press, 1996.
10. C. Jones. Probabilistic Non-determinism. PhD thesis, University of Edinburgh, 1989.
11. Jacobs B.P.F., Rutten J.J.M.M. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS. 62:1996;222-259
12. A. Kurz. Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwig-Maximilians-Universität München, 2000.
13. Larsen K.G., Skou A. Bisimulation through probabilistic testing. Information and Computation. 94:1991;1-28
14. Moss L.S. Coalgebraic logic. Annals of Pure and Applied Logic. 96:1999;277-317
15. Pnueli A., Zuck L. Probabilistic verification. Information and Computation. 103:1993;1-29
16. J.J.M.M. Rutten and D. Turi. Initial algebra and final coalgebra semantics for concurrency. In REX School/Symposium, pages 530-582. LNCS 666, 1993.
17. Rutten J.J.M.M. Universal coalgebra: A theory of systems. Theoretical Computer Science. 249:2000;3-80
18. R. Segala. Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT, Department of EECS, 1995.
19. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In Proc. Concur'94, pages 481-496. LNCS 836, 1994.
20. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS'85, pages 327-338, Portland, Oregon, 1985.
21. de Vink E.P., Rutten J.J.M.M. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science. 221:1999;271-293
22. U. Wolter. On corelations, cokernels, and coequations. In H. Reichel, editor, Proc. CMCS 2000. ENTCS 33, 2000. 20pp.
23. J. Worell. Coinduction for recursive data types: partial orders, metric spaces and w-categories. In H. Reichel, editor, Proc. CMCS 2000. ENTCS 33, 2000. 20pp.