Pruning state spaces with extended beam search

  • Authors:
  • Mohammad Torabi Dashti;Anton J. Wijs

  • Affiliations:
  • CWI, Amsterdam;CWI, Amsterdam

  • Venue:
  • ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.