Abstract We present Spot 2.0, a C++ library with Python bindings and an assortment of
command-line tools designed to manipulate LTL and ω-automata in batch. New automata …

Limit-deterministic Büchi automata can replace deterministic Rabin automata in probabilistic
model checking algorithms, and can be significantly smaller. We present a direct …

We present the library Owl (O mega-W ords, automata, and L TL) for ω-automata and linear
temporal logic. It forms a backbone of several translations from LTL to automata and related …

We propose a flexible exchange format for ω-automata, as typically used in formal
verification, and implement support for it in a range of established tools. Our aim is to simplify …

We present BoSy, a reactive synthesis tool based on the bounded synthesis approach.
Bounded synthesis ensures the minimality of the synthesized implementation by …

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive
system from its temporal logic specification. Two of the main challenges in bringing reactive …

In this paper, we develop a specification-based, process-aware, Intrusion Detection System
(IDS) for complex Industrial Control Systems (ICSs). Complex ICSs are distributed and …

We present a novel approach to deciding the validity of formulas in first-order fixpoint logic
with background theories and arbitrarily nested inductive and co-inductive predicates …

The reactive synthesis problem is to compute a system satisfying a given specification in
temporal logic. Bounded synthesis is the approach to bound the maximum size of the system …

We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We introduce two
new benchmark classes that have been added to the SYNTCOMP library, and briefly …