Enhancing Declarative Process Models with DMN Decision Logic

Abstract

Abstract. Modeling dynamic, human-centric, non-standardized and knowledgeintensive business processes with imperative process modeling approaches is very challenging. Declarative process modeling approaches are more appropriate for these processes, as they offer the run-time flexibility typically required in these cases. However, by means of a realistic healthcare process that falls in the aforementioned category, we demonstrate in this paper that current declarative approaches do not incorporate all the details needed. More specifically, they lack a way to model decision logic, which is important when attempting to fully capture these processes. We propose a new declarative language, Declare-R-DMN, which combines the declarative process modeling language Declare-R with the newly adopted OMG standard Decision Model and Notation. Aside from supporting the functionality of both languages, Declare-R-DMN also creates bridges between them. We will show that using this language results in process models that encapsulate much more knowledge, while still offering the same flexibility.

Developing GUI Applications in a Verified Setting

“…However, the advantage of our approach is that we prove such properties for the implementation of the GUI application directly, rather than for an abstracted model of it. Consider the healthcare process illustrated in Figure 1, which is adapted from [24]. The relevant part of the process is highlighted.…”

“…In Section 5.1, we present a case study based on a healthcare process adapted from the literature [24]. Processes in the healthcare domain are mostly datadriven (e.g.…”

“…patient data), include interactions with doctors (e.g. diagnosis), and are not easily modeled as finite state machines [26,24]. We demonstrate that by using dependent types, we can model such state-dependent systems with an infinite number of states.…”

Declarative GUIs

“…Process Models in the Healthcare Domain Healthcare processes have been specified using Declare [54], which is a declarative modeling language [73] for business processes based on human-readable diagrams. The Declare constraints are often embedded in LTL or finite automata theory.…”

“…In the current paper, in contrast to [19,54,56] and other approaches to process models, we apply formal verification using a theorem prover (Agda) and provide machine-checked proofs as safety guarantees. We have found only two papers using formal specifications: Debois [23] proves in Isabelle a general result that a certain labeling of events in a business logic guarantees orthogonality of events.…”