A Simple Temporal Network (STN) consists of time points modeling temporal events and constraints modeling the minimal and maximal temporal distance between them. A Simple Temporal Network with Decisions (STND) extends an STN to model temporal plans with decisions. STNDs label time points and constraints by conjunctions of literals saying for which scenarios (i.e., complete truth value assignments to the propositions) they are relevant. In this paper, we deal with the use of STNDs for modeling and synthesizing execution strategies. We propose an incremental hybrid SAT-based consistency checking algorithm for STNDs that is faster than the one previously proposed and allows for the synthesis of all consistent scenarios and related early execution schedules (offline temporal planning). We carry out an experimental evaluation with Kappa, a tool that we developed for STNDs. We also show that any STND can be easily translated into a disjunctive temporal network and vice versa.

一个简单的时间网络 (STN) 由建模时间事件的时间点和建模它们之间的最小和最大时间距离的约束组成。带有决策的简单时间网络 (STND) 扩展了 STN 以对带有决策的时间计划进行建模。STND 通过文字的连接来标记时间点和约束，说明它们与哪些场景（即，对命题的完整真值分配）相关。在本文中，我们处理使用 STND 建模和综合执行策略。我们为 STND 提出了一种基于增量混合 SAT 的一致性检查算法，该算法比之前提出的算法更快，并允许综合所有一致的场景和相关的早期执行计划（离线时间规划）。我们用 Kappa 进行实验评估，我们为 STND 开发的工具。我们还表明，任何 STND 都可以轻松转换为分离的时间网络，反之亦然。