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 $\mu$CRL.

Springer
Lecture Notes in Computer Science
International Symposium on Automated Technology for Verification and Analysis
Specification and Analysis of Embedded Systems

Dashti, M.T, & Wijs, A.J. (2007). Pruning state spaces with extended beam search. In 5th International Symposium on Automated Technology for Verification and Analysis (ATVA) 2007 (pp. 543–552). Springer.