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 (LTLp f). To mine them out of event logs, we devise a time bi-directional 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.

Interestingness of traces in declarative process mining: The janus LTLPf Approach / Cecconi, Alessio; Di Ciccio, Claudio; De Giacomo, Giuseppe; Mendling, Jan. - 11080:(2018), pp. 121-138. (Intervento presentato al convegno 16th International Conference on Business Process Management, BPM 2018 tenutosi a Sydney; Australia) [10.1007/978-3-319-98648-7_8].

Interestingness of traces in declarative process mining: The janus LTLPf Approach

Di Ciccio, Claudio
;
De Giacomo, Giuseppe
;
2018

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 (LTLp f). To mine them out of event logs, we devise a time bi-directional 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.
2018
16th International Conference on Business Process Management, BPM 2018
Automata theory; Declarative processes; Process mining; Separation theorem; Temporal logics; Theoretical Computer Science; Computer Science (all)
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Interestingness of traces in declarative process mining: The janus LTLPf Approach / Cecconi, Alessio; Di Ciccio, Claudio; De Giacomo, Giuseppe; Mendling, Jan. - 11080:(2018), pp. 121-138. (Intervento presentato al convegno 16th International Conference on Business Process Management, BPM 2018 tenutosi a Sydney; Australia) [10.1007/978-3-319-98648-7_8].
File allegati a questo prodotto
File Dimensione Formato  
Cecconi_Postprint_Interestingness_2018.pdf

accesso aperto

Note: https://link.springer.com/chapter/10.1007%2F978-3-319-98648-7_8
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.31 MB
Formato Adobe PDF
1.31 MB Adobe PDF
Cecconi_Interestingness_2018.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 790.9 kB
Formato Adobe PDF
790.9 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1182871
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 13
social impact