28 citations · 38 across the 5 of their papers we have counts for
6 papers · 1 filter
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
Jeremy Sproston
Clock-dependent probabilistic timed automata extend classical timed automata with discrete probabilistic choice, where the probabilities are allowed to depend on the exact values o…
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…
Qualitative Analysis of VASS-Induced MDPs
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr +2
We consider infinite-state Markov decision processes (MDPs) that are induced by extensions of vector addition systems with states (VASS). Verification conditions for these MDPs are…
Solving Parity Games on Integer Vectors
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier +1
We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity ga…
Model Checking Probabilistic Timed Automata with One or Two Clocks
Marcin Jurdzinski, Francois Laroussinie, Jeremy Sproston
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t…