Authors:
Nicolai Schützenmeier
;
Martin Käppel
;
Myriel Fichtner
and
Stefan Jablonski
Affiliation:
Institute for Computer Science, University of Bayreuth, Universitätsstraße 30, 95447 Bayreuth, Germany
Keyword(s):
Business Process Management, Declarative Process Management, Declare, Model Verification.
Abstract:
Modeling processes with declarative process models, i.e. sets of constraints which have to be satisfied throughout the whole process execution, allows for a great degree of flexibility in process execution. However, having a process specified by means of symbolic, textual or formal constraints comes along with the problem that it is often hard for humans to understand complicated interactions of constraints and overlook the entire process model without unintentionally neglecting important process details. Caused by these reasons, standard questions regarding process models, e.g. ”Can a running process instance still be completed successfully?”, can often only be answered with great computational and temporal effort or even not at all. In this paper we present an efficient scenario-based approach for declarative process models, which supports process modelers in checking process models for important and common scenarios which regularly occur when modeling declarative processes. We imp
lement our approach and show that the solutions for the scenarios can be computed within milliseconds even for real-life event logs. Furthermore, a user study conducted demonstrates that the error rate in understanding declarative process models is enormously reduced by using our implementation.
(More)