Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis

  • Mikael NilssonEmail author
  • Jonas Kvarnström
  • Patrick Doherty
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8946)


Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems where some durations are uncontrollable (determined by nature), as is often the case for actions in planning. It is essential to verify that such networks are dynamically controllable (DC) – executable regardless of the outcomes of uncontrollable durations – and to convert them to an executable form. We use insights from incremental DC verification algorithms to re-analyze the original, classical, verification algorithm. This algorithm is the entry level algorithm for DC verification, based on a less complex and more intuitive theory than subsequent algorithms. We show that with a small modification the algorithm is transformed from pseudo-polynomial to \(O(n^4)\) which makes it still useful. We also discuss a change reducing the amount of work performed by the algorithm.


Temporal networks Dynamic controllability 



This work is partially supported by the Swedish Research Council (VR) Linnaeus Center CADICS, the ELLIIT network organization for Information and Communication Technology, the Swedish Foundation for Strategic Research (CUAS Project), the EU FP7 project SHERPA (grant agreement 600958), and Vinnova NFFP6 Project 2013-01206.


  1. 1.
    Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49(1–3), 61–95 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Vidal, T., Ghallab, M.: Dealing with uncertain durations in temporal constraint networks dedicated to planning. In: Proceedings of ECAI (1996)Google Scholar
  3. 3.
    Muscettola, N., Morris, P., Tsamardinos, I.: Reformulating temporal plans for efficient execution. In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR) (1998)Google Scholar
  4. 4.
    Morris, P., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: Proceedings of IJCAI (2001)Google Scholar
  5. 5.
    Morris, P., Muscettola, N.: Temporal dynamic controllability revisited. In: Proceedings of AAAI (2005)Google Scholar
  6. 6.
    Morris, P.: A structural characterization of temporal dynamic controllability. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 375–389. Springer, Heidelberg (2006) CrossRefGoogle Scholar
  7. 7.
    Morris, P.: Dynamic controllability and dispatchability relationships. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 464–479. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  8. 8.
    Stedl, J., Williams, B.: A fast incremental dynamic controllability algorithm. In: Proceedings of ICAPS Workshop on Plan Execution (2005)Google Scholar
  9. 9.
    Shah, J.A., Stedl, J., Williams, B.C., Robertson, P.: A fast incremental algorithm for maintaining dispatchability of partially controllable plans. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS) (2007).
  10. 10.
    Nilsson, M., Kvarnström, J., Doherty, P.: Incremental dynamic controllability revisited. In: Proceedings of ICAPS (2013)Google Scholar
  11. 11.
    Nilsson, M., Kvarnström, J., Doherty, P.: Classical dynamic controllability revisited: a tighter bound on the classical algorithm. In: Proceedings of ICAART (2014)Google Scholar
  12. 12.
    Stedl, J.L.: Managing temporal uncertainty under limited communication: a formal model of tight and loose team coordination. Master’s thesis, Massachusetts Institute of Technology (2004)Google Scholar
  13. 13.
    Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education, Boston (2001)zbMATHGoogle Scholar
  14. 14.
    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 AAAI (2014)Google Scholar
  15. 15.
    Cesta, A., Finzi, A., Fratini, S., Orlandini, A., Tronci, E.: Analyzing flexible timeline-based plans. In: Proceedings of ECAI (2010)Google Scholar
  16. 16.
    Nilsson, M., Kvarnström, J., Doherty, P.: EfficientIDC: a faster incremental dynamic controllability algorithm. In: Proceedings of ICAPS (2014)Google Scholar
  17. 17.
    Hunsberger, L.: A fast incremental algorithm for managing the execution of dynamically controllable temporal networks. In: Proceedings of TIME (2010)Google Scholar
  18. 18.
    Hunsberger, L.: A faster execution algorithm for dynamically controllable STNUs. In: Proceedings of TIME, pp. 26–33. IEEE (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Mikael Nilsson
    • 1
    Email author
  • Jonas Kvarnström
    • 1
  • Patrick Doherty
    • 1
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden

Personalised recommendations