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.
@InProceedings{sciavicco_et_al:LIPIcs.TIME.2020.11, author = {Sciavicco, Guido and Zavatteri, Matteo and Villa, Tiziano}, title = {{Mining Significant Temporal Networks Is Polynomial}}, booktitle = {27th International Symposium on Temporal Representation and Reasoning (TIME 2020)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-167-2}, ISSN = {1868-8969}, year = {2020}, volume = {178}, editor = {Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.11}, URN = {urn:nbn:de:0030-drops-129792}, doi = {10.4230/LIPIcs.TIME.2020.11}, annote = {Keywords: Mining temporal constraints, cstnud, uncertainty, significant temporal network} }
Feedback for Dagstuhl Publishing