MoTraS: A Tool for Modal Transition Systems and Their Extensions. - Jan Kretínský; Salomon Sickert (ATVA, 2013)

On Refinements of Boolean and Parametric Modal Transition Systems. - Jan Kretínský; Salomon Sickert (ICTAC, 2013)

Refinement checking on parametric modal transition systems. - Nikola Benes; Jan Kretínský; Kim G. Larsen; Mikael H. Møller; Salomon Sickert; Jirí Srba (Acta Informatica, 2015)

Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata. - Salomon Sickert (Arch. Formal Proofs, 2015)

MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata. - Salomon Sickert; Jan Kretínský (ATVA, 2016)

Limit-Deterministic Büchi Automata for Linear Temporal Logic. - Salomon Sickert; Javier Esparza; Stefan Jaax; Jan Kretínský (CAV (2), 2016)

Linear Temporal Logic. - Salomon Sickert (Arch. Formal Proofs, 2016)

From LTL to deterministic automata - A safraless compositional approach. - Javier Esparza; Jan Kretínský; Salomon Sickert (Formal Methods Syst. Des., 2016)

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata. - Javier Esparza; Jan Kretínský; Jean-François Raskin; Salomon Sickert (TACAS (1), 2017)

LTL to Deterministic Emerson-Lei Automata. - David Müller 001; Salomon Sickert (GandALF, 2017)

Owl: A Library for ω-Words, Automata, and LTL. - Jan Kretínský; Tobias Meggendorfer; Salomon Sickert (ATVA, 2018)

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton. - Jan Kretínský; Tobias Meggendorfer; Salomon Sickert; Christopher Ziegler (CAV (1), 2018)

Strix: Explicit Reactive Synthesis Strikes Back! - Philipp J. Meyer; Salomon Sickert; Michael Luttenberger (CAV (1), 2018)

One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata. - Javier Esparza; Jan Kretínský; Salomon Sickert (LICS, 2018)

LTL Store: Repository of LTL formulae from literature and case studies. - Jan Kretínský; Tobias Meggendorfer; Salomon Sickert (CoRR, 2018)

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata. - Julian Brunner 001; Benedikt Seidl; Salomon Sickert (ITP, 2019)

A Compositional and Unified Translation of LTL into ω-Automata. - Benedikt Seidl; Salomon Sickert (Arch. Formal Proofs, 2019)

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. - Swen Jacobs; Roderick Bloem; Maximilien Colange; Peter Faymonville; Bernd Finkbeiner; Ayrat Khalimov 001; Felix Klein 001; Michael Luttenberger; Philipp J. Meyer; Thibaud Michaud; Mouhammad Sakr; Salomon Sickert; et al. (CoRR, 2019)

A Unified Translation of Linear Temporal Logic to ω-Automata. - Salomon Sickert (2019)

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata. - Salomon Sickert; Javier Esparza (LICS, 2020)

Practical synthesis of reactive systems from LTL specifications via parity games. - Michael Luttenberger; Philipp J. Meyer; Salomon Sickert (Acta Informatica, 2020)

An Efficient Normalisation Procedure for Linear Temporal Logic: Isabelle/HOL Formalisation. - Salomon Sickert (Arch. Formal Proofs, 2020)

A Unified Translation of Linear Temporal Logic to ω-Automata. - Javier Esparza; Jan Kretínský; Salomon Sickert (J. ACM, 2020)

Certifying Inexpressibility. - Orna Kupferman; Salomon Sickert (FoSSaCS, 2021)

A Simple Rewrite System for the Normalization of Linear Temporal Logic. - Javier Esparza; Rubén Rubio; Salomon Sickert (Principles of Systems Design, 2022)

On the Translation of Automata to Linear Temporal Logic. - Udi Boker; Karoliina Lehtinen; Salomon Sickert (FoSSaCS, 2022)

Practical Applications of the Alternating Cycle Decomposition. - Antonio Casares; Alexandre Duret-Lutz; Klara J. Meyer; Florian Renkin; Salomon Sickert (TACAS (2), 2022)

Certifying DFA Bounds for Recognition and Separation. - Orna Kupferman; Nir Lavee; Salomon Sickert (Innov. Syst. Softw. Eng., 2022)

From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata. - Javier Esparza; Jan Kretínský; Jean-François Raskin; Salomon Sickert (Int. J. Softw. Tools Technol. Transf., 2022)

AutoCorres2. - Matthew Brecknell; David Greenaway; Johannes Hölzl; Fabian Immler; Gerwin Klein; Rafal Kolanski; Japheth Lim; Michael Norrish; Norbert Schirmer; Salomon Sickert; Thomas Sewell; Harvey Tuch; et al. (Arch. Formal Proofs, 2024)

Efficient Normalization of Linear Temporal Logic. - Javier Esparza; Rubén Rubio; Salomon Sickert (J. ACM, 2024)

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. - Swen Jacobs; Guillermo A. Pérez 001; Remco Abraham; Véronique Bruyère; Michaël Cadilhac; Maximilien Colange; Charly Delfosse; Tom van Dijk; Alexandre Duret-Lutz; Peter Faymonville; Bernd Finkbeiner; Ayrat Khalimov 001; et al. (Int. J. Softw. Tools Technol. Transf., 2024)