{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:45Z","timestamp":1740097305165,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279466"},{"type":"electronic","value":"9783319279473"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27947-3_13","type":"book-chapter","created":{"date-parts":[[2015,12,18]],"date-time":"2015-12-18T02:04:34Z","timestamp":1450404274000},"page":"245-261","source":"Crossref","is-referenced-by-count":0,"title":["Using Process Calculi for Plan Verification in Multiagent Planning"],"prefix":"10.1007","author":[{"given":"Jan","family":"Jakub\u016fv","sequence":"first","affiliation":[]},{"given":"Jan","family":"To\u017ei\u010dka","sequence":"additional","affiliation":[]},{"given":"Anton\u00edn","family":"Komenda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,19]]},"reference":[{"key":"13_CR1","volume-title":"SOCS","author":"S Bhattacharya","year":"2010","unstructured":"Bhattacharya, S., Kumar, V., Likhachev, M.: Search-based path planning with homotopy class constraints. In: Felner, A., Sturtevant, N.R. (eds.) SOCS. AAAI Press, Menlo Park (2010)"},{"key":"13_CR2","unstructured":"Brafman, R., Domshlak, C.: From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of ICAPS 2008, vol. 8, pp. 28\u201335 (2008)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Fikes, R., Nilsson, N.: STRIPS: a new approach to the application of theorem proving to problem solving. In: Proceedings of the 2nd International Joint Conference on Artificial Intelligence, pp. 608\u2013620 (1971)","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"13_CR4","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"3"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-15640-3_8","volume-title":"Trustworthly Global Computing","author":"J Jakub\u016fv","year":"2010","unstructured":"Jakub\u016fv, J., Wells, J.B.: Expressiveness of generic process shape types. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010. LNCS, vol. 6084, pp. 103\u2013119. Springer, Heidelberg (2010)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-31987-0_27","volume-title":"Programming Languages and Systems","author":"H Makholm","year":"2005","unstructured":"Makholm, H., Wells, J.B.: Instant polymorphic type systems for mobile process calculi: just add reduction rules and close. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 389\u2013407. Springer, Heidelberg (2005)"},{"key":"13_CR7","unstructured":"Nissim, R., Brafman, R. I.: Multi-agent A* for parallel and distributed systems. In: Proceedings of AAMAS 2012, Richland, SC, pp. 1265\u20131266 (2012). http:\/\/dl.acm.org\/citation.cfm?id=2343896.2343955"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Komenda, A.: Relaxation heuristics for multiagent planning. In: Proceedings of ICAPS 2014 (2014)","DOI":"10.1609\/icaps.v24i1.13642"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10489-014-0540-2","volume":"41","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o, A., Onaindia, E., Sapena, S.: Fmap: distributed cooperative multi-agent planning. Appl. Intell. 41(2), 606\u2013626 (2014). http:\/\/dx.doi.org\/10.1007\/s10489-014-0540-2","journal-title":"Appl. Intell."},{"key":"13_CR10","unstructured":"To\u017ei\u010dka, J., Jakub\u016fv, J., Durkota, K., Komenda, A., P\u011bchou\u010dek, M.: Multiagent planning supported by plan diversity metrics and landmark actions. In: Proceedings ICAART 2014 (2014)"},{"key":"13_CR11","unstructured":"To\u017ei\u010dka, J., Jakub\u016fv, J., Komenda, A.: Generating multi-agent plans by distributed intersection of finite state machines. In: Proceedings ECAI 2014, pp. 1111\u20131112 (2014)"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27947-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T05:58:23Z","timestamp":1692165503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27947-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279466","9783319279473"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27947-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}