The Target Discounted-Sum Problem
From MaRDI portal
Publication:4635852
DOI10.1109/LICS.2015.74zbMath1401.68149OpenAlexW1589996173MaRDI QIDQ4635852
Jan Otop, Udi Boker, 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
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Reachability Problems for One-Dimensional Piecewise Affine Maps ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ Percentile queries in multi-dimensional Markov decision processes ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ What's decidable about weighted automata? ⋮ A game-theoretic approach for the synthesis of complex systems