2026-07-21T11:56:03Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9779 2024-03-06T10:44:54Z ddc:004 open_access

Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty Hunsberger, Luke Posenato, Roberto Temporal Networks Conditional Simple Temporal Problem with Uncertainty Dynamic Controllability Checking Algorithm A Conditional Simple Temporal Network with Uncertainty (CSTNU) is a data structure for representing and reasoning about time. CSTNUs incorporate observation time-points from Conditional Simple Temporal Networks (CSTNs) and contingent links from Simple Temporal Networks with Uncertainty (STNUs). A CSTNU is dynamically controllable (DC) if there exists a strategy for executing its time-points that guarantees the satisfaction of all relevant constraints no matter how the uncertainty associated with its observation time-points and contingent links is resolved in real time. This paper presents the first sound-and-complete DC-checking algorithms for CSTNUs that are based on the propagation of labeled constraints and demonstrates their practicality. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Luke Hunsberger and Roberto Posenato 2018 Is Part Of LIPIcs, Volume 120, 25th International Symposium on Temporal Representation and Reasoning (TIME 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TIME.2018.14 urn:nbn:de:0030-drops-97795 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2018.14 eng https://creativecommons.org/licenses/by/3.0/legalcode