Automatic verification of real-time systems with discrete probability distributions M Kwiatkowska, G Norman, R Segala, J Sproston Theoretical Computer Science 282 (1), 101-150, 2002 | 492 | 2002 |
Performance analysis of probabilistic timed automata using digital clocks M Kwiatkowska, G Norman, D Parker, J Sproston Formal Methods in System Design 29 (1), 33-78, 2006 | 302 | 2006 |
Symbolic model checking for probabilistic timed automata M Kwiatkowska, G Norman, J Sproston, F Wang Information and Computation 205 (7), 1027-1077, 2007 | 274 | 2007 |
Probabilistic model checking of the IEEE 802.11 wireless local area network protocol M Kwiatkowska, G Norman, J Sproston Joint International Workshop von Process Algebra and Probabilistic Methods …, 2002 | 201 | 2002 |
Model checking for probabilistic timed automata G Norman, D Parker, J Sproston Formal methods in system design 43, 164-190, 2013 | 154 | 2013 |
Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol M Kwiatkowska, G Norman, J Sproston Formal Aspects of Computing 14, 295-318, 2003 | 150 | 2003 |
Model checking timed and stochastic properties with CSL^{TA} S Donatelli, S Haddad, J Sproston IEEE Transactions on Software Engineering 35 (2), 224-240, 2008 | 135* | 2008 |
Verifying quantitative properties of continuous probabilistic timed automata M Kwiatkowska, G Norman, R Segala, J Sproston International Conference on Concurrency Theory, 123-137, 2000 | 124 | 2000 |
Decidable model checking of probabilistic hybrid automata J Sproston International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2000 | 112 | 2000 |
Model checking probabilistic timed automata with one or two clocks M Jurdzinski, F Laroussinie, J Sproston Logical Methods in Computer Science 4, 2008 | 109 | 2008 |
Backward bisimulation in Markov chain model checking J Sproston, S Donatelli IEEE Transactions on Software Engineering 32 (8), 531-546, 2006 | 51* | 2006 |
Practical applications of probabilistic model checking to communication protocols M Duflot, M Kwiatkowska, G Norman, D Parker, S Peyronnet, C Picaronny, ... Formal Methods for Industrial Critical Systems: A Survey of Applications …, 2012 | 46 | 2012 |
Solving parity games on integer vectors PA Abdulla, R Mayr, A Sangnier, J Sproston CONCUR 2013–Concurrency Theory: 24th International Conference, CONCUR 2013 …, 2013 | 43 | 2013 |
Model checking for probabilistic timed and hybrid systems J Sproston PhD thesis, School of Computer Science, University of Birmingham, 2001 | 42 | 2001 |
Symbolic computation of maximal probabilistic reachability M Kwiatkowska, G Norman, J Sproston International Conference on Concurrency Theory, 169-183, 2001 | 38 | 2001 |
Model checking durational probabilistic systems F Laroussinie, J Sproston International Conference on Foundations of Software Science and Computation …, 2005 | 34 | 2005 |
CSL model checking for the GreatSPN tool D D’Aprile, S Donatelli, J Sproston International Symposium on Computer and Information Sciences, 543-552, 2004 | 33 | 2004 |
From time Petri nets to timed automata: An untimed approach D D’Aprile, S Donatelli, A Sangnier, J Sproston Tools and Algorithms for the Construction and Analysis of Systems: 13th …, 2007 | 26 | 2007 |
State explosion in almost-sure probabilistic reachability F Laroussinie, J Sproston Information Processing Letters 102 (6), 236-241, 2007 | 23 | 2007 |
An extension of the inverse method to probabilistic timed automata É André, L Fribourg, J Sproston Formal Methods in System Design 42, 119-145, 2013 | 21* | 2013 |