Expressiveness and closure properties for quantitative languages

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 199-208

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

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b EPFL   (Switzerland)

^c INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

AVERAGE CASE; BOOLEAN OPERATIONS; CLOSURE PROPERTY; INFINITE WORD; NONDETERMINISTIC AUTOMATA; SMALL PERTURBATIONS; TRANSITION WEIGHT; WEIGHTED AUTOMATA;

COMPUTER CIRCUITS;

EID: 70350576896     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2009.16     Document Type: Conference Paper

References (25)

1. A. Chakrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar. Verifying quantitative properties using bound functions. In CHARME, LNCS 3725, pages 50-64. Springer, 2005.
2. A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Resource interfaces. In EMSOFT, LNCS 2855, pages 117-133. Springer, 2003.
3. K. Chatterjee. Stochastic ω-Regular Games. PhD thesis, University of California, Berkeley, 2007.
4. K. Chatterjee, L. Doyen, and T. A. Henzinger. Expressiveness and closure for quantitative languages. Technical Report MTC-REPORT-2008-004, http://infoscience.epfl.ch/record/116423, EPFL, 2008.
5. K. Chatterjee, L. Doyen, and T. A. Henzinger. Quantitative languages. In CSL, LNCS 5213, pages 385-400. Springer, 2008.
6. K. Chatterjee, A. Ghosal, T. A. Henzinger, D. Iercan, C. Kirsch, C. Pinello, and A. Sangiovanni-Vincentelli. Logical reliability of interacting real-time tasks. In DATE, pages 909-914. ACM, 2008.
7. A. Condon. The complexity of stochastic games. Inf. Comput., 96(2):203-224, 1992.
8. C. Cortes and M. Mohri. Context-free recognition with weighted automata. Grammars, 3(2/3):133-150, 2000.
9. K. Culik II and J. Karhumäki. Finite automata computing real functions. SIAM J. Comput., 23(4):789-814, 1994.
10. L. de Alfaro, T. A. Henzinger, and R. Majumdar. Discounting the future in systems theory. In ICALP, LNCS 2719, pages 1022-1037. Springer, 2003.
11. M. Droste and P. Gastin. Weighted automata and weighted logics. Th. C. Sci., 380(1-2):69-86, 2007.
12. M. Droste, W. Kuich, and G. Rahonis. Multi-valued MSO logics over words and trees. Fundamenta Informaticae, 84(3-4):305-327, 2008.
13. M. Droste and D. Kuske. Skew and infinitary formal power series. In ICALP, LNCS 2719, pages 426-438. Springer, 2003.
14. M. Droste and G. Rahonis. Weighted automata and weighted logics with discounting. In CIAA, LNCS 4783, pages 73-84. Springer, 2007.
15. A. Ehrenfeucht and J. Mycielski. Positional strategies for mean payoff games. Int. Journal of Game Theory, 8(2):109-113, 1979.
16. Z. Ésik and W. Kuich. An algebraic generalization of omega-regular languages. In MFCS, LNCS 3153, pages 648-659. Springer, 2004.
17. A. Gurfinkel and M. Chechik. Multi-valued model checking via classical model checking. In CONCUR, LNCS 2761, pages 263-277. Springer, 2003.
18. R. M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23(3):309-311, 1978.
19. W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of EATCS Monographs in Theoretical Computer Science. Springer, 1986.
20. O. Kupferman and Y. Lustig. Lattice automata. In VMCAI, LNCS 4349, pages 199-213. Springer, 2007.
21. M. O. Rabin. Probabilistic automata. Information and Control, 6(3):230-245, 1963.
22. M.P. Schútzenberger. On the definition of a family of automata. Inf. and control, 4(2-3):245-270, 1961.
23. L. S. Shapley. Stochastic games. In Proc. of the National Acadamy of Science USA, volume 39, pages 1095-1100, 1953.
24. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS, pages 332-344. IEEE, 1986.
25. U. Zwick and M. Paterson. The complexity of mean payoff games on graphs. Theor. Comput. Sci., 158(1&2):343-359, 1996.