Probabilistic weighted automata

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

Volumn 5710 LNCS, Issue , 2009, Pages 244-258

  Chatterjee, Krishnendu ^a   Doyen, Laurent ^b   Henzinger, Thomas A ^c  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EXPRESSIVE POWER; INFINITE WORD; MAXIMAL VALUES; NON-DETERMINISM; POSITIVE PROBABILITY; PROBABILISTIC CHOICES; REAL NUMBER; SUPREMUM; TRANSITION WEIGHT; WEIGHTED AUTOMATA;

LINGUISTICS; NUMBER THEORY; PROBABILITY; ROBOTS; SEMANTICS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 70349847580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_17     Document Type: Conference Paper

References (25)

1. Baier, C., Bertrand, N., Großer, M.: On decision problems for probabilistic Buchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.4962, pp. 287-301. Springer, Heidelberg (2008)
2. Baier, C., Großer, M.: Recognizing omega-regular languages with probabilistic automata. In: Proc. of LICS: Logic in Comp. Science, pp. 137-146. IEEE, Los Alamitos (2005)
3. Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of .xed dimension. Theory Comput. Syst. 36(3), 231-245 (2003)
4. Chakrabarti, A., Chatterjee, K., Henzinger, T.A., Kupferman, O., Majumdar, R.: Verifying quantitative properties using bound functions. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol.3725, pp. 50-64. Springer, Heidelberg (2005)
5. Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol.2855, pp. 117-133. Springer, Heidelberg (2003)
6. Chatterjee, K., de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Compositional quantitative reasoning. In: Proc. of QEST, pp. 179-188. IEEE Computer Society Press, Los Alamitos (2006)
7. Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.5213, pp. 385-400. Springer,Heidelberg (2008)
8. Chatterjee, K., Doyen, L., Henzinger, T.A.: Alternating weighted automata. In: Kutylowski, M., Charatonik, W., Ģebala, M. (eds.) FCT 2009. LNCS, vol.5699, pp. 3-13. Springer, Heidelberg (2009)
9. Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. In: Proc. of LICS: Logic in Computer Science. IEEE Comp. Soc. Press, Los Alamitos (to appear, 2009)
10. Chatterjee, K., Doyen, L., Henzinger, T.A.: Probabilistic weighted automata (2009), http://infoscience.epfl.ch/record/133665
11. Chatterjee, K., Jurdzinski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: Proc. of SODA, pp. 114-123. ACM Press, New York (2004)
12. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857-907 (1995)
13. Culik II, K., Karhumaki, J.: Finite automata computing real functions. SIAM J. Comput. 23(4), 789-814 (1994)
14. de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching metrics for quantitative transition systems. In: Dýaz, J., Karhumaki, J., Lepisto, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.3142, pp. 97-109. Springer, Heidelberg (2004)
15. Droste, M., Kuske, D.: Skew and in.nitary formal power series. Theor. Comput. Sci. 366(3), 199-227 (2006)
16. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payo. games. Int. Journal of Game Theory 8(2), 109-113 (1979)
17. Esik, Z., Kuich, W.: An algebraic generalization of omega-regular languages. In: Fiala, J., Koubek, V., Kratochvýl, J. (eds.) MFCS 2004. LNCS 3153, P.648- 659. Springer, Heidelberg, (2004)
18. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
19. Gimbert, H.: Jeux positionnels. PhD thesis, Universite Paris 7 (2006)
20. Gradel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and infinite Games. LNCS, vol.2500. Springer, Heidelberg (2002)
21. Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. D. Van Nostrand Company (1966)
22. Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230-245 (1963)
23. Shapley, L.S.: Stochastic games. Proc. of the National Acadamy of Science USA 39, 1095-1100 (1953)
24. Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.1043, pp. 238-266. Springer, Heidelberg (1996)
25. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of FOCS, pp. 327-338. IEEE, Los Alamitos (1985)