State space compression in Spin with GETSs

We explore the application of a state space compression algorithm to spin. Compression techniques are notably unpredictable: we tend to use them when they work well for us (e.g. zip),but we tend to forget that, according to the theory, they can also result in an expansion (e.g., ziptwice). How w ell a compression algorithm work in a given context is typically discovered experimentally. In this paper, we describe such an experiment, where a compression algorithm based on sharing of state information in a graph structure is used as a state store for a spin-generated veriication programs. The positive results are encouraging for further investigation of the use of this technique in spin-like tools.