The target discounted-sum problem

DOI10.1109/LICS.2015.74MaRDI QIDQ4635852zbMATH OpenOpenAlexFDO

Authors Udi Boker, Jan Otop, Thomas A. Henzinger

Publication date 23 April 2018

Published in 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2015.74

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decidability of theories and sets of sentences (03B25)

Recommendations

• Determinizing discounted-sum automata
• Exact and approximate determinization of discounted-sum automata
• Weighted automata with discounting
• Solving infinite horizon discounted Markov decision process problems for a range of discount factors
• Quantitative languages defined by functional automata

Cited in

(9)

• A game-theoretic approach for the synthesis of complex systems
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers
• Percentile queries in multi-dimensional Markov decision processes
• Determinizing discounted-sum automata
• Reachability problems for one-dimensional piecewise affine maps
• Determinization of integral discounted-sum automata is decidable
• On the comparison of discounted-sum automata with multiple discount factors
• What's decidable about weighted automata?
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs

This page was built for publication: The target discounted-sum problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635852)