We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae
into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi …

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 …

We study the classical problem of verifying programs with respect to formal specifications
given in the linear temporal logic (LTL). We first present novel sound and complete …

Formal behavioral specifications written early in the system-design process and
communicated across all design phases have been shown to increase the efficiency …

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 …

If an ω-automaton accepts a word, it necessarily contains an accepting cycle (ie, a cycle
visiting all acceptance marks in the case of generalized Büchi) that is reachable from the …

A new technique for aircraft route guidance subject to linear temporal logic specifications is
presented. The proposed approach is based on workspace partitioning, and it relies on the …

Tight automata are useful in providing the shortest counterexample in LTL model checking
and also in constructing a maximally satisfying strategy in LTL strategy synthesis. There …

We introduce Büchi Store, an open repository of Büchi automata and other types of ω-
automata for model-checking practice, research, and education. The repository contains …

The two open access volumes LNCS 14574 and 14575 constitute the proceedings of the
27th International Conference on Foundations of Software Science and Computation …