default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy Sproston
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Jeremy Sproston:
Qualitative reachability for open interval Markov chains. PeerJ Comput. Sci. 9: e1489 (2023)- [e1]Laure Petrucci
, Jeremy Sproston:
Formal Modeling and Analysis of Timed Systems - 21st International Conference, FORMATS 2023, Antwerp, Belgium, September 19-21, 2023, Proceedings. Lecture Notes in Computer Science 14138, Springer 2023, ISBN 978-3-031-42625-4 [contents] - 2022
- [c30]James C. A. Main, Mickael Randour, Jeremy Sproston:
Timed Games with Bounded Window Parity Objectives. FORMATS 2022: 165-182 - [i8]James C. A. Main, Mickael Randour, Jeremy Sproston:
Timed Games with Bounded Window Parity Objectives. CoRR abs/2205.04197 (2022) - 2021
- [j15]Jeremy Sproston:
Probabilistic Timed Automata with Clock-Dependent Probabilities. Fundam. Informaticae 178(1-2): 101-138 (2021) - [j14]Jeremy Sproston:
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. Log. Methods Comput. Sci. 17(4) (2021) - [c29]James C. A. Main, Mickael Randour, Jeremy Sproston:
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CONCUR 2021: 25:1-25:16 - [i7]James C. A. Main, Mickael Randour, Jeremy Sproston:
Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. CoRR abs/2105.06686 (2021) - 2020
- [c28]Jeremy Sproston:
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. FORTE 2020: 150-168 - [i6]Jeremy Sproston:
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. CoRR abs/2006.04202 (2020)
2010 – 2019
- 2019
- [j13]Jeremy Sproston:
Verification and control for probabilistic hybrid automata with finite bisimulations. J. Log. Algebraic Methods Program. 103: 46-61 (2019) - 2018
- [c27]Jeremy Sproston:
Qualitative Reachability for Open Interval Markov Chains. RP 2018: 146-160 - [i5]Jeremy Sproston:
Qualitative Reachability for Open Interval Markov Chains. CoRR abs/1809.06954 (2018) - 2017
- [c26]Paolo Ballarini, Marco Beccuti, Enrico Bibbona, András Horváth, Roberta Sirovich, Jeremy Sproston:
Analysis of Timed Properties Using the Jump-Diffusion Approximation. EPEW 2017: 69-84 - [c25]Jeremy Sproston:
Probabilistic Timed Automata with Clock-Dependent Probabilities. RP 2017: 144-159 - [i4]Jeremy Sproston:
Probabilistic Timed Automata with Clock-Dependent Probabilities. CoRR abs/1707.04507 (2017) - 2016
- [c24]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS 2016: 319-334 - 2015
- [c23]Jeremy Sproston:
Verification and Control of Probabilistic Rectangular Hybrid Automata. FORMATS 2015: 1-9 - [i3]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. CoRR abs/1512.08824 (2015) - 2014
- [j12]Jeremy Sproston:
Exact and Approximate Abstraction for Classes of Stochastic Hybrid Systems. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - 2013
- [j11]Étienne André, Laurent Fribourg, Jeremy Sproston:
An extension of the inverse method to probabilistic timed automata. Formal Methods Syst. Des. 42(2): 119-145 (2013) - [j10]Gethin Norman, David Parker, Jeremy Sproston:
Model checking for probabilistic timed automata. Formal Methods Syst. Des. 43(2): 164-190 (2013) - [c22]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CONCUR 2013: 106-120 - [i2]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CoRR abs/1306.2806 (2013) - 2011
- [c21]Alessandro Aldini, Marco Bernardo, Jeremy Sproston:
Performability Measure Specification: Combining CSRL and MSL. FMICS 2011: 165-179 - [c20]Jeremy Sproston:
Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata. QEST 2011: 79-88 - 2010
- [c19]Jeremy Sproston, Angelo Troina:
Simulation and Bisimulation for Probabilistic Timed Automata. FORMATS 2010: 213-227
2000 – 2009
- 2009
- [j9]Étienne André, Laurent Fribourg, Jeremy Sproston:
An Extension of the Inverse Method to Probabilistic Timed Automata. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 23 (2009) - [j8]Susanna Donatelli, Serge Haddad, Jeremy Sproston:
Model Checking Timed and Stochastic Properties with CSL^{TA}. IEEE Trans. Software Eng. 35(2): 224-240 (2009) - [c18]Jeremy Sproston:
Strict Divergence for Probabilistic Timed Automata. CONCUR 2009: 620-636 - 2008
- [j7]Marcin Jurdzinski, Jeremy Sproston, François Laroussinie:
Model Checking Probabilistic Timed Automata with One or Two Clocks. Log. Methods Comput. Sci. 4(3) (2008) - [c17]Najla Chamseddine, Marie Duflot, Laurent Fribourg, Claudine Picaronny, Jeremy Sproston:
Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. QEST 2008: 254-263 - [i1]Marcin Jurdzinski, François Laroussinie, Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks. CoRR abs/0809.0060 (2008) - 2007
- [j6]Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang:
Symbolic model checking for probabilistic timed automata. Inf. Comput. 205(7): 1027-1077 (2007) - [j5]François Laroussinie, Jeremy Sproston:
State explosion in almost-sure probabilistic reachability. Inf. Process. Lett. 102(6): 236-241 (2007) - [c16]Susanna Donatelli, Serge Haddad, Jeremy Sproston:
CSLTA: an Expressive Logic for Continuous-Time Markov Chains. QEST 2007: 31-40 - [c15]Marcin Jurdzinski, François Laroussinie, Jeremy Sproston:
Model Checking Probabilistic Timed Automata with One or Two Clocks. TACAS 2007: 170-184 - [c14]Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier, Jeremy Sproston:
From Time Petri Nets to Timed Automata: An Untimed Approach. TACAS 2007: 216-230 - 2006
- [j4]Marta Z. Kwiatkowska, Gethin Norman, David Parker, Jeremy Sproston:
Performance analysis of probabilistic timed automata using digital clocks. Formal Methods Syst. Des. 29(1): 33-78 (2006) - [j3]Jeremy Sproston, Susanna Donatelli:
Backward Bisimulation in Markov Chain Model Checking. IEEE Trans. Software Eng. 32(8): 531-546 (2006) - [c13]Davide Cerotti, Davide D'Aprile, Susanna Donatelli, Jeremy Sproston:
Verifying Stochastic Well-formed Nets with CSL Model-Checking Tools. ACSD 2006: 143-152 - [c12]Davide Cerotti, Susanna Donatelli, András Horváth, Jeremy Sproston:
CSL Model Checking for Generalized Stochastic Petri Nets. QEST 2006: 199-210 - 2005
- [c11]François Laroussinie, Jeremy Sproston:
Model Checking Durational Probabilistic Systems. FoSSaCS 2005: 140-154 - 2004
- [c10]Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang:
Symbolic Model Checking for Probabilistic Timed Automata. FORMATS/FTRTFT 2004: 293-308 - [c9]Davide D'Aprile, Susanna Donatelli, Jeremy Sproston:
CSL Model Checking for the GreatSPN Tool. ISCIS 2004: 543-552 - [c8]Jeremy Sproston, Susanna Donatelli:
Backward Stochastic Bisimulation in CSL Model Checking. QEST 2004: 220-229 - [c7]Jeremy Sproston:
Model Checking for Probabilistic Timed Systems. Validation of Stochastic Systems 2004: 189-229 - 2003
- [j2]Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston:
Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol. Formal Aspects Comput. 14(3): 295-318 (2003) - [c6]Marta Z. Kwiatkowska, Gethin Norman, David Parker, Jeremy Sproston:
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks. FORMATS 2003: 105-120 - 2002
- [j1]Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci. 282(1): 101-150 (2002) - [c5]Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston:
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol. PAPM-PROBMIV 2002: 169-187 - 2001
- [c4]Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston:
Symbolic Computation of Maximal Probabilistic Reachability. CONCUR 2001: 169-183 - 2000
- [b1]Jeremy James Sproston:
Model checking of probabilistic timed and hybrid systems. University of Birmingham, UK, 2000 - [c3]Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. CONCUR 2000: 123-137 - [c2]Jeremy Sproston:
Decidable Model Checking of Probabilistic Hybrid Automata. FTRTFT 2000: 31-45
1990 – 1999
- 1999
- [c1]Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston:
Automatic Verification of Real-Time Systems with Discrete Probability Distributions. ARTS 1999: 75-95
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
