| 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 | 26 | 2018 |
| Value Iteration for Long-Run Average Reward in Markov Decision Processes P Ashok, K Chatterjee, P Daca, J Křetínský, T Meggendorfer International Conference on Computer Aided Verification, 201-221, 2017 | 23 | 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 | 22 | 2018 |
| Index Appearance Record for Transforming Rabin Automata into Parity Automata J Křetínský, T Meggendorfer, C Waldmann, M Weininger International Conference on Tools and Algorithms for the Construction and …, 2017 | 9 | 2017 |
| Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes J Křetínský, T Meggendorfer International Symposium on Automated Technology for Verification and …, 2017 | 7 | 2017 |
| Of Cores: A Partial-Exploration Framework for Markov Decision Processes J Křetínský, T Meggendorfer arXiv preprint arXiv:1906.06931, 2019 | 5 | 2019 |
| Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes J Křetínský, T Meggendorfer Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 5 | 2018 |
| Satisfiability Bounds for ω-Regular Properties in Bounded-Parameter Markov Decision Processes M Weininger, T Meggendorfer, J Křetínský 2019 IEEE 58th Conference on Decision and Control (CDC), 2284-2291, 2019 | 3 | 2019 |
| LTL Store: Repository of LTL formulae from literature and case studies J Křetínský, T Meggendorfer, S Sickert arXiv preprint arXiv:1807.03296, 2018 | 2 | 2018 |
| Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis J Křetínský, A Manta, T Meggendorfer International Symposium on Automated Technology for Verification and …, 2019 | 1 | 2019 |
| Of Cores: A Partial-Exploration Framework for Markov Decision Processes T Meggendorfer, J Křetínský Logical Methods in Computer Science 16, 2020 | | 2020 |
| An Anytime Algorithm for Reachability on Uncountable MDP K Grover, J Křetínský, T Meggendorfer, M Weininger arXiv preprint arXiv:2008.04824, 2020 | | 2020 |
Jan KřetínskýTechnical University of Munich (tenure-track assistant professor)Verified email at fi.muni.cz
