Testing labelled Markov processes

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

Volumn 2380 LNCS, Issue , 2002, Pages 537-548

  Van Breugel, Franck ^a   Shalit, Steven ^b   Worrell, James ^b  

^a YORK UNIVERSITY   (Canada)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

CONTINUOUS STATE SPACE; LABELLED MARKOV PROCESS; LOGICAL CHARACTERIZATION; PROBABILISTIC BISIMILARITY; PROBABILISTIC BISIMULATIONS; PROBABILISTIC MODAL LOGIC; PROBABILISTIC TRANSITION SYSTEM; TECHNICAL CONTRIBUTION;

MARKOV PROCESSES;

EID: 84869167523     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_46     Document Type: Conference Paper

References (21)

1. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53(2/3):225-242, 1987.
2. J. Adámek and V. Koubek. Least fixed point of a functor. Journal of Computer System Sciences, 19(2):163-178, October 1979.
3. P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences, 39(3):343-375, December 1989.
4. W. Arveson. An Invitation to C*-Algebras. Springer-Verlag, New York, 1976.
5. M.F. Barnsley. Fractals Everywhere. Academic Press, Boston, second edition, 1993.
6. P. Billingsley. Probability and Measure. Wiley, New York, third edition, 1995.
7. B. Bloom and A. Meyer. Experimenting with process equivalence. Theoretical Computer Science, 101(2):223-237, July 1992.
8. R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 149-158, Warsaw, June/July 1997. IEEE.
9. F. van Breugel and J. Worrell. Towards quantitative verification of probabilistic transition systems. In F. Orejas, P.G. Spirakis, and J. van Leeuwen, editors, Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, volume 2076 of Lecture Notes in Computer Science, pages 421-432, Crete, July 2001. Springer-Verlag.
10. F. van Breugel and J. Worrell. An algorithm for quantitative verification of probabilistic transition systems. In K.G. Larsen and M. Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 336-350, Aalborg, August 2001. Springer-Verlag.
11. F. van Breugel and J. Worrell. A behavioural pseudometric for probabilistic transition systems. Available at www.cs.yorku.ca/~franck, October 2001.
12. J. Desharnais, A. Edalat, and P. Panangaden. A logical characterization of bisimulation for labeled Markov processes. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, pages 478-487, Indianapolis, June 1998. IEEE.
13. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. To appear in Information and Computation. Available at www-acaps.cs.mcgill.ca/~prakash, 1999.
14. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. In J.C.M. Baeten and S. Mauw, editors, Proceedings of the 10th International Conference on Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 258-273, Eindhoven, August 1999. Springer-Verlag.
15. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov systems. Available at www-acaps.cs.mcgill.ca/~prakash, November 2001.
16. G.A. Edgar. Integral, Probability, and Fractal Measures. Springer-Verlag, New York, 1998.
17. M. Giry. A categorical approach to probability theory. In B. Banaschewski, editor, Proceedings of the International Conference on Categorical Aspects of Topology and Analysis, volume 915 of Lecture Notes in Mathematics, pages 68-85, Ottawa, August 1981. Springer-Verlag.
18. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, January 1985.
19. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
20. K.R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, New York, 1967.
21. D. Turi and J.J.M.M. Rutten. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. Mathematical Structures in Computer Science, 8(5):481-540, October 1998.