z-logo
open-access-imgOpen Access
A Structural Characterization of Temporal Dynamic Controllability
Author(s) -
Paul Morris
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-46267-8
DOI - 10.1007/11889205_28
Subject(s) - computer science , controllability , property (philosophy) , characterization (materials science) , temporal logic , temporal database , work (physics) , theoretical computer science , distributed computing , algorithm , data mining , mathematics , philosophy , materials science , epistemology , nanotechnology , mechanical engineering , engineering
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. Previous work has presented an O(N5) algorithm for testing this property. Here, we introduce a new analysis of temporal cycles that leads to an O(N4) algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom