{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:07:46Z","timestamp":1732032466091},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_19","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"231-245","source":"Crossref","is-referenced-by-count":3,"title":["Complexity in Simplicity: Flexible Agent-Based State Space Exploration"],"prefix":"10.1007","author":[{"given":"Jacob I.","family":"Rasmussen","sequence":"first","affiliation":[]},{"given":"Gerd","family":"Behrmann","sequence":"additional","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abdeddaim, Y., Kerbaa, A., Maler, O.: Task graph scheduling using timed automata. In: Proc. of the International Parallel and Distributed Processing Symposium (IPDPS) (2003)","DOI":"10.1109\/IPDPS.2003.1213431"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"1990","unstructured":"Alur, R., Dill, D.: Automata for modelling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 322\u2013335. Springer, Heidelberg (1990)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In Proc. of Hybrid Systems: Computation and Control. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol.\u00a02034, pp. 49\u201362. Springer, Heidelberg (2001)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"J.E. Beasley","year":"2000","unstructured":"Beasley, J.E., et al.: Scheduling aircraft landings - the static case. Transportation Science\u00a034(2), 180\u2013197 (2000)","journal-title":"Transportation Science"},{"key":"19_CR5","first-page":"140","volume-title":"Workshop on Parallel and Distributed Real-Time Systems 2005","author":"G. Behrmann","year":"2005","unstructured":"Behrmann, G., et al.: Scheduling lacquer production by reachability analysis \u2013 a case study. In: Workshop on Parallel and Distributed Real-Time Systems 2005, p. 140. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1059816.1059823","volume":"32","author":"G. Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Optimal scheduling using priced timed automata. SIGMETRICS Perform. Eval. Rev.\u00a032(4), 34\u201340 (2005)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-30206-3_20","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"T. Brihaye","year":"2004","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: Model-checking weighted timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 277\u2013292. Springer, Heidelberg (2004)"},{"key":"19_CR8","unstructured":"Fehnker, A.: Citius, Vilius, Melius - Guiding and Cost-Optimality in Model Checking of Timed and Hybrid Systems. IPA Dissertation Series, University of Nijmegen (2002)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part I. ORSA Jour. on Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"ORSA Jour. on Computing"},{"issue":"1","key":"19_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search-part II. ORSA Jour. on Computing\u00a02(1), 4\u201332 (1990)","journal-title":"ORSA Jour. on Computing"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-540-31980-1_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Grosu","year":"2005","unstructured":"Grosu, R., Smolka, S.A.: Monte carlo model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 271\u2013286. Springer, Heidelberg (2005)"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"19_CR13","unstructured":"Hendriks, M.: Model Checking Timed Automata - Techniques and Applications. IPA Dissertation Series, University of Nijmegen (2006)"},{"key":"19_CR14","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"19_CR15","volume-title":"Algorithmics for Hard Problems","author":"J. Hromkovic","year":"2002","unstructured":"Hromkovic, J., Oliva, W.M.: Algorithmics for Hard Problems. Springer, New York (2002)"},{"issue":"4598","key":"19_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-44585-4_47","volume-title":"Computer Aided Verification","author":"K. Larsen","year":"2001","unstructured":"Larsen, K., et al.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, p. 493. Springer, Heidelberg (2001)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-24730-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Rasmussen","year":"2004","unstructured":"Rasmussen, J., Larsen, K., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 220\u2013235. Springer, Heidelberg (2004)"},{"key":"19_CR19","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute, Santa Fe, NM (1995)"},{"key":"19_CR20","first-page":"90","volume-title":"Proc. of International Conference on Automated Planning and Scheduling","author":"R. Zhou","year":"2005","unstructured":"Zhou, R., Hansen, E.A.: Beam-stack search: Integrating backtracking with beam search. In: Proc. of International Conference on Automated Planning and Scheduling, pp. 90\u201398. AAAI Press, Menlo Park (2005)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:42Z","timestamp":1605763002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_19","relation":{},"subject":[]}}