| Limit-Deterministic Büchi Automata for Linear Temporal Logic S Sickert, J Esparza, S Jaax, J Křetínský CAV, 2016 | 61 | 2016 |
| Strix: Explicit Reactive Synthesis Strikes Back! PJ Meyer, S Sickert, M Luttenberger International Conference on Computer Aided Verification, 578-586, 2018 | 31 | 2018 |
| 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 |
| From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata J Esparza, J Křetínský, JF Raskin, S Sickert arXiv preprint arXiv:1701.06103, 2017 | 23 | 2017 |
| MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata S Sickert, J Křetínský International Symposium on Automated Technology for Verification and …, 2016 | 23 | 2016 |
| 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 |
| From LTL to deterministic automata J Esparza, J Křetínský, S Sickert Formal Methods in System Design 49 (3), 219-271, 2016 | 21 | 2016 |
| LTL to Deterministic Emerson-Lei Automata D Müller, S Sickert arXiv preprint arXiv:1709.02102, 2017 | 15 | 2017 |
| MoTraS: A tool for modal transition systems and their extensions J Křetínský, S Sickert International Symposium on Automated Technology for Verification and …, 2013 | 14 | 2013 |
| One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata J Esparza, J Kretinsky, S Sickert arXiv preprint arXiv:1805.00748, 2018 | 13 | 2018 |
| Practical synthesis of reactive systems from LTL specifications via parity games M Luttenberger, PJ Meyer, S Sickert Acta Informatica 57 (1), 3-36, 2020 | 10 | 2020 |
| Linear temporal logic S Sickert Archive of Formal Proofs 2016, 2016 | 6 | 2016 |
| Refinement checking on parametric modal transition systems N Beneš, J Křetínský, KG Larsen, MH Mřller, S Sickert, J Srba Acta Informatica 52 (2-3), 269-297, 2015 | 5 | 2015 |
| A Verified and Compositional Translation of LTL to Deterministic Rabin Automata J Brunner, B Seidl, S Sickert 10th International Conference on Interactive Theorem Proving (ITP 2019), 2019 | 4 | 2019 |
| On refinements of Boolean and parametric modal transition systems J Křetínský, S Sickert International Colloquium on Theoretical Aspects of Computing, 213-230, 2013 | 4 | 2013 |
| A Unified Translation of Linear Temporal Logic to ω-Automata S Sickert Technische Universität München, 2019 | 3 | 2019 |
| Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata S Sickert | 3 | 2015 |
| An efficient normalisation procedure for linear temporal logic and very weak alternating automata S Sickert, J Esparza Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 2 | 2020 |
| A Compositional and Unified Translation of LTL into ω-Automata B Seidl, S Sickert Archive of Formal Proofs, 2019 | 2 | 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 |
Jan KřetínskýTechnical University of Munich (tenure-track assistant professor)Verified email at fi.muni.cz
