{'fraction_non_alphanumeric': 0.023346303501945526, 'fraction_numerical': 0.0, 'mean_word_length': 5.3128834355828225, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reachability in continuous-time Markov reward decision processes

Continuous-time Markov decision processes (CTMDPs) are widely used for the control of queueing systems, epidemic and manufacturing processes. Various results on optimal schedulers for discounted and average reward optimality 
criteria in CTMDPs are known, but the typical game-theoretic winning objectives have received scant attention so far. 
This paper studies various sorts of reachability objectives for CTMDPs. Memoryless schedulers are optimal for simple reachability objectives as it suffices to consider the embedded MDP. Schedulers that may count the number of visits to states are optimal---when restricting to time-abstract schedulers---for timed reachability in uniform CTMDPs. 
The central result is that for any CTMDP, reward reachability objectives are dual to timed ones. 
As a corollary, epsilon-optimal schedulers for reward reachability objectives in uniform CTMDPs can be obtained in polynomial time using a simple backward greedy algorithm.