Quantitative languages

ACM Transactions on Computational Logic

Volumn 11, Issue 4, 2010, Pages 1-38

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

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b CNRS   (France)

^c EPFL   (Switzerland)

Author keywords

Expressiveness; Model checking; Quantitative verification; Weighted automata

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER SIMULATION LANGUAGES; DECISION THEORY; EQUIVALENCE CLASSES; MODEL CHECKING; ROBOTS;

CLASSICAL DECISION PROBLEMS; CLASSICAL LANGUAGE; EXPRESSIVENESS; LANGUAGE INCLUSION PROBLEMS; QUANTITATIVE SIMULATION; QUANTITATIVE VERIFICATION; TRANSITION WEIGHT; WEIGHTED AUTOMATA;

MODELING LANGUAGES;

EID: 77954986172     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1805950.1805953     Document Type: Article

References (47)

1. ANDERSSON, D. 2006. An improved algorithm for discounted payoff games. In ESSLLI Student Session. 91-98.
2. CHAKRABARTI, A., CHATTERJEE, K., HENZINGER, T. A., KUPFERMAN, O., AND MAJUMDAR, R. 2005. Verifying quantitative properties using bound functions. In Proceedings of Correct Hardware Design and Verification Methods (CHARME). Lecture Notes in Computer Science, vol. 3725. Springer-Varlag, Berlin, 50-64.
3. CHAKRABARTI, A., DE ALFARO, L., HENZINGER, T. A., AND STOELINGA, M. 2003. Resource interfaces. In Proceedings of Embedded Software (EMSOFT). Lecture Notes in Computer Science, vol. 2855. Springer-Verlag, Berlin, 117-133.
4. CHATTERJEE, K. 2007a. Concurrent games with tail objectives. Theoretical Computer Science 388, 181-198.
5. CHATTERJEE, K. 2007b. Stochastic ω-regular games. Ph. D. dissertation, University of California, Berkeley.
6. CHATTERJEE, K. 2008. Linear time algorithm for weak parity games. CoRR abs/0805.1391.
7. CHATTERJEE, K., DOYEN, L., AND HENZINGER, T. A. 2009. Alternating weighted automata. In Proceedings of Fundamentals of Computation Theory (FCT). Lecture Notes in Computer Science, vol. 699. Springer-Verlag, Berlin, 3-13.
8. CHATTERJEE, K., GHOSAL, A., HENZINGER, T. A., IERCAN, D., KIRSCH, C., PINELLO, C., AND SANGIOVANNI-VINCENTELLI, A. 2008. Logical reliability of interacting real-time tasks. In Proceedings of DATE Design, Automation and Test. ACM, New York.
9. CONDON, A. 1992. The complexity of stochastic games. Inform. Comput. 96, 203-224.
10. CULIK, K. AND KARHUMÄKI, J. 1994. Finite automata computing real functions. SIAM J. Comput. 23, 789-814.
11. DAL-ZILIO, S. AND LUGIEZ, D. 2003. Xml schema, tree logic and sheaves automata. In Proceedings of Rewriting Techniques and Applications (RTA). 246-263.
12. DE ALFARO, L., HENZINGER, T. A., AND MAJUMDAR, R. 2003. Discounting the future in systems theory. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 2719. Springer-Verlag, Berlin, 1022-1037.
13. DROSTE, M. AND GASTIN, P. 2007. Weighted automata and weighted logics. Theor. Comput. Sci. 380, 69-86.
14. DROSTE, M., KUICH, W., AND RAHONIS, G. 2008. Multi-valued MSO logics over words and trees. Fund. Inform. 84, 305-327.
15. DROSTE, M. AND KUSKE, D. 2003. Skew and infinitary formal power series. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 2719. Springer-Verlag, Berlin, 426-438.
16. EHRENFEUCHT, A. AND MYCIELSKI, J. 1979. Positional strategies for mean payoff games. Int. J. Game Theory. 8, 109-113.
17. EMERSON, E. A. AND JUTLA, C. 1991. Tree automata, mu-calculus and determinacy. In Proceedings of Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 368-377.
18. EVERETT, H. 1957. Recursive games. Ann. Math. Stud. 39. 47-78.
19. FILAR, J. AND VRIEZE, K. 1997. Competitive Markov Decision Processes. Springer-Verlag, Berlin.
20. GIMBERT, H. 2006. Jeux positionnels. Ph. D. dissertation, Université Paris 7.
21. GURFINKEL, A. AND CHECHIK, M. 2003. Multi-valued model checking via classical model checking. In Proceedings of Concurrency Theory (CONCUR). Lecture Notes in Computer Science, vol, 2761. Springer-Verlag, Berlin, 263-277.
22. HENZINGER, T., KUPFERMAN, O., AND RAJAMANI, S. 1997. Fair simulation. In Proceedings of Concurrency Theory (CONCUR). Lecture Notes in Computer Science, vol. 1243. Springer-Verlag, Berlin, 273-287.
23. HOFFMAN, A. AND KARP, R. 1966. On nonterminating stochastic games. Manag. Sci. 12, 5, 359-370.
24. KARIANTO, W. 2005. Adding monotonic counters to automata and transition graphs. In Proceedings of Developments in Language Theory (DLT). 308-319.
25. KARP, R. M. 1978. A characterization of the minimum cycle mean in a digraph. Disc. Math. 23, 3, 309-311.
26. KIRSTEN, D. AND MÄURER, I. 2005. On the determinization of weighted automata. J. Autom. Lang. Combinat. 10, 287-312.
27. KLAEDTKE, F. AND RUESS, H. 2003. Monadic second-order logics with cardinalities. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol, 2719 Springer-Verlag Berlin, 681-696.
28. KROB, D. 1992. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, 101-112.
29. KUICH, W. AND SALOMAA, A. 1986. Semirings, Automata, Languages. Monographs in Theoretical Computer Science. An EATCS Series, vol. 5. Springer-Verlag, Berlin.
30. KUPFERMAN, O. AND LUSTIG, Y. 2007. Lattice automata. In Proceedings of Verification, Model Checking, and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science, vol. 4349. Springer-Verlag, Berlin, 199-213.
31. KUPFERMAN, O. AND VARDI, M. Y. 2001. Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2, 3, 408-429.
32. LIGGETT, T. A. AND LIPPMAN, S. A. 1969. Stochastic games with perfect information and time average payoff. SIAM Rev. 11, 604-607.
33. MANNA, Z. AND PNUELI, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin.
34. MERTENS, J. AND NEYMAN, A. 1981. Stochastic games. Int. J. Game Theory 10, 53-66.
35. MEYER, A. R. AND STOCKMEYER, L. J. 1972. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 125-129.
36. MIYANO, S. AND HAYASHI, T. 1984. Alternating finite automata on omega-words. In Proceedings of International Colloquium on Trees in Algebra and Programming (CAAP). 195-210.
37. MOHRI, M. 1997. Finite-state transducers in language and speech processing. Comp. Linguistics 23, 2, 269-311.
38. PAZ, A. 1971. Introduction to Probabilistic Automata. Computer Science and Applied Mathematics. Academic Press, New York.
39. PUTERMAN, M. 1994. Markov Decision Processes. Wiley, New York.
40. SCHÜTZENBERGER, M. P. 1961. On the definition of a family of automata. Inform. Cont. 4, 245-270.
41. SEIDL, H., SCHWENTICK, T., AND MUSCHOLL, A. 2003. Numerical document queries. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). 155-166.
42. SEIDL, H., SCHWENTICK, T., MUSCHOLL, A., AND HABERMEHL, P. 2004. Counting in trees for free. In Proceedings of International Colloquium on Automata, Languages and Programming (ICALP). 1136-1149.
43. SHAPLEY, L. S. 1953. Stochastic games. Proc. National Acad. 39, 1095-1100.
44. SISTLA, A. P., VARDI, M. Y., AND WOLPER, P. 1987. The complementation problem for Büchi automata with applications to temporal logic. Theoret. Comput. Sci. 49, 217-237.
45. THOMAS, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages. Vol. 3, Beyond Words. Springer-Verlag, Berlin, Chapter 7, 389-455.
46. WADGE, W. 1984. Reducibility and determinateness of Baire spaces. Ph. D. dissertation, University of California, Berkeley.
47. ZWICK, U. AND PATERSON, M. 1996. The complexity of mean payoff games on graphs. Theoret. Comput. Sci. 158, 343-359.