| 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 | 97 | 2018 |
| 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 | 50 | 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 | 48 | 2017 |
| Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs K Chatterjee, AK Goharshady, T Meggendorfer, Đ Žikelić International Conference on Computer Aided Verification, 55-78, 2022 | 24 | 2022 |
| 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 | 24 | 2017 |
| Of Cores: A Partial-Exploration Framework for Markov Decision Processes J Křetínský, T Meggendorfer Logical Methods in Computer Science 16, 2020 | 21 | 2020 |
| 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 | 19 | 2017 |
| 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 | 18 | 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 | 10 | 2019 |
| PET–A Partial Exploration Tool for Probabilistic Verification T Meggendorfer Automated Technology for Verification and Analysis: 20th International …, 2022 | 8 | 2022 |
| Risk-aware Stochastic Shortest Path T Meggendorfer Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 9858-9867, 2022 | 8 | 2022 |
| Index appearance record with preorders J Křetínský, T Meggendorfer, C Waldmann, M Weininger Acta Informatica 59 (5), 585-618, 2022 | 7 | 2022 |
| Semantic labelling and learning for parity game solving in LTL synthesis J Křetínský, A Manta, T Meggendorfer Automated Technology for Verification and Analysis: 17th International …, 2019 | 7 | 2019 |
| Guessing Winning Policies in LTL Synthesis by Semantic Learning J Křetínský, T Meggendorfer, M Prokop, S Rieder International Conference on Computer Aided Verification, 390-414, 2023 | 5 | 2023 |
| Stopping criteria for value iteration on stochastic games with quantitative objectives J Křetínský, T Meggendorfer, M Weininger 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2023 | 5 | 2023 |
| Anytime Guarantees for Reachability in Uncountable Markov Decision Processes K Grover, J Křetínský, T Meggendorfer, M Weininger 33rd International Conference on Concurrency Theory (CONCUR 2022), 2022 | 5 | 2022 |
| MDPs as distribution transformers: Affine invariant synthesis for safety objectives S Akshay, K Chatterjee, T Meggendorfer, Đ Žikelić International Conference on Computer Aided Verification, 86-112, 2023 | 4 | 2023 |
| Algorithms and Hardness Results for Computing Cores of Markov Chains A Ahmadi, K Chatterjee, AK Goharshady, T Meggendorfer, R Safavi, ... | 4 | 2022 |
| 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 | 4 | 2018 |
| Quantitative bounds on resource usage of probabilistic programs K Chatterjee, AK Goharshady, T Meggendorfer, Đ Žikelić Proceedings of the ACM on Programming Languages 8 (OOPSLA1), 362-391, 2024 | 3 | 2024 |
Jan KřetínskýMasaryk University Brno; Technical University of MunichVerified email at fi.muni.cz
