Parallel Recursive State Compression for Free

Alfons Laarman, Jan Cornelis van de Pol, M. Weber

    Research output: Book/ReportReportProfessional

    23 Citations (Scopus)
    11 Downloads (Pure)

    Abstract

    This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors. An algorithmic analysis of both worst-case and optimal compression ratios shows the potential to compress even large states to a small constant on average (8 bytes). Our experiments demonstrate that this holds up in practice: the median compression ratio of 279 measured experiments is within 17% of the optimum for tree compression, and five times better than the median compression ratio of SPIN's COLLAPSE compression. Our algorithms are implemented in the LTSmin tool, and our experiments show that for model checking, multi-core tree compression pays its own way: it comes virtually without overhead compared to the fastest hash table-based methods.
    Original languageUndefined
    Place of PublicationIthaca, NY
    PublisherArXiv
    Number of pages19
    Publication statusPublished - 15 Apr 2011

    Publication series

    Name
    No.arXiv:1104.3119

    Keywords

    • Multi-Core
    • Model Checking
    • CR-D.2.4
    • METIS-277631
    • EWI-20160
    • state space compression
    • Parallel
    • incremental algorithm
    • tree-based algorithm

    Cite this

    Laarman, A., van de Pol, J. C., & Weber, M. (2011). Parallel Recursive State Compression for Free. Ithaca, NY: ArXiv.