The automata-theoretic approach to LTL verification relies on an algorithm for finding
accepting cycles in a Büchi automaton. Explicit-state model checkers typically construct the …

Spot is a library of model-checking algorithms started in 2003. This paper focuses on its
module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of …

The fair cycle detection problem is at the heart of both LTL and fair CTL model checking.
This paper presents a new distributed scalable algorithm for explicit fair cycle detection. Our …

Abstract Model checking is a fully automated, formal method for demonstrating absence of
bugs in reactive systems. Here, bugs are violations of properties in Linear-time Temporal …

A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved
by only considering the prefix of the word read so far. Due to their good compositional …

Recent development in computer hardware has brought more wide-spread emergence of
shared-memory, multi-core systems. These architectures offer opportunities to speed up …

This paper introduces the second generation of GOAL, which is a graphical interactive tool
for games, ω-automata, and logics. It is a complete redesign with an extensible architecture …

Emptiness check is a key operation in the automata-theoretic approach to LTL verification.
However, it is usually done on Büchi automata with a single acceptance condition. We …

In this paper we consider a setting where a robotic vehicle is commissioned to provide
surveillance in an area where there are multiple targets, while satisfying a set of high level …

In the mid 1980s, Lichtenstein, Pnueli, and Zuck proved a classical theorem stating that
every formula of Past LTL (the extension of Linear Temporal Logic (LTL) with past operators) …