From Spot 2.0 to Spot 2.10: What's New?
Alexandre Duret-Lutz (LRDE), Etienne Renault (LRDE), Maximilien, Colange, Florian Renkin (LRDE), Alexandre Gbaguidi, Philipp, Schlehuber-Caissier (LRDE), Thomas Medioni, Antoine Martin (LRDE), J\'er\^ome, Dubois, Cl\'ement Gillard, Henrich Lauko

TL;DR
This paper reviews the six-year evolution of the Spot library, highlighting new features like acceptance transformations, alternating automata, and LTL synthesis, demonstrating its expanding capabilities in automata manipulation.
Contribution
It provides a comprehensive overview of the recent developments and new functionalities added to the Spot library since version 2.0, emphasizing its advancements.
Findings
Added support for acceptance transformations
Introduction of alternating automata and games
Enhanced LTL synthesis features
Abstract
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 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. Since then, Spot has been extended with several features such as acceptance transformations, alternating automata, games, LTL synthesis, and more. We also shed some lights on the data-structure used to store automata.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
