Interestingness of traces in declarative process mining: The Janus LTLpf approach

Alessio Cecconi, Claudio Di Ciccio, Giuseppe De Giacomo, Jan Mendling, Guiseppe De Giacomo

Publication: Chapter in book/Conference proceedingContribution to conference proceedings


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.
Original languageEnglish
Title of host publicationBusiness Process Management - 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9-14, 2018, Proceedings
Editors Mathias Weske, Marco Montali, Ingo Weber, Jan vom Brocke
Place of PublicationSydney, Australia
Pages121 - 138
ISBN (Print)978-3-319-98647-0
Publication statusPublished - 2018

Austrian Classification of Fields of Science and Technology (ÖFOS)

  • 102022 Software development
  • 102
  • 102001 Artificial intelligence
  • 502
  • 502050 Business informatics

Cite this