This paper focuses on using beam search, a heuristic search algorithm, for pruning state spaces while generating. The original beam search is adapted to the state space generation setting and two new search variants are devised. The resulting framework encompasses some known algorithms, such as A*. We also report on two case studies based on an implementation of beam search in mCRL.
|Title of host publication||Proceedings of the 5th International Symposium of Automated Technology for Verification and Analysis|
|Place of Publication||Heidelberg|
|Publication status||Published - 2007|
|Name||Lecture Notes in Computer Science|