An algorithm for quantitative verification of probabilistic transition systems

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

Volumn 2154, Issue , 2001, Pages 336-350

  Van Breugel, Franck ^a   Worrell, James ^b  

^a YORK UNIVERSITY   (Canada)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING;

DEGREE OF ACCURACY; PROBABILISTIC TRANSITION SYSTEM; PROBABILITY MEASURES; PSEUDO-METRICES; QUANTITATIVE VERIFICATION; REACTIVE PROBABILISTIC TRANSITION SYSTEMS; TERMINAL COALGEBRAS; TWO-STATE;

EQUIVALENCE CLASSES;

EID: 84944050216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_23     Document Type: Conference Paper

References (16)

1. F. van Breugel and J. Worrell. Towards Quantitative Verification of Probabilistic Transition Systems. To appear in Proceedings of 28th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Crete, July 2001. Springer-Verlag.
2. V. Chvatal. Linear Programming. W.H. Freeman and Company, New York/San Francisco, 1983.
3. 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.
4. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating Labeled Markov Processes. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pages 95–106, Santa Barbara, June 2000. IEEE.
5. G.A. Edgar. Integral, Probability, and Fractal Measures. Springer-Verlag, 1998.
6. 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.
7. 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 Gallilee, April 1990. North-Holland.
8. J.E. Hutchinson. Fractals and Self Similarity. Indiana University Mathematics Journal, 30(5):713–747, 1981.
9. B. Jacobs and J. Rutten. A Tutorial on (Co)Algebras and (Co)Induction. Bulletin of the EATCS, 62, June 1997.
10. C. Jones and G.D. Plotkin. A Probabilistic Powerdomain of Evaluations. In Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science, pages 186–195, California, June 1989. IEEE.
11. F.W. Lawvere. Metric Spaces, Generalized Logic, and Closed Categories. Rendiconti del Seminario Matematico e Fisico di Milano, 43:135–166, 1973.
12. K.G. Larsen and A. Skou. Bisimulation through Probabilistic Testing. Information and Computation, 94(1):1–28, September 1991.
13. K.R. Parthasarathy. Probability Measures on Metric Spaces. Academic Press, 1967.
14. D. Turi and J.J.M.M. Rutten. On the Foundations of Final Semantics: nonstandard sets, metric spaces, partial orders. Mathematical Structures in Computer Science, 8(5):481-540, October 1998.
15. J.J.J.M. Rutten. Universal Coalgebra: a Theory of Systems. Theoretical Computer Science, 249(1):3–80, October 2000.
16. 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.