Recognizing ω-regular languages with probabilistic automata

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 137-146

  Baier, Christel ^a   Größer, Marcus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; FINITE AUTOMATA; FORMAL LANGUAGES; MARKOV PROCESSES;

FINITE WORDS; LINEAR-TIME PROPERTIES; PROBABILISTIC AUTOMATA; PROBABILISTIC BÜCHI AUTOMATA;

PROBABILISTIC LOGICS;

EID: 26844516679     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. A. Ambainis. The complexity of probabilistic versus deterministic finite automata. In Proc. ISAAC, LNCS 1178:233-237, 1996.
2. A. Ambainis and R. Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. In Proc. FOCS, 1998.
3. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer Science, 36:254-276, 1988.
4. C. Baier and M. Kwiatkowska. On the verification of qualitative properties of probabilistic processes unter fairness constraints. Information Processing Letters, 66:71-79, 1998.
5. V. Blondel and V. Canterini. Undecidable problems for probabilistic finite automata. Theory of Computer Systems, 36:231-245, 2003.
6. V. Blondel and J. Tsisiklis. A survey of computational complexity results in systems and control. Automatica, 36(9):1249-1274, 2000.
7. D. Bustan, S. Rubin, and M. Vardi. Verifying ω-regular properties of Markov chains. In Proc. CAV, LNCS 3114:189-201, 2004.
8. A. Condon, L. Hellerstein, S. Pottle, and A. Wigderson. On the power of finite automata with both nondeterministic and probabilistic states. SIAM Journal on Computing, 27(3):739-762, 1998.
9. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, July 1995.
10. J. Couvreur, N. Saheb, and G. Sutre. An optimal automata approach to LTL model checking of probabilistic systems. In Proc. LPAR, LNAI 2850:361-375, 2003.
11. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
12. L. de Alfaro. Stochastic transition systems. In Proc. CONCUR, LNCS 1466:423-438, 1998.
13. M. Droste and D. Kuske. Skew and infinitary formal power series. In Proc. ICALP, LNCS 2719:426-438, 2003.
14. M. Droste and U. Püschmann. Weighted Büchi automata. In Workshop on Weighted Automata-Theory and Applications, page 56, Dresden, 2004.
15. C. Dwork and L. Stockmeyer. A time-complexity gap for two-way probabilistic finite state automata. SIAM Journal of Computing, 19:1011-1023, 1990.
16. E. Emerson and C. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8(3):275-306, 1987.
17. R. Freivalds. Probabilistic two-way machines. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, LNCS 188:33-45, 1981.
18. R. Freund, M. Oswald, and L. Staiger. Omega-P automata with communication rules. In Workshop on Membrane Computing, LNCS 2933:203-217, 2003.
19. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS 2500, 2002.
20. J. Kemeny and J. Snell. Denumerable Markov Chains. Springer-Verlag, New York, 1976.
21. A. Kondacs and J. Watrous. On the power of quantum finite state automata. In Proc. FOCS, pages 66-75, 1997.
22. V. Kulkarni. Modeling and Analysis of Stochastic Systems. Chapman & Hall, 1995.
23. O. Madani, S. Hanks, and A. Condon. On the undecidability of probabilistic planning and infinite-horizon partially observable markov chains. In Proc. 16th National Conference on Artifical Intelligence, pages 541-548, 1999.
24. L. Mora-Lopez, R. Morales, M. Sidrach de Cardona, and F. Triguero. Probabilistic finite automata and randomness in nature: a new approach in the modelling and prediction of climatic parameters. In Proc. International Environmental Modelling and Software Congress, pages 78-83, 2002.
25. A. Paz. Some aspects of probabilistic automata. Information and Control, 9, 1966.
26. M. O. Rabin. Probabilistic automata. Information and Control, 6:230-245, 1963.
27. D. Ron, Y. Singer, and N. Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25(2-3):117-149, 1996.
28. S. Safra and M. Vardi. On ω-automata and temporal logic. In Proc. STOC, pages 127-137, 1989.
29. W. Thomas. Languages, automata, and logic. Handbook of formal languages, 3:389-455, 1997.
30. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS, pages 327-338, 1985.
31. M. Vardi. An automata-theoretic approach to linear temporal logic. In Proc. Banff Higher Order Workshop on Logics for Concurrency: Structure versus Automata, pages 238-266. Springer-Verlag, 1996.
32. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. LICS'86, pages 332-345, IEEE CS Press, 1986.
33. M. Vardi. Nontraditional applications of automata theory. In Theoretical Aspects of Computer Software, LNCS 789:575-597, 1994.