Jeremy Sproston

1.9k total citations
25 papers, 494 citations indexed

About

Jeremy Sproston is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence. According to data from OpenAlex, Jeremy Sproston has authored 25 papers receiving a total of 494 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 16 papers in Software and 10 papers in Artificial Intelligence. Recurrent topics in Jeremy Sproston's work include Formal Methods in Verification (25 papers), Petri Nets in System Modeling (13 papers) and Model-Driven Software Engineering Techniques (10 papers). Jeremy Sproston is often cited by papers focused on Formal Methods in Verification (25 papers), Petri Nets in System Modeling (13 papers) and Model-Driven Software Engineering Techniques (10 papers). Jeremy Sproston collaborates with scholars based in Italy, France and United Kingdom. Jeremy Sproston's co-authors include Gethin Norman, Marta Kwiatkowska, David Parker, Roberto Segala, Serge Haddad, Susanna Donatelli, François Laroussinie, Davide Cerotti, András Horváth and Marie Duflot and has published in prestigious journals such as IEEE Transactions on Software Engineering, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Jeremy Sproston

24 papers receiving 470 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jeremy Sproston Italy 8 397 226 166 86 79 25 494
Ernst Moritz Hahn Germany 10 319 0.8× 229 1.0× 160 1.0× 51 0.6× 48 0.6× 27 449
Barbara Jobstmann Switzerland 12 536 1.4× 327 1.4× 328 2.0× 131 1.5× 89 1.1× 23 693
Alain Finkel France 8 442 1.1× 157 0.7× 229 1.4× 66 0.8× 104 1.3× 30 553
Ansgar Fehnker Australia 10 291 0.7× 137 0.6× 109 0.7× 85 1.0× 68 0.9× 35 434
Laurent Fribourg France 13 374 0.9× 153 0.7× 209 1.3× 84 1.0× 58 0.7× 69 518
Franck Cassez France 13 447 1.1× 97 0.4× 162 1.0× 109 1.3× 171 2.2× 51 596
Salvatore La Torre Italy 12 367 0.9× 172 0.8× 224 1.3× 102 1.2× 83 1.1× 53 462
Ivana Černá Czechia 13 342 0.9× 162 0.7× 212 1.3× 63 0.7× 65 0.8× 56 487
Gerald Lüttgen Germany 10 292 0.7× 290 1.3× 201 1.2× 90 1.0× 95 1.2× 39 512
Bernd Finkbeiner Germany 13 426 1.1× 203 0.9× 385 2.3× 91 1.1× 147 1.9× 74 611

Countries citing papers authored by Jeremy Sproston

Since Specialization
Citations

This map shows the geographic impact of Jeremy Sproston's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jeremy Sproston with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeremy Sproston more than expected).

Fields of papers citing papers by Jeremy Sproston

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jeremy Sproston. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jeremy Sproston. The network helps show where Jeremy Sproston may publish in the future.

Co-authorship network of co-authors of Jeremy Sproston

This figure shows the co-authorship network connecting the top 25 collaborators of Jeremy Sproston. A scholar is included among the top collaborators of Jeremy Sproston based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jeremy Sproston. Jeremy Sproston is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Petrucci, Laure & Jeremy Sproston. (2023). Formal Modeling and Analysis of Timed Systems. Lecture notes in computer science. 1 indexed citations
2.
Sproston, Jeremy. (2023). Qualitative reachability for open interval Markov chains. PeerJ Computer Science. 9. e1489–e1489. 1 indexed citations
3.
Sproston, Jeremy. (2018). Verification and control for probabilistic hybrid automata with finite bisimulations. Journal of Logical and Algebraic Methods in Programming. 103. 46–61. 1 indexed citations
4.
André, Étienne, Laurent Fribourg, & Jeremy Sproston. (2012). An extension of the inverse method to probabilistic timed automata. Formal Methods in System Design. 42(2). 119–145. 3 indexed citations
5.
Norman, Gethin, David Parker, & Jeremy Sproston. (2012). Model checking for probabilistic timed automata. Formal Methods in System Design. 43(2). 164–190. 49 indexed citations
6.
Sproston, Jeremy. (2011). Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata. Institutional Research Information System University of Turin (University of Turin). 79–88. 11 indexed citations
7.
Haddad, Serge, et al.. (2008). Model Checking Timed and Stochastic Properties with CSL^{TA}. IEEE Transactions on Software Engineering. 35(2). 224–240. 38 indexed citations
8.
Duflot, Marie, et al.. (2008). Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. 254–263. 3 indexed citations
9.
Kwiatkowska, Marta, et al.. (2007). Symbolic model checking for probabilistic timed automata. Information and Computation. 205(7). 1027–1077. 64 indexed citations
10.
Donatelli, Susanna, Serge Haddad, & Jeremy Sproston. (2007). CSL^TA: an Expressive Logic for Continuous-Time Markov Chains. Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine). 31–40. 5 indexed citations
11.
Cerotti, Davide, et al.. (2006). Verifying Stochastic Well-formed Nets with CSL Model-Checking Tools. 4. 143–152. 4 indexed citations
12.
Sproston, Jeremy & Susanna Donatelli. (2006). Backward Bisimulation in Markov Chain Model Checking. IEEE Transactions on Software Engineering. 32(8). 531–546. 16 indexed citations
13.
Sproston, Jeremy, et al.. (2004). Backward stochastic bisimulation in CSL model checking. 220–229. 4 indexed citations
14.
Kwiatkowska, Marta, Gethin Norman, & Jeremy Sproston. (2003). Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol. Formal Aspects of Computing. 14(3). 295–318. 45 indexed citations
15.
Kwiatkowska, Marta, Gethin Norman, & Jeremy Sproston. (2003). PCTL model checking of symbolic probabilistic systems. 2 indexed citations
16.
Kwiatkowska, Marta, Gethin Norman, Roberto Segala, & Jeremy Sproston. (2002). Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science. 282(1). 101–150. 129 indexed citations
17.
Kwiatkowska, Marta, Gethin Norman, Roberto Segala, & Jeremy Sproston. (2000). Verifying Quantitative Properties of Continuous Probabilistic Real-Time Graphs. 123–137. 2 indexed citations
18.
Sproston, Jeremy. (2000). Decidable model checking of probabilistic hybrid automata. Lecture notes in computer science. 1926. 31–45. 4 indexed citations
19.
Kwiatkowska, Marta, et al.. (2000). Verifying Soft Deadlines with Probabilistic Timed Automata. 3 indexed citations
20.
Kwiatkowska, Marta, Gethin Norman, & Jeremy Sproston. (2000). Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability. OpenGrey (Institut de l'Information Scientifique et Technique). 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026