Limit-Deterministic Büchi Automata for Linear Temporal Logic S Sickert, J Esparza, S Jaax, J Křetínský CAV, 2016 | 81 | 2016 |
Strix: Explicit Reactive Synthesis Strikes Back! PJ Meyer, S Sickert, M Luttenberger International Conference on Computer Aided Verification, 578-586, 2018 | 67 | 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 | 46 | 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 | 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 |
Practical synthesis of reactive systems from LTL specifications via parity games M Luttenberger, PJ Meyer, S Sickert Acta Informatica 57 (1), 3-36, 2020 | 34 | 2020 |
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 | 31 | 2016 |
From LTL to deterministic automata J Esparza, J Křetínský, S Sickert Formal Methods in System Design 49 (3), 219-271, 2016 | 27 | 2016 |
LTL to Deterministic Emerson-Lei Automata D Müller, S Sickert arXiv preprint arXiv:1709.02102, 2017 | 24 | 2017 |
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 | 23 | 2018 |
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 | 15 | 2013 |
A Unified Translation of Linear Temporal Logic to ω-Automata J Esparza, J Křetínský, S Sickert Journal of the ACM (JACM) 67 (6), 1-61, 2020 | 7 | 2020 |
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 | 7 | 2020 |
Linear temporal logic S Sickert Archive of Formal Proofs 2016, 2016 | 7 | 2016 |
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 | 6 | 2019 |
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 | 6 | 2015 |
The 5th reactive synthesis competition (SYNTCOMP 2018): Benchmarks, participants & results. CoRR abs/1904.07736 (2019) S Jacobs, R Bloem, M Colange, P Faymonville, B Finkbeiner, A Khalimov, ... | 5 | 1904 |
A Unified Translation of Linear Temporal Logic to ω-Automata S Sickert Technische Universität München, 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 |
Certifying Inexpressibility. O Kupferman, S Sickert FoSSaCS, 385-405, 2021 | 3 | 2021 |