Improving Understandability of Declarative Process Models by Revealing Hidden Dependencies

Declarative process models have become a mature alternative to procedural ones. Instead of focusing on what has to happen, they rather follow an outside-in approach based on a rule base containing different types of constraints. The models are well-capable of representing flexible behavior, as everything that is not forbidden by the constraints in the model is possible during execution. These models, however, are more difficult to comprehend and require a higher mental effort of both the modeler and the reader. Since constraints can be added freely to the model, it is often overseen what impact the combination of them has. This is often referred to as hidden dependencies. This paper proposes a methodology to make these dependencies explicit for the declarative process modeling language Declare by considering a Declare model as a graph and relying on the constraints’ characteristics. Moreover, this paper also contributes by empirically confirming that a tool that can visualize hidden dependency information on top of a Declare model has a significant positive impact on the understandability of Declare models.

[1]  Massimo Mecella,et al.  A two-step fast algorithm for the automated discovery of declarative workflows , 2013, 2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).

[2]  Wil M. P. van der Aalst,et al.  DECLARE: Full Support for Loosely-Structured Processes , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[3]  Johannes De Smedt,et al.  Fusion Miner: Process discovery for mixed-paradigm models , 2015, Decis. Support Syst..

[4]  Geert Poels,et al.  Mixed-Paradigm Process Modeling with Intertwined State Spaces , 2016, Bus. Inf. Syst. Eng..

[5]  Johannes De Smedt,et al.  Gamification of Declarative Process Models for Learning and Model Verification , 2016, Business Process Management Workshops.

[6]  Wil M. P. van der Aalst,et al.  A Declarative Approach for Flexible Business Processes Management , 2006, Business Process Management Workshops.

[7]  Raghava Rao Mukkamala,et al.  Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs , 2011, PLACES.

[8]  Marco Montali,et al.  Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness , 2014, AAAI.

[9]  Jan Mendling,et al.  Assessing the Impact of Hierarchy on Model - A Cognitive Perspective , 2011, EESSMod.

[10]  Alessandro Sperduti,et al.  Techniques for a Posteriori Analysis of Declarative Processes , 2012, 2012 IEEE 16th International Enterprise Distributed Object Computing Conference.

[11]  Wil M. P. van der Aalst,et al.  DecSerFlow: Towards a Truly Declarative Service Flow Language , 2006, WS-FM.

[12]  Barbara Weber,et al.  The Impact of Testcases on the Maintainability of Declarative Process Models , 2011, BMMDS/EMMSAD.

[13]  M Maja Pesic,et al.  Constraint-based workflow management systems : shifting control to users , 2008 .

[14]  Wil M. P. van der Aalst,et al.  A Knowledge-Based Integrated Approach for Discovering and Repairing Declare Maps , 2013, CAiSE.

[15]  Hajo A. Reijers,et al.  UnconstrainedMiner: Efficient Discovery of Generalized Declarative Process Models , 2013 .

[16]  Richard Hull,et al.  Introducing the Guard-Stage-Milestone Approach for Specifying Business Entity Lifecycles , 2010, WS-FM.

[17]  Jan Mendling,et al.  The Effect of Noise on Mined Declarative Constraints , 2013, SIMPDA.

[18]  Marco Montali,et al.  Monitoring Business Constraints with Linear Temporal Logic: An Approach Based on Colored Automata , 2011, BPM.

[19]  Paola Mello,et al.  Declarative specification and verification of service choreographiess , 2010, TWEB.

[20]  Manfred Reichert,et al.  Making Sense of Declarative Process Models: Common Strategies and Typical Pitfalls , 2013, BMMDS/EMMSAD.

[21]  Fabrizio Maria Maggi,et al.  Declare: A Tool Suite for Declarative Workflow Modeling and Enactment , 2011, BPM.