Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

Hildebrandt, Thomas; Mukkamala, Raghava Rao

doi:10.4204/eptcs.69.5

Cited by 140 publications

(82 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently similar generalizations were proposed for event modeling in the formalism of DCR-Graphs [21]. DCR-Graphs employ two relations between events, condition (the same as the causality relation in prime event structures) and response, that correspond to our subfeature and mandatoriness relations, respectively.…”

Section: Feature Vs Event-based Concurrency Modelingmentioning

confidence: 99%

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Diskin¹,

Safilian²,

Maibaum³

et al. 2016

SACS

View full text Add to dashboard Cite

Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories. We discuss a major deficiency of this semantics, and show that it can be fixed by considering a product to be an instantiation process rather than its final result. We call intermediate states of this process partial products, and argue that what a feature model really defines is a poset of its partial products. We argue that such structures can be viewed as special Kripke structure that we call partial product Kripke structures, ppKS. To specify these Kripke structures, we propose a CTL-based logic, called partial product CTL, ppCTL. We show how to represent a feature model M by a ppCTL theory ML(M ) (ML stands for modal logic) such that any ppKS satisfying the theory is equal to the partial product line determined by M . Hence, ML(M ) can be considered a sound and complete representation of M . We also discuss several applications of the modal logic view in feature modeling, including refactoring of feature models.

show abstract

Section: Feature Vs Event-based Concurrency Modelingmentioning

confidence: 99%

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Diskin¹,

Safilian²,

Maibaum³

et al. 2016

SACS

View full text Add to dashboard Cite

show abstract

“…For this investigation, we have focused on the declarative modeling language Declare. Recently, also Dynamic Condition Response (DCR) graphs [21] have gained increasing interest. Unlike Declare, DCR graphs focus on a set of core constraints instead of allowing for the specification of arbitrary constraints.…”

Section: Related Workmentioning

confidence: 99%

Investigating Differences between Graphical and Textual Declarative Process Models

Haisjackl

Zugal

2014

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Abstract. 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 declarative process models often impede their adoption. Particularly, a study revealed that aspects that are present in both imperative and declarative process modeling languages at a graphical level-while having different semantics-cause considerable troubles. In this work we investigate whether a notation that does not contain graphical lookalikes, i.e., a textual notation, can help to avoid this problem. Even though a textual representation does not suffer from lookalikes, in our empirical study it performed worse in terms of error rate, duration and mental effort, as the textual representation forces the reader to mentally merge the textual information. Likewise, subjects themselves expressed that the graphical representation is easier to understand.

show abstract

“…Some competing approaches exist such as DCR Graphs [16], which are comparable to a slimmeddown version of Declare for improving understandability and setup, and the more data-oriented language Guard-Stage Milestone [17]. Declare and its understandability has been researched for a test case-driven approach [4], the impact of hierarchies [1], and its common understandability challenges [2].…”

Section: Related Workmentioning

confidence: 99%

“…During this procedure, all incoming Existence and Choice constraints (as in 2) are stored as well (Algorithm 2, lines [16][17][18]. They also need to be fulfilled, but do not propagate due to their unary nature.…”

Section: Constructionmentioning

confidence: 99%

Improving Understandability of Declarative Process Models by Revealing Hidden Dependencies

Smedt

Weerdt

Serral

et al. 2016

Advanced Information Systems Engineering

View full text Add to dashboard Cite

Abstract. 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 allowed 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.

show abstract

Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

Cited by 140 publications

References 23 publications

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Faithful Modeling of Product Lines with Kripke Structures and Modal Logic

Investigating Differences between Graphical and Textual Declarative Process Models

Improving Understandability of Declarative Process Models by Revealing Hidden Dependencies

Contact Info

Product

Resources

About