Towards quantitative verification of probabilistic transition systems

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

Volumn 2076 LNCS, Issue , 2001, Pages 421-432

  Van Breugel, Franck ^a   Worrell, James ^b  

^a YORK UNIVERSITY   (Canada)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SEMANTICS; COMPUTATIONAL LINGUISTICS; EQUIVALENCE CLASSES;

BOREL PROBABILITY MEASURES; PROBABILISTIC TRANSITION SYSTEM; PSEUDO-METRICES; QUANTITATIVE DATA; QUANTITATIVE VERIFICATION; REACTIVE PROBABILISTIC TRANSITION SYSTEMS; REAL-VALUED MODAL LOGIC; TERMINAL COALGEBRAS;

EQUIVALENCE CLASSES; PROBABILITY;

EID: 84879525367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_35     Document Type: Conference Paper

References (22)

1. R. B. Ash. Real Analysis and Probability, Academic Press, London, 1972.
2. F. Alessi, P. Baldan and G. Bell̀e. A Fixed-Point Theorem in a Category of Compact Metric Spaces. Theoretical Computer Science, 146(1/2):311-320, July 1995.
3. C. Baier and M. Kwiatkowska. Domain Equations for Probabilistic Processes. In Proceedings of the 4th International Workshop on Expressiveness in Concurrency, volume 7 of Electronic Notes in Theoretical Computer Science, Santa Margherita Ligure, September 1997, Elsevier.
4. F. van Breugel and J. Worrell. An Algorithm for Quantitative Verification of Probabilistic Transition Systems. Report CS-2001-01, York University, Toronto, April 2001.
5. J. Desharnais, A. Edalat and P. Panangaden. A Logical Characterization of Bisimu-lation for Labelled Markov Processes. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, pages 478-487, Indianapolis, 1988. IEEE.
6. J. Desharnais, A. Edalat and P. Panangaden. Bisimulation for Labelled Markov Processes. Information and Computation, to appear.
7. J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Metrics for Labelled Markov Systems. In Proceedings of the 10th International Conference on Concurrency Theory, vol. 1664 of Lect. Notes in Comp. Sci, pages 258-273, Eindhoven, August 1999. Springer-Verlag.
8. J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Approximating Labelled Markov Processes. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pages 95-106, Santa Barbara, June 2000. IEEE.
9. G. A. Edgar. Integral, Probability, and Fractal Measures, Springer-Verlag, 1998.
10. A. Giacalone, C. C. Jou and S. A. Smolka. Algebraic Reasoning for Probabilistic Concurrent Systems. In Proceedings of the IFIP WG 2. 2/2. 3 Working Conference on Programming Concepts and Methods, pages 443-458, Sea of Galilee, April 1990, North-Holland.
11. M. Giry. A Categorical Approach to Probability Theory. In Proceedings of the International Conference on Categorical Aspects of Topology and Analysis, volume 915 of Lect. Notes in Math. , pages 68-85, Ottawa, 1981, Springer-Verlag.
12. J. I. den Hartog. Comparative Semantics for a Process Language with Probabilistic Choice and Non-Determinism, Report IR-445, Free University, Amsterdam, 1998.
13. M. Huth and M. Kwiatkowska. Quantitative Analysis and Model Checking. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 111-122, Warsaw, June/July 1997. IEEE.
14. J. E. Hutchinson. Fractals and Self Similarity. Indiana University Mathematics Journal, 30(5):713-747, 1981.
15. D. Kozen. A Probabilistic PDL. Journal of Computer and System Sciences, 30(2):162-178, April 1985.
16. K. G. Larsen and A. Skou. Bisimulation through Probabilistic Testing. Information and Computation, 94(1):1-28, September 1991.
17. G. J. Norman. Metric Semantics for Reactive Probabilistic Systems. PhD thesis, University of Birmingham, 1997.
18. K. R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, 1967.
19. J. J. J. M. Rutten. Universal Coalgebra: a Theory of Systems, Theoretical Computer Science, 249(1), pages 3-80, October 2000.
20. 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.
21. E. P. de Vink and J. J. M. M. Rutten. Bisimulation for Probabilistic Transition Systems: a Coalgebraic Approach. Theoretical Computer Science, 221(1/2):271-293, June 1999.
22. J. Worrell. On Coalgebras and Final Semantics. PhD thesis, Oxford University, 2000.