Probabilistic automata over infinite words: Expressiveness, efficiency, and decidability

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 3, Issue , 2009, Pages 3-16

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

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISPERSION COMPENSATION; EFFICIENCY; SEMANTICS;

ACCEPTANCE CONDITIONS; DECISION PROBLEMS; FUNDAMENTAL PROPERTIES; INFINITE WORD; NONDETERMINISTIC AUTOMATA; PROBABILISTIC AUTOMATA; PROBABILISTIC DISTRIBUTION; PROBABILITY MEASURES;

PROBABILITY DISTRIBUTIONS;

EID: 79960344852     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.3.1     Document Type: Conference Paper

References (20)

1. A. Ambainis & R. Freivalds (1998): 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proc. of the 39th Symposium on Foundations of Computer Science (FOCS’98). IEEE Computer Society Press.
2. C. Baier, N. Bertrand & M. Grösser (2008): On Decision Problems for Probabilistic Büchi Automata. In: Proc. of the 11th International Conference on Foundations of Software Science and Computation Structures (FOSSACS’08), Lecture Notes in Computer Science 4962. Springer, pp. 287–301.
3. C. Baier & M. Grösser (2005): Recognizing ?-regular Languages with Probabilistic Automata. In: Proc. of the 20th IEEE Symposium on Logic in Computer Science (LICS’05). IEEE Computer Society Press, pp. 137–146.
4. R. Chadha, A.P. Sistla & M. Viswanathan (2008): On the Expressiveness and Complexity of Randomization in Finite State Monitors. In: Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS’08). IEEE Computer Society Press, pp. 18–29.
5. K. Chatterjee, L. Doyen, T.A. Henzinger & J.-F. Raskin (2006): Algorithms for ?-regular games with Imperfect Information. In: Proc. of the 20th International Workshop on Computer Science Logic (CSL’06), Lecture Notes in Computer Science 4207. Springer, pp. 287–302.
6. C. Courcoubetis & M. Yannakakis (1995): The Complexity of Probabilistic Verification. Journal of the ACM 42(4), pp. 857–907.
7. E. Grädel, W. Thomas & T. Wilke, editors (2002): Automata, Logics, and Infinite Games: A Guide to Current Research, Lecture Notes in Computer Science 2500. Springer.
8. M. Größer (2008): Reduction Methods for Probabilistic Model Checking. Ph.D. thesis, Technical University Dresden, Faculty for Computer Science.
9. A. Kondacs & J. Watrous (1997): On the power of quantum finite state automata. In: Proc. of the 38th Symposium on Foundations of Computer Science (FOCS’97). IEEE Computer Society Press, pp. 66–75.
10. W. Lovejoy (1991): A survey of algorithmic methods for partially observable Markov decision processes. Annals of Operations Research 28(1), pp. 47–65.
11. O. Madani, S. Hanks & A. Condon (2003): On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence 147(1-2), pp. 5–34.
12. G. Monahan (1982): A survey of partially observable Markov decision processes: Theory, models, and algorithms. Management Science 28(1), pp. 1–16.
13. C. Papadimitriou & J. Tsitsiklis (1987): The Comlexity of Markov Decision Processes. Mathematics of Operations Research 12(3).
14. A. Paz (1971): Introduction to probabilistic automata. Academic Press Inc.
15. M. O. Rabin (1963): Probabilistic Automata. Information and Control 6(3), pp. 230–245.
16. S. Safra (1988): On the Complexity of ?-Automata. In: Proc. of the 29th Symposium on Foundations of Computer Science (FOCS’88). IEEE Computer Society Press, pp. 319–327.
17. S. Safra & M. Y. Vardi (1989): On ?-automata and temporal logic. In: Proc. of the 21st ACM Symposium on Theory of Computing (STOC’89). ACM, pp. 127–137.
18. E. J. Sondik (1971): The Optimal Control of Partially Observable Markov Processes. Ph.D. thesis, Stanford University.
19. W. Thomas (1997): Languages, Automata, and Logic. Handbook of Formal Languages 3, pp. 389–455.
20. M. Y. Vardi & P. Wolper (1986): An Automata-Theoretic Approach to Automatic Program Verification. In: Proc. of the 1st IEEE Symposium on Logic in Computer Science (LICS’86). IEEE Computer Society Press, pp. 332–345.