An intrinsic characterization of approximate probabilistic bisimilarity

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

Volumn 2620, Issue , 2003, Pages 200-215

  Van Breugel, Franck ^a   Mislove, Michael ^b   Ouaknine, Joël ^c   Worrell, James ^b  

^a YORK UNIVERSITY   (Canada)

^b Tulane University   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MARKOV PROCESSES; TOPOLOGY;

BISIMILARITY; LABELLED MARKOV PROCESS; LARS-EN; LAWSON TOPOLOGY; PROBABILISTIC BISIMILARITY; PROBABILITY MEASURES; SIMULATION PREORDER; TECHNICAL TOOLS;

CHARACTERIZATION;

EID: 35248840029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_13     Document Type: Article

References (21)

1. Adámek, J. and V. Koubek: On the greatest fixed point of a set functor. Theoretical Computer Science, 150 (1995) 57-75.
2. Alvarez-Manilla, M., A. Edalat, and N. Saheb-Djahromi. An extension result for continuous valuations. Journal of the London Mathematical Society, 61 (2000) 629-640.
3. Averson, W.: An Invitation to C*-Algebras, Springer-Verlag, 1976.
4. van Breugel, F. and J. Worrell: Towards quantitative verification of probabilistic transition system, Lecture Notes in Computer Science, 2076 (2001), Springer-Verlag, 421-132.
5. van Breugel, F. and J. Worrell: An algorithm for quantitative verification of probabilistic transition systems, Lecture Notes in Computer Science, 2154 (2001), Springer-Verlag, 336-350.
6. van Breugel, F., S. Shalit and J. Worrell: Testing labelled Markov processes, Lecture Notes in Computer Science, 2380 (2002), Springer-Verlag, 537-548.
7. van Breugel, F., M. Mislove, J. Ouaknine and J. Worrell: An intrinsic characterization of approximate probabilistic bisimilarity, Report CS-2003-01, York University, 2003.
8. Desharnais, J., A. Edalat and P. Panangaden: A logical characterization of bisimulation for labelled Markov processes, In Proc. 13th IEEE Symposium on Logic in Computer Science (1998), IEEE Press, 478-487.
9. Desharnais, J., V. Gupta, R. Jagadeesan and P. Panangaden: Metrics for labeled Markov systems, Lecture Notes in Computer Science, 1664 (1999), Springer-Verlag, 258-273.
10. Desharnais, J., V. Gupta, R. Jagadeesan and P. Panangaden: Approximating labeled Markov processes. In Proc. 15th Symposium on Logic in Computer Science, (2000), IEEE Press, 95-106.
11. Edalat, A.: When Scott is weak at the top, Mathematical Structures in Computer Science, 7 (1997), 401-417.
12. Giry, M.: A categorical approach to probability theory, Lecture Notes in Mathematics, 915 (1981), Springer-Verlag, 68-85.
13. Heckmann, R.: Spaces of valuations, Annals of the New York Academy of Sciences, 806 (1996), New York Academy of Sciences, 174-200.
14. Jones, C.: Probabilistic nondeterminism, PhD Thesis, Univ. of Edinburgh, 1990.
15. Jung, A. and R. Tix: The troublesome probabilistic powerdomain. Electronic Notes in Theoretical Computer Science, 13 (1998), Elsevier.
16. Larsen, K.G. and A. Skou: Bisimulation through probabilistic testing: Information and Computation, 94 (1991), Academic Press, 1-28.
17. Milner, R.: Communication and Concurrency, Prentice Hall, 1989.
18. Park, D.: Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 104 (1981), Springer-Verlag, 167-183.
19. Parthasarathy, K.R.: Probability Measures on Metric Spaces, Academic Press, 1967.
20. Di Pierro, A., C. Hankin, and H. Wiklicky, Approximate non-interference, In Proc. 15th IEEE Computer Security Foundations Workshop (2002), IEEE Press, 3-17.
21. Smyth, M.B. and G.D. Plotkin: The category theoretic solution of recursive domain equations, SIAM Journal of Computing, 11 (1982), 761-783.