4 papers
Timed Games with Bounded Window Parity Objectives
James C. A. Main, Mickael Randour, Jeremy Sproston
The window mechanism, introduced by Chatterjee et al. for mean-payoff and total-payoff objectives in two-player turn-based games on graphs, refines long-term objectives with time b…
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives
James C. A. Main, Mickael Randour, Jeremy Sproston
The window mechanism was introduced by Chatterjee et al. to reinforce mean-payoff and total-payoff objectives with time bounds in two-player turn-based games on graphs. It has sinc…
Qualitative Reachability for Open Interval Markov Chains
Jeremy Sproston
Interval Markov chains extend classical Markov chains with the possibility to describe transition probabilities using intervals, rather than exact values. While the standard formul…
Probabilistic Timed Automata with Clock-Dependent Probabilities
Jeremy Sproston
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a…