Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ic.2021.104773 | Information and Computation |
Keywords | DocType | Volume |
Mining temporal constraints,CSTNUD,Uncertainty,Significant temporal network | Journal | 281 |
ISSN | Citations | PageRank |
0890-5401 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Sciavicco | 1 | 56 | 4.91 |
| Matteo Zavatteri | 2 | 20 | 6.18 |
| Tiziano Villa | 3 | 1 | 0.69 |