Share This Author
Limit-Deterministic Büchi Automata for Linear Temporal Logic
This work presents a direct construction from an LTL formula \(\varphi \) to a limit-deterministic Buchi automaton, which yields much smaller automata for formulas with deep nesting of modal operators and performs at least as well as the existing approaches on general formulas.
Strix: Explicit Reactive Synthesis Strikes Back!
Strix is a new tool for reactive LTL synthesis combining a direct translation of LTL formulas into deterministic parity automata (DPA) and an efficient, multi-threaded explicit state solver for…
Practical synthesis of reactive systems from LTL specifications via parity games
- Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
- Computer ScienceActa Informatica
- 29 March 2019
This work presents the adaption of the classic automata-theoretic approach to LTL synthesis, implemented in the tool Strix which has won the two last synthesis competitions, and evaluates the proposed techniques on the Syntcomp2019 benchmark set and shows in more detail how they compare to the techniques implemented in other leading LTL synthesisation tools.
Owl: A Library for ω-Words, Automata, and LTL
The library Owl is presented, which forms a backbone of several translations from LTL to automata and related tools by different authors and is apt for easy prototyping of new tools in this area.
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
This paper describes a single exponential translation from limit-deterministic Buchi automata (LDBA) to DPA, and shows that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, “Safraless” LTL-to-DPA construction.
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton
- Jan Křetínský, Tobias Meggendorfer, Salomon Sickert, Christopher Ziegler
- Computer ScienceCAV
- 14 July 2018
Rabinizer 4 is presented, a tool set for translating formulae of linear temporal logic to different types of deterministic \(\omega \)-automata and enhancements both in terms of the size of the automata and the computational time are shown, due to algorithmic as well as implementation improvements.
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata
A unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi Automata, and nondeterministicBüchi automata derived from one single Master Theorem of purely logical nature is presented.
LTL to Deterministic Emerson-Lei Automata
A new translation from linear temporal logic to deterministic Emerson-Lei automata with a Muller acceptance condition symbolically expressed as a Boolean formula is introduced, which is an enhanced product construction that exploits knowledge of its components to reduce the number of states.
MoTraS: A Tool for Modal Transition Systems and Their Extensions
A tool for modal transition systems (MTS), disjunctive MTS and further extensions of MTS supporting also non-deterministic systems and some additional support such as deterministic hull, LTL model checking etc.
LTL Store: Repository of LTL formulae from literature and case studies
This continuously extended technical report collects and compares commonly used formulae from the literature and provides them in a machine readable way.