Limiting behavior of Markov chains with eager attractors

Third International Conference on the Quantitative Evaluation of Systems, QEST 2006

Volumn , Issue , 2006, Pages 253-262

  Abdulla, Parosh Aziz ^a   Ben Henda, Noomene ^a   Mayr, Richard ^b   Sandberg, Sven ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PROBABILISTIC LOGICS; PROBABILITY;

BOUNDED REWARD FUNCTIONS; DISCRETE INFINITE-STATE MARKOV CHAINS; FINITE ATTRACTORS; PROBABILISTIC LOSSY CHANNEL SYSTEMS;

MARKOV PROCESSES;

EID: 41149165847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2006.24     Document Type: Conference Paper

References (27)

1. P. A. Abdulla, C. Baier, S. P. Iyer, and B. Jonsson. Reasoning about probabilistic lossy channel systems. In Proc. CONCUR 2000, volume 1877 of LNCS, pp. 320-333, 2000.
2. P. A. Abdulla, N. Ben Henda, and R. Mayr. Verifying infinite Markov chains with a finite attractor or the global coarseness property. In Proc. LICS' 05, pp. 127-136, 2005.
3. P. A. Abdulla, N. Ben Henda, R. Mayr, and S. Sandberg. Eager Markov chains. Technical Report 2006-009, Department of Information Technology, Uppsala University, 2006.
4. P. A. Abdulla, N. Ben Henda, R. Mayr, and S. Sandberg. Limiting behavior of Markov chains with eager attractors. Technical Report 2006-033, Dept. of Information Technology, Uppsala University, Sweden, 2006.
5. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
6. P. A. Abdulla and A. Rabinovich. Verification of probabilistic systems with faulty communication. In Proc. FOSSACS'03, volume 2620 of LNCS, pp. 39-53, 2003.
7. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Model-checking continuous-time Markov chains. ACM Trans. on Computational Logic, 1(1): 162-170, 2000.
8. C. Baier, N. Bertrand, and Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2): 58-63, 2006.
9. C. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems. In Katoen, editor, ARTS'99, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop, volume 1601 of LNCS, pp. 34-52. Springer Verlag, 1999.
10. C. Baier, B. Haverkort, H. Hermanns, and J. Katoen. Automated performance and dependability evaluation using model checking. In Proc. Performance 2002, pp. 261-289, 2002.
11. N. Bertrand and Ph. Schnoebelen. Model checking lossy channels systems is probably decidable. In Proc. FOSSACS'03, volume 2620 of LNCS, pp. 120-135, 2003.
12. T. Brázdil and A. Kučera. Computing the expected accumulated reward and gain for a subclass of infinite Markov chains. In Proc. FSTTCS '05, volume 3821 of LNCS, pp. 372-383, 2005.
13. G. Cécé, A. Finkel, and S. P. Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31.
14. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Dec. 1999.
15. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
16. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of probabilistic processes using mtbdds and the Kronecker representation. In Proc. TACAS '00, volume 1785 of LNCS, pp. 123-137, 2000.
17. J. Esparza and K. Etessami. Verifying probabilistic procedural programs. In Proc. FSTTCS '04, pp. 16-31, 2004.
18. J. Esparza, A. Kučera, and R. Mayr. Model checking probabilistic pushdown automata. In Proc. LICS' 04, pp. 12-21, 2004.
19. J. Esparza, A. Kučera, and R. Mayr. Quantitative analysis of probabilistic pushdown automata: Expectations and variances. In Proc. LICS' 05, pp. 117-126, 2005.
20. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic state machines. In Proc. TACAS '05, volume 3440 of LNCS, pp. 253-270, 2005.
21. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. In Proc. STACS'05, volume 2996 of LNCS, pp. 340-352, 2005.
22. K. Etessami and M. Yannakakis. Recursive Markov decision processes and recursive stochastic games. In Proc. ICALP '05, volume 3580 of LNCS, pp. 891-903, 2005.
23. S.P. Iyer and M. Narasimha. Probabilistic lossy channel systems. In TAPSOFT '97: Theory and Practice of Software Development, volume 1214 of LNCS, pp. 667-681, 1997.
24. V. G. Kulkarni. Modeling and Analysis of Stochastic Systems. Texts in Statistical Science Series. Chapman and Hall Ltd., London, 1995.
25. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic model checking in practice: Case studies with PRISM. ACM Performance Evaluation Review, 32(2):16-21, 2005.
26. A. Rabinovich. Quantitative analysis of probabilistic lossy channel systems. In Proc. ICALP '03, volume 2719 of LNCS, pp. 1008-1021, 2003.
27. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS '85, pp. 327-338, 1985.