Title: Gamification of declarative process models for learning and model verification
Authors: De Smedt, Johannes
De Weerdt, Jochen
Serral Asensio, Estefanía
Vanthienen, Jan
Issue Date: 2016
Publisher: Springer
Host Document: Business Process Management Workshops pages:432-443
Series Title: Lecture Notes in Business Information Processing
Conference: DeMiMoP ’15 workshop, co-located with the 13th International Conference on Business Process Management edition:2015 location:Innsbruck (Austria) date:31 August - 3 September 2015
Abstract: Recently, a surge in the use of declarative process models has been witnessed. These constraint-driven models excel at representing and enacting flexible and adaptable decision processes in application areas such as scheduling and workflow management. This work examines the intricacies of the most widespread declarative process language, Declare, which are commonly referred to as hidden dependencies. These dependencies typically increase the steepness of the learning curve of Declare models and making them explicit can lower the threshold for modelers to use Declare in a sense-making and intuitive way. This work proposes a way to gamify Declare models for novice users by annotating such models with extra constraint and dependency information, and feedback. Hence, it offers the ability of discovering Declare and its intricacies in a game-like fashion which lowers the threshold for learning these cognitively demanding models, as well as to use them for assessing modeling efforts by verifying that the desired behavior is present.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Research Center for Management Informatics (LIRIS), Leuven

Files in This Item:
File Description Status SizeFormat
DeMiMop15.pdfGamification of declarative process models for learning and model verification Published 196KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.