| 2024 | ICFEM | Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory. | Jeremy Sproston |
| 2021 | CONCUR | Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. | James C. A. Main, Mickael Randour, Jeremy Sproston |
| 2020 | FORTE | Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. | Jeremy Sproston |
| 2016 | FOSSACS | Qualitative Analysis of VASS-Induced MDPs. | Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston |
| 2013 | CONCUR | Solving Parity Games on Integer Vectors. | Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston |
| 2011 | FMICS | Performability Measure Specification: Combining CSRL and MSL. | Alessandro Aldini, Marco Bernardo, Jeremy Sproston |
| 2009 | CONCUR | Strict Divergence for Probabilistic Timed Automata. | Jeremy Sproston |
| 2007 | TACAS | From Time Petri Nets to Timed Automata: An Untimed Approach. | Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier, Jeremy Sproston |
| 2007 | TACAS | Model Checking Probabilistic Timed Automata with One or Two Clocks. | Marcin Jurdzinski, Franois Laroussinie, Jeremy Sproston |
| 2005 | FOSSACS | Model Checking Durational Probabilistic Systems. | Franois Laroussinie, Jeremy Sproston |
| 2001 | CONCUR | Symbolic Computation of Maximal Probabilistic Reachability. | Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston |
| 2000 | CONCUR | Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. | Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston |