{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:18:55Z","timestamp":1737436735251,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741275"},{"type":"electronic","value":"9783540741282"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74128-2_11","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T06:05:15Z","timestamp":1188194715000},"page":"166-184","source":"Crossref","is-referenced-by-count":6,"title":["Distributed Extended Beam Search for Quantitative Model Checking"],"prefix":"10.1007","author":[{"given":"A. J.","family":"Wijs","sequence":"first","affiliation":[]},{"given":"B.","family":"Lisser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"EATCS Monograph","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. In: EATCS Monograph, Springer, Heidelberg (2002)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J.M.T.: Efficient Guiding Towards Cost-Optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, pp. 174\u2013188. Springer, Heidelberg (2001)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/10722167_19","volume-title":"Computer Aided Verification","author":"G. Behrmann","year":"2000","unstructured":"Behrmann, G., Hune, T., Vaandrager, F.: Distributing Timed Model Checking - How the Search Order Matters. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 216\u2013231. Springer, Heidelberg (2000)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. Bergstra","year":"1985","unstructured":"Bergstra, J., Klop, J.: Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci.\u00a037, 77\u2013121 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR5","first-page":"1467","volume-title":"Encyclopedia of Artificial Intelligence","author":"R. Bisiani","year":"1992","unstructured":"Bisiani, R.: Beam Search. In: Encyclopedia of Artificial Intelligence, pp. 1467\u20131568. Wiley Interscience Publication, Chichester (1992)"},{"key":"11_CR6","volume-title":"Proc. of PDMC 2002, ENTCS","author":"S. Blom","year":"2002","unstructured":"Blom, S., Orzan, S.: A Distributed Algorithm for Strong Bisimulation Reduction of State Spaces. In: Proc. of PDMC 2002, ENTCS, vol.\u00a068 (4), Elsevier, Amsterdam (2002)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S.C.C. Blom","year":"2001","unstructured":"Blom, S.C.C., Fokkink, W.J., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.C.: \u03bcCRL: A Toolset for Analysing Algebraic Specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","first-page":"178","volume-title":"Perspectives of System Informatics","author":"S.C.C. Blom","year":"2003","unstructured":"Blom, S.C.C., Ioustinova, N., Sidorova, N.: Timed verification with \u03bcCRL. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol.\u00a02890, pp. 178\u2013192. Springer, Heidelberg (2003)"},{"key":"11_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0471791571","volume-title":"Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications","author":"G. Bolch","year":"2006","unstructured":"Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications, 2nd edn. Wiley, Chichester (2006)","edition":"2"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P. Brucker","year":"1994","unstructured":"Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics\u00a049(6), 107\u2013127 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.10.1.82","volume":"10","author":"G. Ciardo","year":"1998","unstructured":"Ciardo, G., Gluckman, J., Nicol, D.: Distributed State Space Generation of Discrete-State Stochastic Models. INFORMS Journal on Computing\u00a010(1), 82\u201393 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1057\/palgrave.jors.2601389","volume":"53","author":"F. Croce Della","year":"2002","unstructured":"Della Croce, F., T\u2019kindt, V.: A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society\u00a053, 1275\u20131280 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-61474-5_86","volume-title":"Computer Aided Verification","author":"D. Dill","year":"1996","unstructured":"Dill, D.: The Mur\u03c6 Verification System. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 390\u2013393. Springer, Heidelberg (1996)"},{"key":"11_CR14","unstructured":"Dudeney, H.E.: Amusements in Mathematics, chapter\u00a09, Dover Publications, Inc., pp. 112\u2013114(1958)"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10009-002-0104-3","volume":"5","author":"S. Edelkamp","year":"2003","unstructured":"Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed Explicit-state Model Checking in the Validation of Communication Protocols. STTT\u00a05, 247\u2013267 (2003)","journal-title":"STTT"},{"issue":"1-2","key":"11_CR16","first-page":"19","volume":"39","author":"A. Felner","year":"2003","unstructured":"Felner, A., Kraus, S., Korf, R.E.: KBFS: K-Best-First Search. AMAI\u00a039(1-2), 19\u201339 (2003)","journal-title":"AMAI"},{"key":"11_CR17","unstructured":"Fox, M.S.: Constraint-Directed Search: A Case Study of Job-Shop Scheduling. PhD thesis, CMU (1983)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45139-0_14","volume-title":"Model Checking Software","author":"H. Garavel","year":"2001","unstructured":"Garavel, H., Mateescu, R., Smarandache, I.: Parallel State Space Construction for Model-Checking. In: Dwyer, M.B. (ed.) Model Checking Software. LNCS, vol.\u00a02057, pp. 217\u2013234. Springer, Heidelberg (2001)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-46002-0_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Godefroid","year":"2002","unstructured":"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.\u00a02280, pp. 266\u2013280. Springer, Heidelberg (2002)"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/s10009-003-0130-9","volume":"6","author":"A. Groce","year":"2004","unstructured":"Groce, A., Visser, W.: Heuristics for Model Checking Java Programs. STTT\u00a06(4), 260\u2013276 (2004)","journal-title":"STTT"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/B978-044482830-9\/50035-7","volume-title":"Handbook of Process Algebra","author":"J.F. Groote","year":"2001","unstructured":"Groote, J.F., Reniers, M.A.: Handbook of Process Algebra, 17, pp. 1151\u20131208. Elsevier, Amsterdam (2001)"},{"key":"11_CR22","first-page":"111","volume-title":"Proc. LICS 1997","author":"M. Huth","year":"1997","unstructured":"Huth, M., Kwiatkowska, M.: Quantitative Analysis and Model Checking. In: Proc. LICS 1997, pp. 111\u2013127. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11609773_16","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Jabbar","year":"2006","unstructured":"Jabbar, S., Edelkamp, S.: Parallel External Directed Model Checking With Linear I\/O. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 237\u2013251. Springer, Heidelberg (2006)"},{"key":"11_CR24","first-page":"1461","volume-title":"Encyclopedia of Artificial Intelligence","author":"R.E. Korf","year":"1992","unstructured":"Korf, R.E.: Uniform-cost Search. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence, pp. 1461\u20131462. Wiley-Interscience, New York (1992)"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R.E. Korf","year":"1993","unstructured":"Korf, R.E.: Linear-space best-first search. Artificial Intelligence\u00a062, 41\u201378 (1993)","journal-title":"Artificial Intelligence"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-48234-2_3","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking","author":"F. Lerda","year":"1999","unstructured":"Lerda, F., Sista, R.: Distributed-Memory model checking with SPIN. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) Theoretical and Practical Aspects of SPIN Model Checking. LNCS, vol.\u00a01680, pp. 22\u201339. Springer, Heidelberg (1999)"},{"key":"11_CR27","unstructured":"Lowerre, B.T.: The HARPY speech recognition system. PhD thesis, CMU (1976)"},{"key":"11_CR28","volume-title":"Proc. MED 2000","author":"P. Niebert","year":"2000","unstructured":"Niebert, P., Tripakis, S., Yovine, S.: Minimum-time reachability for timed automata. In: Proc. MED 2000, IEEE Press, Los Alamitos (2000)"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/WSC.2005.1574507","volume-title":"Proc. 2005 Winter Simulation Conference","author":"S. Oechsner","year":"2005","unstructured":"Oechsner, S., Rose, O.: Scheduling Cluster Tools Using Filtered Beam Search and Recipe Comparison. In: Proc. 2005 Winter Simulation Conference, pp. 2203\u20132210. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"P.S. Ow","year":"1988","unstructured":"Ow, P.S., Morton, E.T.: Filtered beam search in scheduling. International Journal of Production Research\u00a026, 35\u201362 (1988)","journal-title":"International Journal of Production Research"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02186362","volume":"12","author":"P.S. Ow","year":"1988","unstructured":"Ow, P.S., Smith, S.F.: Viewing scheduling as an opportunistic problem-solving process. Annals of Operations Research\u00a012, 85\u2013108 (1988)","journal-title":"Annals of Operations Research"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Peled, D., Pratt, V., Holzmann, G. (eds.): Partial Order Methods in Verification, vol. 29 of DIMACS series in discrete mathematics and theoretical computer science. AMS (1996)","DOI":"10.1090\/dimacs\/029"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","volume":"1","author":"I. Pohl","year":"1970","unstructured":"Pohl, I.: Heuristic Search Viewed as Path Finding in a Graph. Artificial Intelligence\u00a01, 193\u2013204 (1970)","journal-title":"Artificial Intelligence"},{"key":"11_CR34","first-page":"353","volume-title":"A Classical Mind: Essays in Honour of C.A.R. Hoare","author":"A.W. Roscoe","year":"1994","unstructured":"Roscoe, A.W.: Model-checking CSP. In: A Classical Mind: Essays in Honour of C.A.R. Hoare, pp. 353\u2013378. Prentice-Hall, Englewood Cliffs (1994)"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Rubin, S.: The ARGOS Image Understanding System. PhD thesis, CMU (1978)","DOI":"10.21236\/ADA066736"},{"key":"11_CR36","volume-title":"Artificial Intelligence: A Modern Approach","author":"S. Russell","year":"1995","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44829-2_1","volume-title":"Model Checking Software","author":"T.C. Ruys","year":"2003","unstructured":"Ruys, T.C.: Optimal scheduling using Branch-and-Bound with SPIN 4.0. In: Ball, T., Rajamani, S.K. (eds.) Model Checking Software. LNCS, vol.\u00a02648, pp. 1\u201317. Springer, Heidelberg (2003)"},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I. Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu, I., Bayiz, M.: Job shop scheduling with beam search. European Journal of Operational Research\u00a0118, 390\u2013412 (1999)","journal-title":"European Journal of Operational Research"},{"key":"11_CR39","unstructured":"Dashti, T. M., Wijs, A.J.: Pruning State Spaces Using Extended Beam Search (2006). (to be published), http:\/\/www.cwi.nl\/~wijs\/beamsearch.pdf"},{"key":"11_CR40","first-page":"184","volume-title":"Proc. ICECCS 2005","author":"A.J. Wijs","year":"2005","unstructured":"Wijs, A.J., Fokkink, W.J.: From $\\chi_{\\textbf{t}}$ to \u03bcCRL: Combining Performance and Functional Analysis. In: Proc. ICECCS 2005, pp. 184\u2013193. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Wijs, A.J., van de Pol, J.C., Bortnik, E.: Solving Scheduling Problems by Untimed Model Checking. In: Proc. FMICS 2005, pp. 54\u201361. ACM Press, 2005. Extended version as CWI technical report SEN-R0608, http:\/\/db.cwi.nl\/rapporten\/abstract.php?abstractnr=2034","DOI":"10.1145\/1081180.1081188"},{"key":"11_CR42","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198540793.001.0001","volume-title":"The Zebra Finch - A Synthesis of Field and Laboratory Studies","author":"R.A. Zann","year":"1996","unstructured":"Zann, R.A.: The Zebra Finch - A Synthesis of Field and Laboratory Studies. Oxford University Press Inc, Oxford (1996)"},{"key":"11_CR43","unstructured":"Zhou, R., Hansen, E.A.: Beam-Stack Search: Integrating Backtracking with Beam Search. In: Proc. ICAPS 2005, pp. 90\u201398. AAAI (2005)"}],"container-title":["Lecture Notes in Computer Science","Model Checking and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74128-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:24:17Z","timestamp":1737393857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74128-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540741275","9783540741282"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74128-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}