A compact, predicate-independent state space representation for model checking Abstract — State space explosion is a significant obstacle in the formal verification of properties on distributed programs. Much effort has been directed in the area of state space reduction for model checking distributed programs. Such research efforts mainly employ one of two techniques: (a) construction of a reduced explicit state space, or (b) a compact representation of the state space. In this paper, we explore the tradeoffs between these approaches, and the limitations of current model-checking techniques. We propose a new approach that uses a compact state space representation, while at the same time facilitating efficient detection of properties in the model. Our representation uses a hybrid of an interleaving approach and a true concurrency representation. We provide experimental results comparing the performance of our implementation against a wide variety of popular model-checking tools. I.