Declarative Modeling–An Academic Dream or the Future for BPM?

Reijers, Hajo A.; Slaats, Tijs; Stahl, Christian

doi:10.1007/978-3-642-40176-3_26

Cited by 64 publications

(46 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Likewise, regarding the recent interest in modeling languages that combine declarative and imperative modeling constructs [55], appropriate training seems essential. This finding is particularly relevant, as it was found that within imperative modeling languages-particularly EPC and BPMN-it does not matter which modeling language is taught [51].…”

Section: R Q 31 : Are Modeling Experience and Education Connected Tomentioning

confidence: 99%

Understanding Declare models: strategies, pitfalls, empirical results

et al. 2014

View full text Add to dashboard Cite

Declarative approaches to business process modeling are regarded as well suited for highly volatile environments, as they enable a high degree of flexibility. However, problems in understanding and maintaining declarative process models often impede their adoption. Likewise, little research has been conducted into the understanding of declarative process models. This paper takes a first step toward addressing this fundamental question and reports on an empirical investigation consisting of an exploratory study and a follow-up study focusing on the system analysts' sense-making of declarative process models that are specified in Declare. For this purpose, we distributed real-world Declare models to the participating subjects and asked them to describe the illustrated process and to perform a series of sense-making tasks. The results of our studies indicate that two main strategies for reading Declare models exist: either considering the execution order of the activities in the process model, or orienting by the layout of the process model. In addition, the results indicate that single constraints can be handled well by most subjects, while combinations of constraints pose significant challenges. Moreover, the study revealed that aspects that are similar in both imperative and declarative process modeling languages at a graphical level, while having different semantics, cause considerable troubles. This research not only helps guiding the future development of tools for supporting system analysts, but also gives advice on the design of declarative process modeling notations and points out typical pitfalls to teachers and educators of future systems analysts.

show abstract

Section: R Q 31 : Are Modeling Experience and Education Connected Tomentioning

confidence: 99%

Understanding Declare models: strategies, pitfalls, empirical results

et al. 2014

View full text Add to dashboard Cite

show abstract

“…We also plan to follow up on experimental research comparing Petri nets and Declare [1,2]. Prior experiments in that regard shed light on the fact that the declarative modelling approach suffered from the lack of consistency and redundancy checks [76,71]. The notions defined in this paper help design declarative and procedural process models that are equally consistent and minimal, such that an unbiased comparison would be feasible.…”

Section: Resultsmentioning

confidence: 99%

“…They are not directly discussed from the perspective of consistency and redundancy [71], but can benefit from our work due to their grounding in Büchi automata [72]. Recently, De Smedt et al [73] have conducted extensive studies on the so-called "hidden dependencies" [74], i.e., on the generation of implicit constraints tying activities due to the interaction of other constraints explicitly defined in a process model.…”

Section: Related Workmentioning

confidence: 99%

Resolving inconsistencies and redundancies in declarative process models

Ciccio

Maggi

Montali

et al. 2017

Information Systems

View full text Add to dashboard Cite

Declarative process models define the behaviour of business processes as a set of constraints. Declarative process discovery aims at inferring such constraints from event logs. Existing discovery techniques verify the satisfaction of candidate constraints over the log, but completely neglect their interactions. As a result, the inferred constraints can be mutually contradicting and their interplay may lead to an inconsistent process model that does not accept any trace. In such a case, the output turns out to be unusable for enactment, simulation or verification purposes. In addition, the discovered model contains, in general, redundancies that are due to complex interactions of several constraints and that cannot be cured using existing pruning approaches. We address these problems by proposing a technique that automatically resolves conflicts within the discovered models and is more powerful than existing pruning techniques to eliminate redundancies. First, we formally define the problems of constraint redundancy and conflict resolution. Second, we introduce techniques based on the notion of automata-product monoid, which guarantees the consistency of the discovered models and, at * Corresponding author. E-mail address: claudio.di.ciccio@wu.ac.at Postal address: Vienna University of Economics and Business, Institute for Information Business (Building D2, Entrance C) -Welthandelsplatz 1, A-1020 Vienna, Austria Phone number: +43 1 31336 5222Email addresses: claudio.di.ciccio@wu.ac.at (Claudio Di Ciccio), f.m.maggi@ut.ee (Fabrizio Maria Maggi), montali@inf.unibz.it (Marco Montali), jan.mendling@wu.ac.at (Jan Mendling) Preprint submitted to Information Systems 7th October 2016 the same time, keeps the most interesting constraints in the pruned set. The level of interestingness is dictated by user-specified prioritisation criteria. We evaluate the devised techniques on a set of real-world event logs.

show abstract

“…Recent research has again put into evidence synergies between imperative and declarative approaches [19,21]. Accordingly, hybrid process modelling notations have been proposed.…”

Section: Hybrid Languagesmentioning

confidence: 99%

“…By contrast, for parts of the process that are highly structured, an imperative description is preferable: for these parts, it is simpler to describe the limited behaviour that is allowed than the more numerous situations that are to be excluded. In previous work [21], we presented evidence for the prevalence of business processes that contain both structured and unstructured parts, an insight that followed from a workshop with BPM professionals. The involved professionals indicated that a hybrid process modelling technique would indeed be more attractive than a purely declarative or imperative one.…”

Section: Introductionmentioning

confidence: 99%

The Semantics of Hybrid Process Models

Slaats

Schunselaar

Maggi

et al. 2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The semantics of hybrid process models Slaats, Tijs; Schunselaar, Dennis M. M.; Maggi, Fabrizio M.; Reijers, Hajo A. Abstract. In the area of business process modelling, declarative notations have been proposed as alternatives to notations that follow the dominant, imperative paradigm. Yet, the choice between an imperative or declarative style of modelling is not always easy to make. Instead, a mixture of these styles is sometimes preferable. This observation has underpinned recent calls for so-called hybrid process modelling notations.In this paper, we present a formal semantics for these. In our proposal, a hybrid process model is hierarchical, where each of its sub-processes may be specified in either an imperative or declarative fashion. The semantics we provide will allow modelling communities to build on the benefits of existing imperative and declarative modelling notations, instead of spending their energy on inventing new ones.

show abstract

Declarative Modeling–An Academic Dream or the Future for BPM?

Cited by 64 publications

References 18 publications

Understanding Declare models: strategies, pitfalls, empirical results

Understanding Declare models: strategies, pitfalls, empirical results

Resolving inconsistencies and redundancies in declarative process models

The Semantics of Hybrid Process Models

Contact Info

Product

Resources

About