A Conditional Simple Temporal Network with Uncertainty and Decisions (CSTNUD) is a formalism for temporal plans that models controllable and uncontrollable durations as well as controllable and uncontrollable choices simultaneously. In the classic top-down model-based engineering approach, a designer builds CSTNUDs to model, validate and execute some temporal plans of interest. In this paper, we investigate a bottom-up approach by providing a deterministic polynomial time algorithm to mine a CSTNUD from a set of execution traces (i.e., a log). We provide a prototype implementation and we test it with a set of artificial data. Finally, we elaborate on consistency and controllability of mined networks.

具有不确定性和决策的条件简单时间网络 (CSTNUD) 是时间计划的形式主义，它同时对可控和不可控的持续时间以及可控和不可控的选择进行建模。在经典的自顶向下基于模型的工程方法中，设计人员构建 CSTNUD 来建模、验证和执行一些感兴趣的时间计划。在本文中，我们通过提供确定性多项式时间算法从一组执行跟踪（即日志）中挖掘CSTNUD 来研究一种自底向上的方法。我们提供了一个原型实现，并使用一组人工数据对其进行了测试。最后，我们详细阐述了挖掘网络的一致性和可控性。