Fast Symbolic Computation of Bottom SCCs - TACAS 2024 artifact

This is the artifact for the paper "Fast Symbolic Computation of Bottom SCCs", by Anna B. Jakobsen, Rasmus S. M. Jørgensen, Jaco van de Pol and Andreas Pavlogiannis, appearing in TACAS 2024. The artifact contains the LTSmin toolset, extended with an implementation of the algorithms from the paper, to compute the Bottom Strongly Connected Components of a directed graph, provided symbolically by BDDs (Binary Decision Diagrams). The artifact also contains the data set, consisting of directed graphs (state spaces) specified in DVE (Divine), PNML (Petri Nets) and BN (Boolean Networks). The file README.md contains the instructions how to setup the artifact on Ubuntu and how to run the experiment scripts.