Pruning State Spaces with Extended Beam Search

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 µCRL.

• Type: Conference
• Year: 2007
• Where: ATVA
• Authors: Muhammad Torabi Dashti, Anton Wijs
• Keywords: ATVA 2007, Beam Search, Heuristic Search Algorithm, Original Beam Search