We are happy to announce the release of Spot 2.8.7 This maintenance release contains only bug fixes. You can find the new release here: http://www.lrde.epita.fr/dload/spot/spot-2.8.7.tar.gz See https://spot.lrde.epita.fr/ for documentation and installation instructions. Please direct any feedback to <spot(a)lrde.epita.fr>fr>. New in spot 2.8.7 (2019-03-13) Bugs fixed: - Building a product between two complete automata where one operand had false acceptance could create an incomplete automaton incorrectly tagged as complete, causing the print_hoa() function to raise an exception. - autfilt --uniq was not considering differences in acceptance conditions or number of states when discarding automata. - In an automaton with acceptance condition containing some Fin, and whose accepting cycle could be reduced to a self-loop in an otherwise larger SCC, the generation of an accepting run could be wrong. This could in turn cause segfaults or infinite loops while running autcross or autfilt --stats=%w. - The generic emptiness check used a suboptimal selection of "Fin" to remove, not matching the correct line in our ATVA'19 paper. This could cause superfluous recursive calls, however benchmarks have shown the difference to be insignificant in practice. - The sl(), and sl2() functions for computing the "self-loopization" of an automaton, and used for instance in algorithms for computing proof of stutter-sensitiveness (e.g., in our web application), were incorrect when applied on automata with "t" acceptance (or more generaly, any automaton where a cycle without mark is accepting). - ltlcross was not diagnosing write errors associated to options --grind=FILENAME and --save-bogus=FILENAME. -- Alexandre Duret-Lutz