Pruning state spaces with extended beam search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4762 LNCS, Issue , 2007, Pages 543-552

  Dashti, Mohammad Torabi ^a   Wijs, Anton J ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH; HEURISTIC SEARCH ALGORITHMS;

HEURISTIC METHODS; INFORMATION RETRIEVAL SYSTEMS; SEARCH ENGINES; STATE SPACE METHODS;

HEURISTIC ALGORITHMS;

EID: 38149075148     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. Behrmann, G., Larsen, K., Rasmussen, J.: Optimal scheduling using priced timed automata. SIGMETRICS Perform. Eval. Rev. 32(4), 34-40 (2005)
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)
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)
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)
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)
6. Groce, A., Visser, W.: Heuristics for model checking Java programs. STTT 6(4), 260-276 (2004)
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)
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)
9. Pinedo, M.: Scheduling: Theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs (1995)
10. Russell, S., Norvig, P.: Artificial intelligence: A modern approach. Prentice-Hall, Englewood Cliffs (1995)
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)
12. Si Ow, P., Morton, E.: Filtered beam search in scheduling. Intl. J. Production Res. 26, 35-62 (1988)
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)
15. Weber, S.: Design of Real-Time supervisory control systems. PhD thesis, TU/e (2003)
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)
17. Wijs, A.J., Lisser, B.: Distributed extended beam search for quantitative model checking. In: MoChArt 2006. LNCS (LNAI), vol. 4428, pp. 165-182 (2007)
18. Zhou, R., Hansen, E.: Beam-stack search: Integrating backtracking with beam search. In: Proc. ICAPS 2005, pp. 90-98. AAAI (2005)