Owl: A Library for ω-Words, Automata, and LTL

  title={Owl: A Library for $\omega$-Words, Automata, and LTL},
  author={Jan Křet{\'i}nsk{\'y} and Tobias Meggendorfer and Salomon Sickert},
We present the library Owl (Omega-Words, automata, and LTL) for \(\omega \)-automata and linear temporal logic. It forms a backbone of several translations from LTL to automata and related tools by different authors. We describe the functionality of the library and the recent experience, which has already shown the library is apt for easy prototyping of new tools in this area. 

A Unified Translation of Linear Temporal Logic to ω-Automata

A unified translation of LTL formulas into nondeterministic Buchi automata, limit-deterministic LTL automata (LDBA), and deterministic Rabin Automata (DRA) is presented.

From Spot 2.0 to Spot 2.10: What's New?

This paper summarizes the evolution of Spot over the past six years, since the release of Spot 2.0, which was the first version to support ω -automata with arbitrary acceptance conditions, and the last version presented at a conference.

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

This work presents a direct and purely syntactic normalisation procedure for LTL yielding a normal form, comparable to the one by Chang, Manna, and Pnueli, that has only a single exponential blow-up.

Good-for-MDPs Automata

The promise of GFM automata is demonstrated by defining a new class of automata with favorable properties - they are Buchi Automata with low branching degree obtained through a simple construction - and it is shown that going beyond limit-deterministic automata may significantly benefit reinforcement learning.

Practical Applications of the Alternating Cycle Decomposition

The first practical implementation of the Alternating Cycle Decomposition in two different tools, Owl and Spot, is presented, and it is shown how the ACD can generalize many other specialized constructions such as deciding typeness of automata and degeneralization of generalized Büchi automata, providing a framework of practical algorithms for ω-automata.

Practical synthesis of reactive systems from LTL specifications via parity games

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.

Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization

The second generation of the tool Seminator that transforms transition-based generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata is presented, providing a new way to complement automata that is competitive with state-of-the-art complementation tools.

Practical "Paritizing" of Emerson-Lei Automata

We introduce a new algorithm that takes a Transition-based Emerson-Lei Automaton (TELA), that is, an ω-automaton whose acceptance condition is an arbitrary Boolean formula on sets of transitions to

Almost-Symbolic Synthesis via ∆2-Normalisation for Linear Temporal Logic

An almost-symbolic version of this classic idea that performs the following steps: normalisation of the specification into a Boolean combination of “simple” fragment of LTL, translation of each “ simple” subformula into a deterministic automaton, encoding of each automaton into a binary decision diagram (BDD), and construction of a parity automaton by operations on the BDD.



Spot 2 . 0 — a framework for LTL and ω-automata manipulation

Spot 2.0 is presented, a C++ library with Python bindings and an assortment of command-line tools designed to manipulate LTL and ω-automata in batch, useful to researchers who have automata to process.

Spot 2.0 - A Framework for LTL and \omega -Automata Manipulation

Spot 2.0 is presented, a C++ library with Python bindings and an assortment of command-line tools designed to manipulate LTL and \(\omega \)-automata in batch, useful to researchers who have automata to process.

Deterministic Automata for the (F,G)-fragment of LTL

This work presents a direct translation of the ( F, G )-fragment of LTL into deterministic ω-automata with no determinization procedure involved and investigates the complexity of this translation and provides experimental results and compare them to the traditional method.

From LTL to Deterministic Automata: A Safraless Compositional Approach

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is the product of a master automaton and an array of slave automata, one

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.

Improved Automata Generation for Linear Temporal Logic

The experimental results show that the state-of-the-art algorithm for obtaining an automaton from a linear temporal logic formula outperforms the previous one, with respect to both the size of the generated automata and computation time.

Seminator: A Tool for Semi-Determinization of Omega-Automata

The tool Seminator accepts transition-based generalized Buchi automata (TGBA) as an input and produces automata with two kinds of semi-determinism, and the implemented procedure performs degeneralization and semi-Determinization simultaneously and employs several other optimizations.

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.

Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment

This work presents a new translation to deterministic Rabin automata via alternating automata and deterministic transition-based generalized RabinAutomata that can produce significantly smaller automata compared to Rabinizer and ltl2dstar.

GOAL for Games, Omega-Automata, and Logics

The second generation of GOAL is a complete redesign with an extensible architecture, many enhancements to existing functions, and new features that provide more automata conversion, complementation, simplification, and testing algorithms, translation of full QPTL formulae, and better automata navigation with more layout algorithms and utility functions.