Di Ciccio, Claudio, Ekaputra, Fajar J., Cecconi, Alessio, Ekelhart, Andreas, Kiesling, Elmar. 2019. Finding Non-compliances with Declarative Process Constraints Through Semantic Technologies. In International Conference on Advanced Information Systems Engineering Forum, CAiSE 2019 Forum, Rome, Italy, Hrsg. Cinzia Cappiello, Marcela Ruiz, 60-74. Rome, Italy: Springer, Cham.

RIS

@INPROCEEDINGS{Di Ciccio2019,
title = {Finding Non-compliances with Declarative Process Constraints Through Semantic Technologies},
author = {Claudio Di Ciccio and Fajar J. Ekaputra and Alessio Cecconi and Andreas Ekelhart and Elmar Kiesling},
publisher = {Springer, Cham},
year = {2019},
address = {Rome, Italy},
url = {https://doi.org/10.1007/978-3-030-21297-1_6},
publisher = {Springer, Cham},
language = {EN},
pages = {60-74},
series = {International Conference on Advanced Information Systems Engineering Forum, CAiSE 2019 Forum, Rome, Italy},
abstract = {Business process compliance checking enables organisations to assess whether their processes fulfil a given set of constraints, such as regulations, laws, or guidelines. Whilst many process analysts still rely on ad-hoc, often handcrafted per-case checks, a variety of constraint languages and approaches have been developed in recent years to provide automated compliance checking. A salient example is Declare, a well-established declarative process specification language based on temporal logics. Declare specifies the behaviour of processes through temporal rules that constrain the execution of tasks. So far, however, automated compliance checking approaches typically report compliance only at the aggregate level, using binary evaluations of constraints on execution traces. Consequently, their results lack granular information on violations and their context, which hampers auditability of process data for analytic and forensic purposes. To address this challenge, we propose a novel approach that leverages semantic technologies for compliance checking. Our approach proceeds in two stages. First, we translate Declare templates into statements in SHACL, a graph-based constraint language. Then, we evaluate the resulting constraints on the graph-based, semantic representation of process execution logs. We demonstrate the feasibility of our approach by testing its implementation on real-world event logs. Finally, we discuss its implications and future research directions.},
}