Efficiently deciding reachability for model checking problems requires storing the entire state space. We provide an information theoretical lower bound for these storage requirements and demonstrate how it can be reached using a binary tree in combination with a compact hash table. Experiments confirm that the lower bound is reached in practice in a majority of cases, confirming the combinatorial nature of state spaces.
CITATION STYLE
Laarman, A. (2018). Optimal storage of combinatorial state spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10811 LNCS, pp. 261–279). Springer Verlag. https://doi.org/10.1007/978-3-319-77935-5_19
Mendeley helps you to discover research relevant for your work.