| The ins and outs of the probabilistic model checker MRMC JP Katoen, IS Zapreev, EM Hahn, H Hermanns, DN Jansen Performance evaluation 68 (2), 90-104, 2011 | 461 | 2011 |
| Bisimulation minimisation mostly speeds up probabilistic model checking JP Katoen, T Kemna, I Zapreev, DN Jansen Tools and Algorithms for the Construction and Analysis of Systems, 87-101, 2007 | 159 | 2007 |
| How fast and fat is your probabilistic model checker? an experimental performance comparison DN Jansen, JP Katoen, M Oldenkamp, M Stoelinga, I Zapreev Haifa verification conference, 69-85, 2007 | 99 | 2007 |
| A probabilistic extension of UML statecharts DN Jansen, H Hermanns, JP Katoen International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2002 | 88 | 2002 |
| Applying Automata Learning to Embedded Control Software W Smeenk, J Moerman, F Vaandrager, DN Jansen Formal Methods and Software Engineering: 17th International Conference on …, 2015 | 86 | 2015 |
| Applying Automata Learning to Embedded Control Software W Smeenk, FW Vaandrager, DN Jansen | 86 | 2013 |
| An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation JF Groote, DN Jansen, JJA Keiren, AJ Wijs ACM Transactions on Computational Logic (TOCL) 18 (2), 1-34, 2017 | 57 | 2017 |
| From StoCharts to MoDeST: a comparative reliability analysis of train radio communications H Hermanns, DN Jansen, YS Usenko Proceedings of the 5th international workshop on Software and performance, 13-23, 2005 | 52 | 2005 |
| Requirements-level semantics and model checking of object-oriented statecharts R Eshuis, DN Jansen, R Wieringa Requirements engineering 7 (4), 243-263, 2002 | 52 | 2002 |
| Flow faster: Efficient decision algorithms for probabilistic simulations L Zhang, H Hermanns, F Eisenbrand, DN Jansen Logical methods in computer science 4 (4), 2008 | 51 | 2008 |
| Finding polynomial loop invariants for probabilistic programs Y Feng, L Zhang, DN Jansen, N Zhan, B Xia International Symposium on Automated Technology for Verification and …, 2017 | 45 | 2017 |
| Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata J Berendsen, DN Jansen, JP Katoen Quantitative Evaluation of Systems, 2006. QEST 2006. Third International …, 2006 | 45* | 2006 |
| A QoS-oriented extension of UML statecharts D Jansen, H Hermanns, JP Katoen «UML» 2003-The Unified Modeling Language. Modeling Languages and …, 2003 | 44 | 2003 |
| Logic and model checking for hidden Markov models L Zhang, H Hermanns, D Jansen Formal Techniques for Networked and Distributed Systems-FORTE 2005, 98-112, 2005 | 37 | 2005 |
| An O(m log n) algorithm for branching bisimilarity on labelled transition systems DN Jansen, JF Groote, JJA Keiren, A Wijs International Conference on Tools and Algorithms for the Construction and …, 2020 | 36 | 2020 |
| Extensions of statecharts: with probability, time, and stochastic timing DN Jansen University of Twente, 2003 | 32 | 2003 |
| Fortuna: Model checking priced probabilistic timed automata J Berendsen, DN Jansen, F Vaandrager 2010 Seventh International Conference on the Quantitative Evaluation of …, 2010 | 31 | 2010 |
| Undecidability of cost-bounded reachability in priced probabilistic timed automata J Berendsen, T Chen, D Jansen Theory and Applications of Models of Computation, 128-137, 2009 | 31 | 2009 |
| Automata-based CSL model checking L Zhang, DN Jansen, F Nielson, H Hermanns Automata, languages and programming: ... ICALP. Part II, 271-282, 2011 | 30 | 2011 |
| A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking T van Dijk, EM Hahn, DN Jansen, Y Li, T Neele, M Stoelinga, A Turrini, ... Dependable Software Engineering: Theories, Tools, and Applications, 35-51, 2015 | 29 | 2015 |
