The ComBack method is a memory reduction technique for explicit state space search algorithms. It enhances hash compaction with state reconstruction to resolve hash conflicts on-the-fly thereby ensuring full coverage of the state space. In this paper we provide two means to lower the run-time penalty induced by state reconstructions: a set of strategies to implement the caching method proposed in , and an extension through delayed duplicate detection that allows to group reconstructions together to save redundant work.
|Title of host publication||Transactions on Petri Nets and Other Models of Concurrency III|
|Editors||K. Jensen, J. Billington, M. Koutny|
|Place of Publication||Berlin|
|Publication status||Published - 2009|
|Name||Lecture Notes in Computer Science|