From Spot 2.0 to Spot 2.10: What's New?
From LRDE
- Authors
- Alexandre Duret-Lutz, Etienne Renault, Maximilien Colange, Florian Renkin, Alexandre Gbaguidi Aisse, Philipp Schlehuber-Caissier, Thomas Medioni, Antoine Martin, Jérôme Dubois, Clément Gillard, Henrich Lauko
- Where
- Proceedings of the 34th International Conference on Computer Aided Verification (CAV'22)
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Spot
- Date
- 2022-06-06
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.
Documents
Bibtex (lrde.bib)
@InProceedings{ duret.22.cav, author = {Alexandre~Duret-Lutz and Etienne Renault and Maximilien Colange and Florian Renkin and Alexandre Gbaguidi~Aisse and Philipp Schlehuber-Caissier and Thomas Medioni and Antoine Martin and J{\'e}r{\^o}me Dubois and Cl{\'e}ment Gillard and Henrich Lauko}, title = {From {S}pot 2.0 to {S}pot 2.10: What's New?}, booktitle = {Proceedings of the 34th International Conference on Computer Aided Verification (CAV'22)}, year = 2022, volume = {13372}, series = {Lecture Notes in Computer Science}, pages = {174--187}, month = aug, publisher = {Springer}, abstract = {Spot is a C++17 library for LTL and $\omega$-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 $\omega$-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.}, doi = {10.1007/978-3-031-13188-2_9} }