#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2013

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Javier Esparza, Jan Kretínský, Salomon Sickert
- Formal Methods in System Design
- 2014

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, one for each Gsubformula of φ. The slave automaton for Gψ is in charge of recognizing whether FGψ holds. As opposed to standard determinization procedures, the states of all our… (More)

Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double… (More)

- Jan Kretínský, Salomon Sickert
- ATVA
- 2013

- Salomon Sickert
- Archive of Formal Proofs
- 2015

Recently a new method directly translating linear temporal logic (LTL) formulas to deterministic (generalized) Rabin automata was proposed by Javier Esparza and Jan Kret́ınský [1]. Compared to the existing approaches of constructing a non-deterministic Buechi-automaton in the first step and then applying a determinization procedure (e.g. some variant of… (More)

- Salomon Sickert
- Archive of Formal Proofs
- 2016

- Jan Kretínský, Salomon Sickert
- ICTAC
- 2013

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 the problem of modal refinement over both classes to a problem solvable by a QBF solver and provide experimental results showing our technique scales well. Secondly, we extend… (More)

- Salomon Sickert, Jan Kretínský
- ATVA
- 2016

The limiting factor for quantitative analysis of Markov decision processes (MDP) against specifications given in linear temporal logic (LTL) is the size of the generated product. As recently shown, a special subclass of limit-deterministic Büchi automata (LDBA) can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms.… (More)

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a co-Büchi automaton for φ and an array of Rabin automata, one for each G-subformula of φ. The Rabin automaton for Gψ is in charge of recognizing whether FGψ holds. This information is passed to the co-Büchi automaton… (More)

- David Müller, Salomon Sickert
- GandALF
- 2017

We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are ω-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition structure allows the shift of complexity from the state space to the acceptance condition. Conceptually the construction is… (More)