Spot is a C++ 17 library for LTL and ω-automata manipulation, with command-line utilities,
and Python bindings. This paper summarizes its evolution over the past six years, since the …

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 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 …

This paper introduces time window temporal logic (TWTL), a rich expressive language for
describing various time bounded specifications. In particular, the syntax and semantics of …

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for
an LTL formula φ. The automaton is the product of a master automaton and an array of slave …

In this paper, we introduce an automata-based framework for planning with relaxed
specifications. User relaxation preferences are represented as weighted finite state edit …

We introduce EAHyper, the first tool for the automatic checking of satisfiability, implication,
and equivalence of hyperproperties. Hyperproperties are system properties that relate …

Closed-loop model checking, a formal verification technique for industrial automation
systems, increases the richness of specifications to be checked and reduces the state space …

We define two complementary approaches to monitor decentralized systems. The first relies
on those with a centralized specification, ie, when the specification is written for the behavior …