Computing the expected accumulated reward and gain for a subclass of infinite Markov chains

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

Volumn 3821 LNCS, Issue , 2005, Pages 372-383

  Brázdil, Tomáš ^a   Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; ERRORS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROBLEM SOLVING; STATE SPACE METHODS;

COUNTABLE STATE SPACES; FAULTY CHANNELS; INFINITE MARKOV CHAINS; PROBABILISTIC LOSSY CHANNEL SYSTEMS;

MARKOV PROCESSES;

EID: 33744922660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_30     Document Type: Conference Paper

References (24)

1. P. Abdulla, N.B. Henda, and R. Mayr. Verifying infinite Markov chains with a finite attractor or the global coarseness property. In Proceedings of LICS 2005, pp. 127-136. IEEE, 2005.
2. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. I&C, 127(2):91-101, 1996.
3. P.A. Abdulla and A. Rabinovich. Verification of probabilistic systems with faulty communication. In Proceedings of FoSSaCS 2003, vol. 2620 of LNCS, pp. 39-53. Springer, 2003.
4. G. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems: an algorithmic approach. In Proceedings of 5th International AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), vol. 1601 of LNCS, pp. 34-52. Springer, 1999.
5. N. Bertrand and Ph. Schnoebelen. Model checking lossy channel systems is probably decidable. In Proceedings of FoSSaCS 2003, vol. 2620 of LNCS, pp. 120-135. Springer, 2003.
6. A. Bianco and L. de Alfaro. Model checking of probabalistic and nondeterministic systems. In Proceedings of FST&TCS'95, vol. 1026 of LNCS, pp. 499-513. Springer, 1995.
7. T. Brázdil, J. Esparza, and A. Kučera. Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion. In Proceedings of FOCS 2005. IEEE, 2005. To appear.
8. T. Brázdil and A. Kučera. Computing the expected accumulated reward and gain for a subclass of infinite markov chains. Technical report FIMU-RS-2005-10, Faculty of Informatics, Masaryk University, 2005.
9. T. Brázdil, A. Kučera, and O. Stražovský. On the decidability of temporal properties of probabilistic pushdown automata. In Proceedings of STACS'2005, vol. 3404 of LNCS, pp. 145-157. Springer, 2005.
10. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In Proceedings of FOCS'88, pp. 338-345. IEEE, 1988.
11. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. JACM, 42(4):857-907, 1995.
12. L. de Alfaro, M.Z. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of probabilistic processes using MTBDDs and the Kronecker representation. In Proceedings of TACAS 2000, vol. 1785 of LNCS, pp. 395-410. Springer, 2000.
13. J. Esparza, A. Kučera, and R. Mayr. Model-checking probabilistic pushdown automata. In Proceedings of LICS 2004, pp. 12-21. IEEE, 2004.
14. J. Esparza, A. Kučera, and R. Mayr. Quantitative analysis of probabilistic push-down automata: Expectations and variances. In Proceedings of LICS 2005, pp. 117-126. IEEE, 2005.
15. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic systems. In Proceedings of TACAS 2005, vol. 3440 of LNCS, pp. 253-270. Springer, 2005.
16. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. In Proceedings of STACS'2005, vol. 3404 of LNCS, pp. 340-352. Springer, 2005.
17. E. Cho G and C. D. Meyer. Markov chain sensitivity measured by mean first passage times. Linear Algebra and its Applications, 316(1-3):21-28, 2000.
18. S.P. Iyer and M. Narasimha. Probabilistic lossy channel systems. In Proceedings of TAPSOFT'97, vol. 1214 of LNCS, pp. 667-681. Springer, 1997.
19. M.Z. Kwiatkowska. Model checking for probability and time: from theory to practice. In Proceedings of LICS 2003, pp. 351-360. IEEE, 2003.
20. M. Puterman. Markov Decision Processes. John Wiley and Sons, 1994.
21. A. Rabinovich. Quantitative analysis of probabilistic lossy channel systems. In Proceedings of ICALP 2003, vol. 2719 of LNCS, pp. 1008-1021. Springer, 2003.
22. J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, vol. 23 of CRM Monograph Series. American Mathematical Society, 2004.
23. Ph. Schnoebelen. The verification of probabilistic lossy channel systems. In Validation of Stochastic Systems: A Guide to Current Research, vol. 2925 of LNCS, pp. 445-465. Springer, 2004.
24. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of FOCS'85, pp. 327-338. IEEE, 1985.