A note on the attractor-property of infinite-state Markov chains

Information Processing Letters

Volumn 97, Issue 2, 2006, Pages 58-63

  Baier, Christel ^a   Bertrand, Nathalie ^b   Schnoebelen, Philippe ^b  

^a UNIVERSITY OF BONN   (Germany)

^b CNRS   (France)

Author keywords

Attractors in Markov chains; Lossy channel systems; Theory of computation; Verification of probabilistic systems

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ERROR ANALYSIS; INTEGER PROGRAMMING; PROBABILISTIC LOGICS;

ATTRACTORS IN MARKOV CHAINS; LOSSY CHANNEL SYSTEMS; THEORY OF COMPUTATION; VERIFICATION OF PROBABILISTIC SYSTEMS;

MARKOV PROCESSES;

EID: 28044471542     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.09.011     Document Type: Article

References (23)

1. P. Abdulla, N. Ben Henda, R. Mayr, Verifying infinite Markov chains with a finite attractor or the global coarseness property, in: Proc. Logic in Computer Science (LICS 2005), 2005, pp. 127-136
2. P.A. Abdulla, N. Bertrand, A. Rabinovich, and Ph. Schnoebelen Verification of probabilistic systems with faulty communication Inform. Comput. 202 2 2005 141 165
3. P.A. Abdulla, and A. Rabinovich Verification of probabilistic systems with faulty communication Proc. Foundations of Software Science and Computation Structures (FOSSACS 2003) Lecture Notes in Comput. Sci. vol. 2620 2003 Springer Berlin 39 53
4. R. Alur, C. Courcoubetis, and D. Dill Model-checking for probabilistic real-time systems Proc. Automata, Languages, and Programming (ICALP'91) Lecture Notes in Comput. Sci. vol. 510 1991 Springer Berlin 115 126
5. C. Baier, and B. Engelen Establishing qualitative properties for probabilistic lossy channel systems: An algorithmic approach Proc. Formal Methods for Real-Time and Probabilistic Systems (ARTS'99) Lecture Notes in Comput. Sci. vol. 1601 1999 Springer Berlin 34 52
6. N. Bertrand, and Ph. Schnoebelen Model checking lossy channels systems is probably decidable Proc. Foundations of Software Science and Computation Structures (FOSSACS 2003) Lecture Notes in Comput. Sci. vol. 2620 2003 Springer Berlin 120 135
7. D. Brand, and P. Zafiropulo On communicating finite-state machines J. ACM 30 2 1983 323 342
8. P. Brémaud Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues Texts in Appl. Math. vol. 31 1999 Springer Berlin
9. D. Bustan, S. Rubin, and M. Vardi Verifying ω-regular properties of Markov chains Proc. Computer Aided Verification (CAV 2004) Lecture Notes in Comput. Sci. vol. 3114 2004 Springer Berlin 189 201
10. C. Courcoubetis, and M. Yannakakis The complexity of probabilistic verification J. ACM 42 4 1995 857 907
11. J. Esparza, and K. Etessami Verifying probabilistic procedural programs Proc. Found. of Software Technology and Theor. Comp. Sci. (FST&TCS 2004) Lecture Notes in Comput. Sci. vol. 3328 2004 Springer Berlin 16 31
12. J. Esparza, A. Kučera, R. Mayr, Model checking probabilistic pushdown automata, in: Proc. Logic in Computer Science (LICS 2004), 2004, pp. 12-21
13. K. Etessami, and M. Yannakakis Algorithmic verification of recursive probabilistic state machines Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005) Lecture Notes in Comput. Sci. vol. 3440 2005 Springer Berlin 253 270
14. K. Etessami, and M. Yannakakis Recursive Markov decision processes and recursive stochastic games Proc. Automata, Languages, and Programming (ICALP 2005) Lecture Notes in Comput. Sci. vol. 3580 2005 Springer Berlin 891 903
15. H. Hansson, and B. Jonsson A logic for reasoning about time and reliability Formal Aspects Comput. 6 5 1994 512 535
16. J.G. Kemeny, J.L. Snell, and A.W. Knapp Denumerable Markov Chains 1966 D. Van Nostrand Co. Princeton, NJ, USA
17. M.Z. Kwiatkowska, G. Norman, D. Parker, PRISM 2.0: A tool for probabilistic model checking. in: Proc. Quantitative Evaluation of Systems (QEST 2004), 2004, pp. 322-323
18. M.Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston Automatic verification of real-time systems with discrete probability distributions Theoret. Comput. Sci. 282 1 2002 101 150
19. P. Panangaden Measure and probability for concurrency theorists Theoret. Comput. Sci. 253 2 2001 287 309
20. A. Rabinovich Quantitative analysis of probabilistic lossy channel systems Proc. Automata, Languages, and Programming (ICALP 2003) Lecture Notes in Comput. Sci. vol. 2719 2003 Springer Berlin 1008 1021
21. Ph. Schnoebelen The verification of probabilistic lossy channel systems Validation of Stochastic Systems - A Guide to Current Research Lecture Notes in Comput. Sci. vol. 2925 2004 Springer Berlin 445 465
22. M. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. Foundations of Computer Science (FOCS'85), 1985, pp. 327-338
23. M. Vardi Probabilistic linear-time model checking: An overview of the automata-theoretic approach Proc. Formal Methods for Real-Time and Probabilistic Systems (ARTS'99) Lecture Notes in Comput. Sci. vol. 1601 1999 Springer Berlin 265 276