Jeremy Sproston

56 papers A 2B 7C 3Journal 24Unranked 19

Year	Rank	Type	Title / Venue / Authors
2024	C	`conf`	Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory. ICFEM Jeremy Sproston
2023	—	`ed.`	Formal Modeling and Analysis of Timed Systems - 21st International Conference, FORMATS 2023, Antwerp, Belgium, September 19-21, 2023, Proceedings FORMATS Laure Petrucci, Jeremy Sproston
2023	J	`jnl`	Qualitative reachability for open interval Markov chains. PeerJ Comput. Sci. Jeremy Sproston
2022	—	`conf`	Timed Games with Bounded Window Parity Objectives. FORMATS James C. A. Main, Mickael Randour, Jeremy Sproston
2022	J	`jnl`	Timed Games with Bounded Window Parity Objectives. CoRR James C. A. Main, Mickael Randour, Jeremy Sproston
2021	J	`jnl`	Probabilistic Timed Automata with Clock-Dependent Probabilities. Fundam. Informaticae Jeremy Sproston
2021	J	`jnl`	Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. Log. Methods Comput. Sci. Jeremy Sproston
2021	B	`conf`	Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CONCUR James C. A. Main, Mickael Randour, Jeremy Sproston
2021	J	`jnl`	Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CoRR James C. A. Main, Mickael Randour, Jeremy Sproston
2020	C	`conf`	Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. FORTE Jeremy Sproston
2020	J	`jnl`	Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. CoRR Jeremy Sproston
2019	J	`jnl`	Verification and control for probabilistic hybrid automata with finite bisimulations. J. Log. Algebraic Methods Program. Jeremy Sproston
2018	—	`conf`	Qualitative Reachability for Open Interval Markov Chains. RP Jeremy Sproston
2018	J	`jnl`	Qualitative Reachability for Open Interval Markov Chains. CoRR Jeremy Sproston
2017	—	`conf`	Analysis of Timed Properties Using the Jump-Diffusion Approximation. EPEW Paolo Ballarini, Marco Beccuti, Enrico Bibbona, András Horváth, Roberta Sirovich, Jeremy Sproston
2017	—	`conf`	Probabilistic Timed Automata with Clock-Dependent Probabilities. RP Jeremy Sproston
2017	J	`jnl`	Probabilistic Timed Automata with Clock-Dependent Probabilities. CoRR Jeremy Sproston
2016	B	`conf`	Qualitative Analysis of VASS-Induced MDPs. FoSSaCS Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2015	J	`jnl`	Qualitative Analysis of VASS-Induced MDPs. CoRR Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2015	—	`conf`	Verification and Control of Probabilistic Rectangular Hybrid Automata. FORMATS Jeremy Sproston
2014	J	`jnl`	Exact and Approximate Abstraction for Classes of Stochastic Hybrid Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Jeremy Sproston
2013	J	`jnl`	An extension of the inverse method to probabilistic timed automata. Formal Methods Syst. Des. Étienne André, Laurent Fribourg, Jeremy Sproston
2013	J	`jnl`	Model checking for probabilistic timed automata. Formal Methods Syst. Des. Gethin Norman, David Parker, Jeremy Sproston
2013	B	`conf`	Solving Parity Games on Integer Vectors. CONCUR Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2013	J	`jnl`	Solving Parity Games on Integer Vectors. CoRR Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2011	—	`conf`	Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata. QEST Jeremy Sproston
2011	C	`conf`	Performability Measure Specification: Combining CSRL and MSL. FMICS Alessandro Aldini, Marco Bernardo, Jeremy Sproston
2010	—	`conf`	Simulation and Bisimulation for Probabilistic Timed Automata. FORMATS Jeremy Sproston, Angelo Troina
2009	J	`jnl`	An Extension of the Inverse Method to Probabilistic Timed Automata. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. Étienne André, Laurent Fribourg, Jeremy Sproston
2009	J	`jnl`	Model Checking Timed and Stochastic Properties with CSL^{TA}. IEEE Trans. Software Eng. Susanna Donatelli, Serge Haddad, Jeremy Sproston
2009	B	`conf`	Strict Divergence for Probabilistic Timed Automata. CONCUR Jeremy Sproston
2008	—	`conf`	Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. QEST Najla Chamseddine, Marie Duflot, Laurent Fribourg, Claudine Picaronny, Jeremy Sproston
2008	J	`jnl`	Model Checking Probabilistic Timed Automata with One or Two Clocks CoRR Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
2008	J	`jnl`	Model Checking Probabilistic Timed Automata with One or Two Clocks. Log. Methods Comput. Sci. Marcin Jurdzinski, Jeremy Sproston, François Laroussinie
2007	—	`conf`	CSL QEST Susanna Donatelli, Serge Haddad, Jeremy Sproston
2007	A	`conf`	From Time Petri Nets to Timed Automata: An Untimed Approach. TACAS Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier, Jeremy Sproston
2007	A	`conf`	Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
2007	J	`jnl`	State explosion in almost-sure probabilistic reachability. Inf. Process. Lett. François Laroussinie, Jeremy Sproston
2007	J	`jnl`	Symbolic model checking for probabilistic timed automata. Inf. Comput. Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang
2006	J	`jnl`	Backward Bisimulation in Markov Chain Model Checking. IEEE Trans. Software Eng. Jeremy Sproston, Susanna Donatelli
2006	—	`conf`	CSL Model Checking for Generalized Stochastic Petri Nets. QEST Davide Cerotti, Susanna Donatelli, András Horváth, Jeremy Sproston
2006	J	`jnl`	Performance analysis of probabilistic timed automata using digital clocks. Formal Methods Syst. Des. Marta Z. Kwiatkowska, Gethin Norman, David Parker, Jeremy Sproston
2006	—	`conf`	Verifying Stochastic Well-formed Nets with CSL Model-Checking Tools. ACSD Davide Cerotti, Davide D'Aprile, Susanna Donatelli, Jeremy Sproston
2005	B	`conf`	Model Checking Durational Probabilistic Systems. FoSSaCS François Laroussinie, Jeremy Sproston
2004	—	`conf`	Backward Stochastic Bisimulation in CSL Model Checking. QEST Jeremy Sproston, Susanna Donatelli
2004	—	`conf`	CSL Model Checking for the GreatSPN Tool. ISCIS Davide D'Aprile, Susanna Donatelli, Jeremy Sproston
2004	—	`conf`	Model Checking for Probabilistic Timed Systems. Validation of Stochastic Systems Jeremy Sproston
2004	—	`conf`	Symbolic Model Checking for Probabilistic Timed Automata. FORMATS/FTRTFT Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang
2003	—	`conf`	Performance Analysis of Probabilistic Timed Automata Using Digital Clocks. FORMATS Marta Z. Kwiatkowska, Gethin Norman, David Parker, Jeremy Sproston
2003	J	`jnl`	Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol. Formal Aspects Comput. Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston
2002	J	`jnl`	Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci. Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston
2002	—	`conf`	Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol. PAPM-PROBMIV Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston
2001	B	`conf`	Symbolic Computation of Maximal Probabilistic Reachability. CONCUR Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston
2000	—	`conf`	Decidable Model Checking of Probabilistic Hybrid Automata. FTRTFT Jeremy Sproston
2000	B	`conf`	Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. CONCUR Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston
1999	—	`conf`	Automatic Verification of Real-Time Systems with Discrete Probability Distributions. ARTS Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston