Mining Significant Temporal Networks Is Polynomial

Abstract

A Conditional Simple Temporal Network with Uncertainty and Decisions (CSTNUD) is a formalism that tackles controllable and uncontrollable durations as well as controllable and uncontrollable choices simultaneously. In the classic top-down model-based engineering approach, a designer builds a CSTNUD to model, validate and execute some temporal plan of interest. Instead, in this paper, we investigate the bottom-up approach by providing a deterministic polynomial time algorithm to mine a CSTNUD from a set of execution traces (i.e., a log). This paper paves the way for the design of controllable temporal networks mined from traces that also contain information on uncontrollable events. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning; Information systems → Data mining; Computing methodologies → Planning and scheduling; Mathematics of computing → Graph algorithms