Expressiveness and closure properties for quantitative languages

Logical Methods in Computer Science

Volumn 6, Issue 3, 2010, Pages 1-23

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

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b CNRS   (France)

^c EPFL   (Switzerland)

Author keywords

Expressiveness and closure properties; Quantitative verification; Weighted automata

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BOOLEAN OPERATIONS; CLOSURE PROPERTY; INFINITE WORD; NONDETERMINISTIC AUTOMATA; QUANTITATIVE VERIFICATION; SMALL PERTURBATIONS; TRANSITION WEIGHT; WEIGHTED AUTOMATA;

AUTOMATA THEORY;

EID: 77957558029     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-6(3:10)2010     Document Type: Article

References (34)

1. [CCH+05] A. Chakrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar. Verifyingquantitative properties using bound functions. In Proc. of CHARME: Correct Hardware Designand Verification Methods, LNCS 3725, pages 50-64. Springer, 2005.
2. [CDH08] K. Chatterjee, L. Doyen, and T. A. Henzinger. Quantitative languages. In Proc. of CSL: Com-puter Science Logic, LNCS 5213, pages 385-400. Springer, 2008.
3. [CdHS03] A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and M. Stoelinga. Resource interfaces. In Proc.of EMSOFT: Embedded Software, LNCS 2855, pages 117-133. Springer, 2003.
4. [CGH+08] 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 Proc. of DATE: Design, Automa-tion and Test. ACM, 2008.
5. [Cha07a] K. Chatterjee. Concurrent games with tail objectives. Theoretical Computer Science, 388:181-198, 2007.
6. [Cha07b] K. Chatterjee. Stochastic!-Regular Games. PhD thesis, University of California, Berkeley, 2007.
7. [CK94] Karel Culik II and Juhani Karhumäki. Finite automata computing real functions. SIAM J.Comput., 23(4):789-814, 1994.
8. [CM00] Corinna Cortes and Mehryar Mohri. Context-free recognition with weighted automata. Gram-mars, 3(2/3):133-150, 2000.
9. [Con92] Anne Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
10. [dAHM03] L. de Alfaro, T. A. Henzinger, and R. Majumdar. Discounting the future in systems theory. InProc. of ICALP: International Colloquium on Automata, Languages and Programming, LNCS2719, pages 1022-1037. Springer, 2003.
11. [DG07] M. Droste and P. Gastin. Weighted automata and weighted logics. Theoretical Computer Science, 380:69-86, 2007.
12. [DK03] M. Droste and D. Kuske. Skew and infinitary formal power series. In Proc. of ICALP: Inter-national Colloquium on Automata, Languages and Programming, LNCS 2719, pages 426-438.Springer, 2003.
13. [DKR08] M. Droste, W. Kuich, and G. Rahonis. Multi-valued MSO logics over words and trees. Funda-menta Informaticae, 84:305-327, 2008.
14. [DR07] M. Droste and G. Rahonis. Weighted automata and weighted logics with discounting. In Proc. ofCIAA: Implementation and Application of Automata, LNCS 4783, pages 73-84. Springer, 2007.
15. [EK04] Zoltán Ésik and Werner Kuich. An algebraic generalization of omega-regular languages. In Proc.of MFCS: Mathematical Foundations of Computer Science, LNCS 3153, pages 648-659. Springer, 2004.
16. [EM79] A. Ehrenfeucht and J. Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory, 8:109-113, 1979.
17. [Eve57] H. Everett. Recursive games. In Contributions to the Theory of Games III, volume 39 of Annalsof Mathematical Studies, pages 47-78, 1957.
18. [FV97] J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
19. [GC03] A. Gurfinkel and M. Chechik. Multi-valued model checking via classical model checking. In Proc.of CONCUR: Concurrency Theory, LNCS 2761, pages 263-277. Springer, 2003.
20. [HK66] A.J. Hoffman and R.M. Karp. On nonterminating stochastic games. Management Sciences, 12(5):359-370, 1966.
21. [Kar78] R. M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics, 23(3):309-311, 1978.
22. [KL07] O. Kupferman and Y. Lustig. Lattice automata. In Proc. of VMCAI: Verification, Model Check-ing, and Abstract Interpretation, LNCS 4349, pages 199-213. Springer, 2007.
23. [KS86] W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of Monographs in Theo-retical Computer Science. An EATCS Series. Springer, 1986.
24. [LL69] T. A. Liggett and S. A. Lippman. Stochastic games with perfect information and time averagepayoff. Siam Review, 11:604-607, 1969.
25. [MN81] J.F. Mertens and A. Neyman. Stochastic games. International Journal of Game Theory, 10:53-66, 1981.
26. [MP92] Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification.Springer-Verlag, 1992.
27. [Put94] M.L. Puterman. Markov Decision Processes. John Wiley and Sons, 1994.
28. [Rab63] Michael O. Rabin. Probabilistic automata. Information and Control, 6(3):230-245, 1963.
29. [Sch61] M. P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
30. [Sha53] L. S. Shapley. Stochastic games. In Proc. of the National Acadamy of Science USA, volume 39,pages 1095-1100, 1953.
31. [Var96] M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Proc. of Banff HigherOrder Workshop, LNCS 1043, pages 238-266. Springer, 1996.
32. [VW86] Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic programverification. In Proc. of LICS: Logic in Computer Science, pages 332-344. IEEE, 1986.
33. [Wad84] W.W. Wadge. Reducibility and Determinateness of Baire Spaces. PhD thesis, University of California,Berkeley, 1984.
34. [ZP96] U. Zwick and M.S. Paterson. The complexity of mean payoff games on graphs. Theoretical Com-puter Science, 158:343-359, 1996.