Cecconi, Alessio, Di Ciccio, Claudio, De Giacomo, Giuseppe, Mendling, Jan, De Giacomo, Guiseppe. 2018. Interestingness of traces in declarative process mining: The Janus LTLpf approach. In Business Process Management - 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9-14, 2018, Proceedings, Hrsg. Mathias Weske, Marco Montali, Ingo Weber, Jan vom Brocke, 121-138. Sydney, Australia: Springer.

RIS

@INPROCEEDINGS{Cecconi2018,
title = {Interestingness of traces in declarative process mining: The Janus LTLpf approach},
author = {Alessio Cecconi and Claudio Di Ciccio and Giuseppe De Giacomo and Jan Mendling and Guiseppe De Giacomo},
publisher = {Springer},
year = {2018},
isbn = {978-3-319-98647-0},
address = {Sydney, Australia},
url = {https://doi.org/10.1007/978-3-319-98648-7_8},
publisher = {Springer},
language = {EN},
pages = {121-138},
series = {Business Process Management - 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9-14, 2018, Proceedings},
abstract = {Declarative process mining is the set of techniques aimed at extracting behavioural constraints from event logs. These constraints are inherently of a reactive nature, in that their activation restricts the occurrence of other activities. In this way, they are prone to the principle of ex falso quod libet: they can be satisfied even when not activated. As a consequence, constraints can be mined that are hardly interesting to users or even potentially misleading. In this paper, we build on the observation that users typically read and write temporal constraints as if-statements with an explicit indication of the activation condition. Our approach is called Janus, because it permits the specification and verification of reactive constraints that, upon activation, look forward into the future and backwards into the past of a trace. Reactive constraints are expressed using Linear-time Temporal Logic with Past on Finite Traces (LTLpf). To mine them out of event logs, we devise a time bidirectional valuation technique based on triplets of automata operating in an on-line fashion. Our solution proves efficient, being at most quadratic w.r.t. trace length, and effective in recognising interestingness of discovered constraints.},
}