| Verification of Markov decision processes using learning algorithms T Brázdil, K Chatterjee, M Chmelik, V Forejt, J Křetínský, M Kwiatkowska, ... International Symposium on Automated Technology for Verification and …, 2014 | 184 | 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 | 83 | 2015 |
| Limit-deterministic Büchi automata for linear temporal logic S Sickert, J Esparza, S Jaax, J Křetínský International Conference on Computer Aided Verification, 312-332, 2016 | 81 | 2016 |
| 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 | 60 | 2008 |
| From LTL to Deterministic Automata: A Safraless Compositional Approach J Esparza, J Křetínský Computer Aided Verification, 2014 | 59 | 2014 |
| Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis K Chatterjee, A Gaiser, J Křetínský International Conference on Computer Aided Verification, 559-575, 2013 | 55 | 2013 |
| Deterministic Automata for the (F, G)-Fragment of LTL J Křetínský, J Esparza Computer Aided Verification, 7-22, 2012 | 54 | 2012 |
| On determinism in modal transition systems N Beneš, J Křetínský, KG Larsen, J Srba Theoretical Computer Science 410 (41), 4026-4043, 2009 | 51 | 2009 |
| Probabilistic bisimulation: Naturally on distributions H Hermanns, J Krčál, J Křetínský International Conference on Concurrency Theory, 249-265, 2014 | 48 | 2014 |
| 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 | 47 | 2015 |
| The 2019 comparison of tools for the analysis of quantitative formal models EM Hahn, A Hartmanns, C Hensel, M Klauck, J Klein, J Křetínský, ... International Conference on Tools and Algorithms for the Construction and …, 2019 | 46 | 2019 |
| Owl: a library for -words, automata, and LTL J Křetínský, T Meggendorfer, S Sickert International Symposium on Automated Technology for Verification and …, 2018 | 46 | 2018 |
| 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 | 45 | 2009 |
| Rabinizer 3: Safraless translation of LTL to small deterministic automata Z Komárková, J Křetínský International Symposium on Automated Technology for Verification and …, 2014 | 44 | 2014 |
| Modal transition systems: Composition and LTL model checking N Beneš, I Černá, J Křetínský International Symposium on Automated Technology for Verification and …, 2011 | 38 | 2011 |
| 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 | 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 |
| From LTL and limit-deterministic Büchi automata to deterministic parity automata J Esparza, J Křetínský, JF Raskin, S Sickert International Conference on Tools and Algorithms for the Construction and …, 2017 | 37 | 2017 |
| Rabinizer 4: from LTL to your favourite deterministic automaton J Křetínský, T Meggendorfer, S Sickert, C Ziegler International Conference on Computer Aided Verification, 567-577, 2018 | 35 | 2018 |
| 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 | 35 | 2017 |
Tomas BrazdilMasaryk UniversityVerified email at fi.muni.cz
