Skip to main content
SpringerLink
Log in

Pruning State Spaces with Extended Beam Search

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4762))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Behrmann, G., Larsen, K., Rasmussen, J.: Optimal scheduling using priced timed automata. SIGMETRICS Perform. Eval. Rev. 32(4), 34–40 (2005)

    Article  Google Scholar 

  2. Blom, S., Fokkink, W., Groote, J., van Langevelde, I., Lisser, B., van de Pol, J.: μCRL: A toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250–254. Springer, Heidelberg (2001)

    Google Scholar 

  3. Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. STTT 5(2), 247–267 (2004)

    Google Scholar 

  4. Edelkamp, S., Lluch-Lafuente, A., Leue, S.: Directed explicit model checking with HSF-SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 57–79. Springer, Heidelberg (2001)

    Google Scholar 

  5. Godefroid, P., Khurshid, S.: Exploring very large state spaces using genetic algorithms. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 266–280. Springer, Heidelberg (2002)

    Google Scholar 

  6. Groce, A., Visser, W.: Heuristics for model checking Java programs. STTT 6(4), 260–276 (2004)

    Article  Google Scholar 

  7. Oechsner, S., Rose, O.: Scheduling cluster tools using filtered beam search and recipe comparison. In: Proc. 2005 Winter Simulation Conference, pp. 2203–2210. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  8. Peled, D.: Ten years of partial order reduction. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 17–28. Springer, Heidelberg (1998)

    Google Scholar 

  9. Pinedo, M.: Scheduling: Theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)

    Google Scholar 

  10. Russell, S., Norvig, P.: Artificial intelligence: A modern approach. Prentice-Hall, Englewood Cliffs (1995)

    MATH  Google Scholar 

  11. Ruys, T.: Optimal scheduling using Branch-and-Bound with SPIN 4.0. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 1–17. Springer, Heidelberg (2003)

    Google Scholar 

  12. Si Ow, P., Morton, E.: Filtered beam search in scheduling. Intl. J. Production Res. 26, 35–62 (1988)

    Article  Google Scholar 

  13. Dashti, M.T., Wijs, A.J.: Pruning state spaces with extended beam search. Technical Report SEN-R0610, CWI (2006), ftp.cwi.nl/CWIreports/SEN/SEN-R0610.pdf .

  14. Valente, J., Alves, R.: Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Comput. Ind. Eng. 48(2), 363–375 (2005)

    Article  Google Scholar 

  15. Weber, S.: Design of Real-Time supervisory control systems. PhD thesis, TU/e (2003)

    Google Scholar 

  16. Wijs, A., van de Pol, J., Bortnik, E.: Solving scheduling problems by untimed model checking. In: Proc. FMICS 2005, pp. 54–61. ACM Press, New York (2005)

    Chapter  Google Scholar 

  17. Wijs, A.J., Lisser, B.: Distributed extended beam search for quantitative model checking. In: MoChArt 2006. LNCS (LNAI), vol. 4428, pp. 165–182. Springer, Heidelberg (2007)

    Google Scholar 

  18. Zhou, R., Hansen, E.: Beam-stack search: Integrating backtracking with beam search. In: Proc. ICAPS 2005, pp. 90–98. AAAI (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, Amsterdam,  

    Mohammad Torabi Dashti & Anton J. Wijs

Authors
  1. Mohammad Torabi Dashti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anton J. Wijs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kedar S. Namjoshi Tomohiro Yoneda Teruo Higashino Yoshio Okamura

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Torabi Dashti, M., Wijs, A.J. (2007). Pruning State Spaces with Extended Beam Search. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds) Automated Technology for Verification and Analysis. ATVA 2007. Lecture Notes in Computer Science, vol 4762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75596-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75596-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75595-1

  • Online ISBN: 978-3-540-75596-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation