| Verification of Markov decision processes using learning algorithms T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ... Automated Technology for Verification and Analysis: 12th International …, 2014 | 201 | 2014 |
| The Hanoi Omega-Automata Format T Babiak, F Blahoudek, A Duret-Lutz, J Klein, J Křetínský, M David, ... Computer Aided Verification, 2015 | 95 | 2015 |
| Limit-deterministic Büchi automata for linear temporal logic S Sickert, J Esparza, S Jaax, J Křetínský Computer Aided Verification: 28th International Conference, CAV 2016 …, 2016 | 93 | 2016 |
| From LTL to Deterministic Automata: A Safraless Compositional Approach J Esparza, J Křetínský Computer Aided Verification, 2014 | 64 | 2014 |
| The satisfiability problem for probabilistic CTL T Brázdil, V Forejt, J Kretinsky, A Kucera Logic in Computer Science, 2008. LICS'08. 23rd Annual IEEE Symposium on, 391-402, 2008 | 61 | 2008 |
| Owl: a library for-words, automata, and LTL J Křetínský, T Meggendorfer, S Sickert Automated Technology for Verification and Analysis: 16th International …, 2018 | 59 | 2018 |
| Deterministic Automata for the (F, G)-Fragment of LTL J Křetínský, J Esparza Computer Aided Verification, 7-22, 2012 | 57 | 2012 |
| Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis K Chatterjee, A Gaiser, J Křetínský Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013 | 55 | 2013 |
| The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models: (QComp 2019 Competition Report) EM Hahn, A Hartmanns, C Hensel, M Klauck, J Klein, J Křetínský, ... Tools and Algorithms for the Construction and Analysis of Systems: 25 Years …, 2019 | 51 | 2019 |
| Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes K Chatterjee, Z Komárková, J Křetínský Logic in Computer Science, 2015 | 50 | 2015 |
| Probabilistic bisimulation: Naturally on distributions H Hermanns, J Krčál, J Křetínský CONCUR 2014–Concurrency Theory: 25th International Conference, CONCUR 2014 …, 2014 | 50 | 2014 |
| On determinism in modal transition systems N Beneš, J Křetínský, KG Larsen, J Srba Theoretical Computer Science 410 (41), 4026-4043, 2009 | 50 | 2009 |
| From LTL and limit-deterministic Büchi automata to deterministic parity automata J Esparza, J Křetínský, JF Raskin, S Sickert Tools and Algorithms for the Construction and Analysis of Systems: 23rd …, 2017 | 48 | 2017 |
| Rabinizer 3: Safraless translation of LTL to small deterministic automata Z Komárková, J Křetínský Automated Technology for Verification and Analysis: 12th International …, 2014 | 47 | 2014 |
| Continuous-time stochastic games with time-bounded reachability T Brázdil, V Forejt, J Krcal, J Kretınský, A Kucera FSTTCS. LIPIcs 4, 61-72, 2009 | 43 | 2009 |
| Faster statistical model checking for unbounded temporal properties P Daca, TA Henzinger, J Křetínský, T Petrov ACM Transactions on Computational Logic (TOCL) 18 (2), 1-25, 2017 | 39 | 2017 |
| Parametric modal transition systems N Beneš, J Křetínský, K Larsen, M Mřller, J Srba Automated Technology for Verification and Analysis, 275-289, 2011 | 39 | 2011 |
| Modal transition systems: Composition and LTL model checking N Beneš, I Cerná, J Kretınský ATVA 6996, 228-242, 2011 | 38 | 2011 |
| Checking thorough refinement on modal transition systems is exptime-complete N Beneš, J Křetínský, K Larsen, J Srba Theoretical Aspects of Computing-ICTAC 2009, 112-126, 2009 | 38 | 2009 |
| Rabinizer 4: from LTL to your favourite deterministic automaton J Křetínský, T Meggendorfer, S Sickert, C Ziegler Computer Aided Verification: 30th International Conference, CAV 2018, Held …, 2018 | 36 | 2018 |
Tomas BrazdilMasaryk UniversityVerified email at fi.muni.cz
