This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state space is guaranteed. Each encountered state is mapped into a compressed state descriptor (hash value) as in hash compaction. The method additionally stores for each state an integer representing the identity of the state and a backedge to a predecessor state. This allows hash collisions to be resolved on-the-fly during state space exploration using backtracking to reconstruct the full state descriptors when required for comparison with newly encountered states. A prototype implementation of the ComBack method is used to evaluate the method on several example systems and compare its performance to related methods. The results show a reduction in memory usage at an acceptable cost in exploration time. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Westergaard, M., Kristensen, L. M., Brodal, G. S., & Arge, L. (2007). The ComBack method - Extending hash compaction with backtracking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4546 LNCS, pp. 445–464). Springer Verlag. https://doi.org/10.1007/978-3-540-73094-1_26
Mendeley helps you to discover research relevant for your work.