On decision problems for probabilistic Büchi automata

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

Volumn 4962 LNCS, Issue , 2008, Pages 287-301

  Baier, Christel ^a   Bertrand, Nathalie ^a,b   Größer, Marcus ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA; FOUNDATIONS; GAME THEORY; INFORMATION THEORY; PROBABILITY; PROBABILITY DISTRIBUTIONS; TRANSLATION (LANGUAGES);

ALGORITHMIC PROBLEMS; COMPLEMENTATION; COMPUTATIONAL STRUCTURES; DECISION PROBLEMS; EMPTINESS PROBLEM; EUROPEAN; FINITE STATES; HEIDELBERG (CO); INFINITE WORDS; INTERNATIONAL (CO); MARKOV DECISION PROCESS (MDP); SOFTWARE SCIENCE; STOCHASTIC GAMES; TRANSITION SYSTEMS; UNDECIDABILITY;

PACKET NETWORKS;

EID: 47349122903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_21     Document Type: Conference Paper

References (20)

1. Baier, C., Größer, M.: Recognizing ω-regular languages with probabilistic automata. In: Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005), pp. 137-146. IEEE Computer Society Press, Los Alamitos (2005)
2. Bustan, D., Rubin, S., Vardi, M.: Verifying ω-regular properties of Markov chains. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 189-201. Springer, Heidelberg (2004)
3. Cassandra, A.R.: A survey of POMD applications. Presented at the AAAI Fall Symposium (1998), http://pomdp.org/pomdp/papers/applications.pdf
4. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857-907 (1995)
5. de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: Proc. Workshop on Probabilistic Methods in Verification (ProbMiV 1999), Birmingham University, Research Report CSR-99-9, pp. 19-32 (1999)
6. Giro, S., D'Argenio, P.R.: Quantitative model checking revisited: neither decidable nor approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 179-194. Springer, Heidelberg (2007)
7. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
8. Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems 5(3), 356-380 (1983)
9. Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov chains. D. Van Nostrand Co (1966)
10. Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems. Chapman & Hall, Boca Raton (1995)
11. Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence 147(1-2), 5-34 (2003)
12. Paz, A.: Introduction to probabilistic automata. Academic Press Inc., London (1971)
13. Perrin, D., Pin, J.-É.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)
14. Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994)
15. Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230-245 (1963)
16. Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer System Sciences 29(2), 274-301 (1984)
17. Safra, S.: On the complexity of omega-automata. In: Proc. 29th Symposium on Foundations of Computer Science (FOCS 1988), pp. 319-327. IEEE Computer Society Press, Los Alamitos (1988)
18. Stewart, W.J.: Introduction to the numerical solution of Markov Chains. Princeton University Press, Princeton (1994)
19. Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, ch. 4, pp. 133-191. Elsevier, Amsterdam (1990)
20. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. 26th Symposium on Foundations of Computer Science (FOCS 1985), pp. 327-338. IEEE Computer Society Press, Los Alamitos (1985)