{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:37:17Z","timestamp":1743025037775,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401179"},{"type":"electronic","value":"9783540448297"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44829-2_13","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:01:40Z","timestamp":1183478500000},"page":"197-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Promela Planning"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0004-3702(99)00071-5","volume":"116","author":"F. Bacchus","year":"2000","unstructured":"F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116:123\u2013191, 2000.","journal-title":"Artificial Intelligence"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Petterson, J. Romijn, and F. W. Vaandrager. Efficient guiding towards cost-optimality in uppaal. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2001.","DOI":"10.1007\/3-540-45319-9_13"},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science. Springer, 1999."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"A. Blum and M. L. Furst. Fast planning through planning graph analysis. In International Joint Conferences on Artificial Intelligence (IJCAI), pages 1636\u20131642, 1995.","DOI":"10.21236\/ADA303260"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"A. Cimatti and M. Roveri. Conformant planning via model checking. In European Conference on Planning (ECP), pages 21\u201333, 1999.","DOI":"10.1007\/10720246_2"},{"key":"13_CR6","unstructured":"A. Cimatti, M. Roveri, and P. Traverso. Automatic OBDD-based generation of universal plans in non-deterministic domains. In National Conference on Artificial Intelligence (AAAI), pages 875\u2013881, 1998."},{"key":"13_CR7","unstructured":"E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999."},{"key":"13_CR8","unstructured":"H. Dierks, G. Behrmann, and K. G. Larsen. Solving planning problems using real-time model checking (translating pddl3 into timed automata). In Artificial Intelligence Planning and Scheduling (AIPS)-Workshop on Temporal Planning, pages 30\u201339, 2002."},{"key":"13_CR9","unstructured":"S. Edelkamp. Planning with pattern databases. In European Conference on Planning (ECP), 2001."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"S. Edelkamp. Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Research (JAIR), 2003. Submitted, A draft is available at PUK-Workshop 2002.","DOI":"10.1613\/jair.1302"},{"key":"13_CR11","unstructured":"S. Edelkamp and M. Helmert. The model checking integrated planning system MIPS. AI-Magazine, pages 67\u201371, 2001."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"S. Edelkamp, S. Leue, and A. Lluch-Lafuente. Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology (STTT), 2003.","DOI":"10.1007\/s10009-002-0104-3"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. Fikes","year":"1971","unstructured":"R. Fikes and N. Nilsson. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189\u2013208, 1971.","journal-title":"Artificial Intelligence"},{"key":"13_CR14","volume-title":"Technical report","author":"M. Fox","year":"2001","unstructured":"M. Fox and D. Long. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Technical report, University of Durham, UK, 2001."},{"key":"13_CR15","unstructured":"A. Gerevini and L. Schubert. Discovering state constraints in DISCOPLAN: Some new results. In National Conference on Artificial Intelligence (AAAI), pages 761\u2013767, 2000."},{"key":"13_CR16","unstructured":"A. Gerevini and I. Serina. LPG: a planner based on local search for planning graphs with action costs. In Artificial Intelligence Planning and Scheduling (AIPS), pages 13\u201322, 2002."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"F. Giunchiglia and P. Traverso. Planning as model checking. In European Conference on Planning (ECP), pages 1\u201319, 1999.","DOI":"10.1007\/10720246_1"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Patrice Godefroid and Sarfraz Khurshid. Exploring very large state spaces using genetic algorithms. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2002.","DOI":"10.1007\/3-540-46002-0_19"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on on Systems Science and Cybernetics, 4:100\u2013107, 1968.","journal-title":"IEEE Transactions on on Systems Science and Cybernetics"},{"key":"13_CR20","unstructured":"J. Hoey, R. Aubin, A. Hu, and C. Boutilier. Spudd: Stochastic planning using decision diagrams. In Conference on Uncertainty in Artificial Intelligence (UAI), 1999."},{"key":"13_CR21","unstructured":"J. Hoffmann. Extending FF to numerical state variables. In European Conference on Artificial Intelligence, 2002."},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"J. Hoffmann and B. Nebel. Fast plan generation through heuristic search. Artificial Intelligence Research, 14:253\u2013302, 2001.","journal-title":"Artificial Intelligence Research"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"G. J. Holzmann and M. H. Smith. Software model checking: Extracting verification models from source code. In Formal Description Techniques for Distributed Systems and Communication Protocols, Protocol Specification, Testing and Verification (FORTE\/PSTV), pages 481\u2013497, 1999.","DOI":"10.1007\/978-0-387-35578-8_28"},{"key":"13_CR24","unstructured":"Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Falk H\u00fcffner, S. Edelkamp, H. Fernau, and R. Niedermeier. Finding optimal solutions to Atomix. In German Conference on Artificial Intelligence (KI), pages 229\u2013243, 2001.","DOI":"10.1007\/3-540-45422-5_17"},{"key":"13_CR26","unstructured":"H. Kautz and B. Selman. Pushing the envelope: Planning propositional logic, and stochastic search. In National Conference on Artificial Intelligence (AAAI), pages 1194\u20131201, 1996."},{"issue":"1","key":"13_CR27","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"key":"13_CR28","unstructured":"J. Kvarnstr\u00f6m, P. Doherty, and P. Haslum. Extending TALplanner with concurrency and ressources. In European Conference on Artificial Intelligence (ECAI), pages 501\u2013505, 2000."},{"key":"13_CR29","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1613\/jair.570","volume":"10","author":"D. Long","year":"1998","unstructured":"D. Long and M. Fox. Efficient implementation of the plan graph in STAN. Artificial Intelligence Research, 10:87\u2013115, 1998.","journal-title":"Artificial Intelligence Research"},{"key":"13_CR30","unstructured":"D. McDermott. The 1998 AI Planning Competition. AI Magazine, 21(2), 2000."},{"key":"13_CR31","unstructured":"J. Pearl. Heuristics. Addison-Wesley, 1985."},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"C. H. Yang and D. L. Dill. Validation with guided search of the state space. In Conference on Design Automation (DAC), pages 599\u2013604, 1998.","DOI":"10.1145\/277044.277201"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44829-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T20:27:41Z","timestamp":1674505661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44829-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401179","9783540448297"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-44829-2_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"15 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}