{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:49:56Z","timestamp":1764841796980,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"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,3]]},"DOI":"10.1007\/s00236-015-0227-0","type":"journal-article","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T06:02:32Z","timestamp":1430373752000},"page":"89-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient execution of dynamically controllable simple temporal networks with uncertainty"],"prefix":"10.1007","volume":"53","author":[{"given":"Luke","family":"Hunsberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"key":"227_CR1","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Hunsberger, L., Micheli, A., Posenato, R., Roveri, M.: Sound and complete algorithms for checking the dynamic controllability of temporal networks with uncertainty, disjunction and observation. In: Cesta, A., Combi, C., Laroussinie, F. (eds.) Proceedings of the 21st International Symposium on Temporal Representation and Reasoning (TIME-2014). IEEE (2014)","DOI":"10.1109\/TIME.2014.21"},{"key":"227_CR2","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: Brodley, C.E., Stone, P. (eds.) Proceedings of the 28th National Conference on Artificial Intelligence (AAAI-2014). AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9040"},{"key":"227_CR3","first-page":"607","volume":"42","author":"PR Conrad","year":"2011","unstructured":"Conrad, P.R., Williams, B.C.: Drake: An efficient executive for temporal plans with choice and uncertainty. J. Artif. Intell. Res. 42, 607\u2013659 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"227_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"227_CR5","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, 61\u201395 (1991)","journal-title":"Artif. Intell."},{"key":"227_CR6","doi-asserted-by":"crossref","unstructured":"Effinger, R., Williams, B., Kelly, G., Sheehy, M.: Dynamic controllability of temporally-flexible reactive programs. In: Gerevini, A., Howe, A., Cesta, A., Refanidis, I. (eds.) Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 09). AAAI Press (2009)","DOI":"10.1609\/icaps.v19i1.13372"},{"key":"227_CR7","unstructured":"Gerevini, A., Perini, A., Ricci, F.: Incremental algorithms for managing temporal constraints. Technical Report IRST-9605-07, IRST (1996)"},{"key":"227_CR8","unstructured":"Hunsberger, L.: Group decision making and temporal reasoning. Ph.D. Thesis, Harvard University, Available as Harvard Technical Report TR-05-02 (2002)"},{"key":"227_CR9","doi-asserted-by":"crossref","unstructured":"Hunsberger, L.: A practical temporal constraint management system for real-time applications. In: Ghallab, M., Spyropoulos, C.D., Fakotakis, N., Avouris, N. (eds.) Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-2008). IOS Press, Amsterdam (2008)","DOI":"10.3233\/978-1-58603-891-5-553"},{"key":"227_CR10","doi-asserted-by":"crossref","unstructured":"Hunsberger, L.: Fixing the semantics for dynamic controllability and providing a more practical characterization of dynamic execution strategies. In: Proceedings of the 16th International Symposium on Temporal Representation and Reasoning (TIME-2009), pp. 155\u2013162. IEEE Computer Society (2009)","DOI":"10.1109\/TIME.2009.25"},{"key":"227_CR11","doi-asserted-by":"crossref","unstructured":"Hunsberger, L.: A fast incremental algorithm for managing the execution of dynamically controllable temporal networks. In: Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME-2010), Los Alamitos, CA, USA, pp. 121\u2013128. IEEE Computer Society (2010)","DOI":"10.1109\/TIME.2010.16"},{"key":"227_CR12","doi-asserted-by":"crossref","unstructured":"Hunsberger, L.: A faster execution algorithm for dynamically controllable stnus. In: Sanchez, C., Venable, B.K., Zimanyi, E. (eds.) Proceedings of the 20th International Symposium on Temporal Representation and Reasoning (TIME-2013). IEEE Computer Society, Washington (2013)","DOI":"10.1109\/TIME.2013.13"},{"key":"227_CR13","unstructured":"Hunsberger, L.: Magic loops in simple temporal networks with uncertainty. In: Filipe, J., Fred, A. (eds.) Proceedings of the Fifth International Conference on Agents and Artificial Intelligence (ICAART-2013). SCITEPRESS (2013)"},{"key":"227_CR14","unstructured":"Hunsberger, L.: New techniques for checking dynamic controllability of simple temporal networks with uncertainty. Springer (Forthcoming)"},{"key":"227_CR15","unstructured":"Hunsberger, L., Posenato, R., Combi, C.: The dynamic controllability of conditional stns with uncertainty. In: Proceedings of the Planning and Plan Execution for Real-World Systems: Principles and Practices (PlanEx) Workshop Associated with the ICAPS-2012 Conference, pp. 121\u2013128 (2012)"},{"key":"227_CR16","doi-asserted-by":"crossref","unstructured":"Morris, P.: A structural characterization of temporal dynamic controllability. In: Principles and Practice of Constraint Programming (CP 2006), Volume 4204 of Lecture Notes in Computer Science, pp. 375\u2013389. Springer, Berlin (2006)","DOI":"10.1007\/11889205_28"},{"key":"227_CR17","doi-asserted-by":"crossref","unstructured":"Morris, P.: Dynamic controllability and dispatchability relationships. In: Integration of AI and OR Techniques in Constraint Programming\u201411th International Conference, CPAIOR 2014, Volume 8451 of Lecture Notes in Computer Science, pp. 464\u2013479. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07046-9_33"},{"key":"227_CR18","unstructured":"Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Nebel, B. (ed.) 17th International Joint Conference on Artificial Intelligence (IJCAI-01), pp. 494\u2013499. Morgan Kaufmann, Los Altos (2001)"},{"key":"227_CR19","unstructured":"Morris, P.H., Muscettola, N.: Temporal dynamic controllability revisited. In: Veloso, M.M., Kambhampati, S. (eds.) The Twentieth National Conference on Artificial Intelligence (AAAI-2005), pp. 1193\u20131198. The MIT Press, Cambridge (2005)"},{"key":"227_CR20","unstructured":"Morris, R., Morris, P., Khatib, L., Yorke-Smith, N.: Temporal constraint reasoning with preferences and probabilities. In: Brafman, R., Junker, U. (eds.) Proceedings of the IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, pp. 150\u2013155 (2005)"},{"key":"227_CR21","unstructured":"Muscettola, N., Morris, P., Tsamardinos, I.: Reformulating temporal plans for efficient execution. In Cohn, A.G., Schubert, L.K., Shapiro, S.C. (eds.) Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pp. 444\u2013452. Morgan Kaufman, Los Altos (1998)"},{"key":"227_CR22","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: Incremental dynamic controllability revisited. In: Borrajo, D., Kambhampati, S., Oddi, A., Fratini, S. (eds.) Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS-2013). AAAI Press (2013)","DOI":"10.1609\/icaps.v23i1.13603"},{"key":"227_CR23","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-2014), pp. 130\u2013141. SCITEPRESS (2014)","DOI":"10.5220\/0004815801300141"},{"key":"227_CR24","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: Efficientidc: a faster incremental dynamic controllability algorithm. In: Chien, S., Fern, A., Ruml, W., Do, M. (eds.) Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS-2014), pp. 199\u2013207. AAAI Press (2014)","DOI":"10.1109\/TIME.2014.13"},{"key":"227_CR25","doi-asserted-by":"crossref","unstructured":"Nilsson, M., Kvarnstr\u00f6m, J., Doherty, P.: Incremental dynamic controllability in cubic worst-case time. In: Cesta, A., Combi, C., Laroussinie, F. (eds.) Proceedings of the 21st International Symposium on Temporal Representation and Reasoning (TIME-2014). IEEE (2014)","DOI":"10.1109\/TIME.2014.13"},{"key":"227_CR26","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1613\/jair.2135","volume":"27","author":"F Rossi","year":"2006","unstructured":"Rossi, F., Venable, K.B., Yorke-Smith, N.: Uncertainty in soft temporal constraint problems: a general framework and controllability algorithms for the fuzzy case. J. Artif. Intell. Res. 27, 617\u2013674 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"227_CR27","unstructured":"Shah, J., Stedl, J., Robertson, P., Williams, B.C.: A fast incremental algorithm for maintaining dispatchability of partially controllable plans. In: Boddy, M., Fox, M., Thi\u00e9baux, S. (eds.) Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007). AAAI Press (2007)"},{"key":"227_CR28","unstructured":"Stedl, J., Williams, B.C.: A fast incremental dynamic controllability algorithm. In: Proceedings of the ICAPS Workshop on Plan Execution: A Reality Check, pp. 69\u201375 (2005)"},{"key":"227_CR29","unstructured":"Tsamardinos, I., Muscettola, N., Morris, P.: Fast transformation of temporal plans for efficient execution. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), pp. 254\u2013261. The MIT Press, Cambridge (1998)"},{"issue":"4","key":"227_CR30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1025894003623","volume":"8","author":"I Tsamardinos","year":"2003","unstructured":"Tsamardinos, I., Vidal, T., Pollack, M.E.: CTP: a new constraint-based formalism for conditional, temporal planning. Constraints 8(4), 365\u2013388 (2003)","journal-title":"Constraints"},{"key":"227_CR31","unstructured":"Venable, K.B., Volpato, M., Peintner, B., Yorke-Smith, N.: Weak and dynamic controllability of temporal problems with disjunctions and uncertainty. In: Proceedings of COPLAS 2010: ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, pp. 50\u201359 (2010)"},{"issue":"1","key":"227_CR32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/095281399146607","volume":"11","author":"T Vidal","year":"1999","unstructured":"Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. J. Exp. Theor. Artif. Intell. 11(1), 23\u201345 (1999)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"227_CR33","doi-asserted-by":"crossref","unstructured":"Wetprasit, R., Sattar, A.: Qualitative and quantitative temporal reasoning with points and durations (an extended abstract). In: Fifth International Workshop on Temporal Representation and Reasoning (TIME-98), pp. 69\u201373 (1998)","DOI":"10.1109\/TIME.1998.674134"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0227-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0227-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0227-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T18:09:43Z","timestamp":1748369383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0227-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,1]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0227-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2015,5,1]]}}}