{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:36:09Z","timestamp":1765827369421,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6-8","license":[{"start":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T00:00:00Z","timestamp":1445472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00236-015-0248-8","type":"journal-article","created":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T06:11:55Z","timestamp":1445494315000},"page":"723-752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification"],"prefix":"10.1007","volume":"53","author":[{"given":"Mikael","family":"Nilsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"Kvarnstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Doherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,22]]},"reference":[{"key":"248_CR1","unstructured":"Bender, M.A., Fineman, J.T., Gilbert, S., Tarjan, R.E.: A new approach to incremental cycle detection and related problems. arXiv preprint arXiv:1112.0784 (2011)"},{"key":"248_CR2","unstructured":"Cesta, A., Finzi, A., Fratini, S., Orlandini, A., Tronci, E.: Analyzing flexible timeline-based plans. In: Proceedings of the 2010 conference on ECAI 2010: 19th European conference on artificial intelligence, pp. 471\u2013476. IOS Press (2010)"},{"key":"248_CR3","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Hunsberger, L., Micheli, A., Roveri, M.: Using timed game automata to synthesize execution strategies for simple temporal networks with uncertainty. In: Proceedings of the twenty-eighth AAAI conference on artificial intelligence, July 27\u201331, 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada., pp. 2242\u20132249 (2014)","DOI":"10.1609\/aaai.v28i1.9040"},{"issue":"1\u20133","key":"248_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1\u20133), 61\u201395 (1991)","journal-title":"Artif. Intell."},{"key":"248_CR5","doi-asserted-by":"crossref","unstructured":"Hunsberger, L.: Fixing the semantics for dynamic controllability and providing a more practical characterization of dynamic execution strategies. In: 16th International symposium on temporal representation and reasoning, 2009. TIME 2009, pp. 155\u2013162. IEEE (2009)","DOI":"10.1109\/TIME.2009.25"},{"key":"248_CR6","doi-asserted-by":"crossref","unstructured":"Morris, P.: A structural characterization of temporal dynamic controllability. In: Proceedings of the 12th international conference on principles and practice of constraint programming, pp. 375\u2013389. Springer-Verlag (2006)","DOI":"10.1007\/11889205_28"},{"key":"248_CR7","doi-asserted-by":"crossref","unstructured":"Morris, P.: Dynamic controllability and dispatchability relationships. In: Integration of AI and OR techniques in constraint programming (CPAIOR), pp. 464\u2013479. Springer (2014)","DOI":"10.1007\/978-3-319-07046-9_33"},{"key":"248_CR8","unstructured":"Morris, P., Muscettola, N.: Temporal dynamic controllability revisited. In: Proceedings of the 20th National conference on artificial intelligence (AAAI-2005) (2005)"},{"key":"248_CR9","unstructured":"Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Proceedings of the 17th international joint conference on artificial intelligence (IJCAI), pp. 494\u2013499, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc (2001)"},{"key":"248_CR10","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: Incremental dynamic controllability revisited. In: Proceedings of the 23rd international conference on automated planning and scheduling (ICAPS) (2013)","DOI":"10.1609\/icaps.v23i1.13603"},{"key":"248_CR11","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: Classical dynamic controllability revisited: a tighter bound on the classical algorithm. In: Proceedings of the 6th international conference on agents and artificial intelligence (ICAART), pp. 130\u2013141 (2014)","DOI":"10.5220\/0004815801300141"},{"key":"248_CR12","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: EfficientIDC: a faster incremental dynamic controllability algorithm. In: Proceedings of the 24th international conference on automated planning and scheduling (ICAPS) (2014)","DOI":"10.1109\/TIME.2014.13"},{"key":"248_CR13","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: Incremental dynamic controllability in cubic worst-case time. In: Proceedings of the 21th international symposium on temporal representation and reasoning (TIME) (2014)","DOI":"10.1109\/TIME.2014.13"},{"key":"248_CR14","unstructured":"Shah, J.A., Stedl, J., Williams, B.C., Robertson, P.: A fast incremental algorithm for maintaining dispatchability of partially controllable plans. In: Boddy, MS., Fox, M, Thibaux, S. (eds.) Proceedings of the 17th international conference on automated planning and scheduling (ICAPS), pp. 296\u2013303. AAAI Press (2007)"},{"key":"248_CR15","unstructured":"Stedl, J.L.: Managing temporal uncertainty under limited communication: a formal model of tight and loose team coordination. Master\u2019s thesis, Massachusetts Institute of Technology (2004)"},{"key":"248_CR16","unstructured":"Tsamardinos, I.: Reformulating temporal plans for efficient execution. Master\u2019s thesis, University of Pittsburgh (2000)"},{"key":"248_CR17","unstructured":"Vidal, T., Ghallab, M.: Dealing with uncertain durations in temporal constraints networks dedicated to planning. In: Proceedings of the 12th European conference on artificial intelligence (ECAI), pp. 48\u201352 (1996)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0248-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0248-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0248-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0248-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T03:04:08Z","timestamp":1748660648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0248-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,22]]},"references-count":17,"journal-issue":{"issue":"6-8","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0248-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2015,10,22]]}}}