40 citations · 189 across the 15 of their papers we have counts for
15 papers
Efficient Normalization of Linear Temporal Logic
Javier Esparza, Rubén Rubio, Salomon Sickert
In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of LTL with past operators) is equivalent to a formu…
A Simple Rewrite System for the Normalization of Linear Temporal Logic
Javier Esparza, Ruben Rubio, Salomon Sickert
In the mid 80s, Lichtenstein, Pnueli, and Zuck showed that every formula of Past LTL (the extension of Linear Temporal Logic with past operators) is equivalent to a conjunction of…
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021
Swen Jacobs, Guillermo A. Perez, Remco Abraham +22
We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018-2021). We briefly describe the evaluation scheme and the experimental setup of SYNTCOMP. Th…
On the Translation of Automata to Linear Temporal Logic
Udi Boker, Karoliina Lehtinen, Salomon Sickert
While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved in turning automata back to LT…
Certifying DFA Bounds for Recognition and Separation
Orna Kupferman, Nir Lavee, Salomon Sickert
The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to genera…
Certifying Inexpressibility
Orna Kupferman, Salomon Sickert
Different classes of automata on infinite words have different expressive power. Deciding whether a given language can be expressed by an automaton of a desired c…
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
Salomon Sickert, Javier Esparza
In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that every formula of Past LTL (the extension of LTL with past operators) is equivalent to a formu…
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results
Swen Jacobs, Roderick Bloem, Maximilien Colange +11
We report on the fifth reactive synthesis competition (SYNTCOMP 2018). We introduce four new benchmark classes that have been added to the SYNTCOMP library, and briefly describe th…
Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games
Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
The synthesis of reactive systems from linear temporal logic (LTL) specifications is an important aspect in the design of reliable software and hardware. We present our adaption of…
LTL Store: Repository of LTL formulae from literature and case studies
Jan Křetínský, Tobias Meggendorfer, Salomon Sickert
This continuously extended technical report collects and compares commonly used formulae from the literature and provides them in a machine readable way.
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata
Javier Esparza, Jan Kretinsky, Salomon Sickert
We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi automata, and nondeterministic Büchi automata. The translations yield…
LTL to Deterministic Emerson-Lei Automata
David Müller, Salomon Sickert
We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expr…
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
Javier Esparza, Jan Křetínský, Jean-François Raskin +1
Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic par…
From LTL to Deterministic Automata: A Safraless Compositional Approach
Javier Esparza, Jan Křetínský
We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula . The automaton is the product of a master automaton and an array of slave automata, o…
On Refinements of Boolean and Parametric Modal Transition Systems
Jan Křetínský, Salomon Sickert
We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce…