Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty

A Simple Temporal Network with Uncertainty (STNU) includes real-valued variables, called time-points; binary difference constraints on those and contingent links that represent actions uncertain durations. STNUs have been used for robot control, web-service composition, business processes. The most important property of an STNU is dynamic controllability (DC); algorithms checking this are DC-checking algorithms. algorithm the best worst-case time-complexity RUL¯ due to Cairo, Hunsberger Rizzi. Its complexity O(mn + k²n kn log n), where n number time-points, m constraints, k links. It expected cannot be improved upon. However, paper provides a new algorithm, RUL2021, improves its performance in practice by order magnitude, as demonstrated thorough empirical evaluation.