2026-07-23T12:01:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12979 2024-03-06T10:51:29Z ddc:004 open_access

Mining Significant Temporal Networks Is Polynomial Sciavicco, Guido Zavatteri, Matteo Villa, Tiziano Mining temporal constraints cstnud uncertainty significant temporal network 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Guido Sciavicco and Matteo Zavatteri and Tiziano Villa 2020 Is Part Of LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TIME.2020.11 urn:nbn:de:0030-drops-129792 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.11 eng https://creativecommons.org/licenses/by/3.0/legalcode