@inproceedings{a1e40ba7cb6041519c41a84e64f2537d,
title = "The ComBack method: extending hash compaction with backtracking",
abstract = "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.",
author = "M. Westergaard and L.M. Kristensen and G.S. Brodal and L. Arge",
year = "2007",
doi = "10.1007/978-3-540-73094-1_26",
language = "English",
isbn = "978-3-540-73093-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "445--464",
editor = "A. Yakovlev and J. Kleijn",
booktitle = "Proceedings of the 28th International Conference on Petri Nets and Other Models of Concurrency (ICATPN 2007), 25-29 June 2007, Siedcle, Poland",
address = "Germany",
}