The refined process structure tree

Vanhatalo, Jussi; Völzer, Hagen; Koehler, Jana

doi:10.1016/j.datak.2009.02.015

Cited by 223 publications

(93 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A method specifically tailored to untangling unstructured cyclic models and transforming them into structured BPEL models is presented in [10,12]. Finally, Polyvyanyy et al [25] provide a complete characterization of unstructured acyclic process models that are inherently unstructured, based on the RPST decomposition developed by Vanhatalo et al [33].…”

Section: Structuring Process Modelsmentioning

confidence: 99%

Understanding Business Process Models: The Costs and Benefits of Structuredness

Dumas

Rosa

Mendling

et al. 2012

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

View full text Add to dashboard Cite

Abstract. Previous research has put forward various metrics of business process models that are correlated with understandability. Two such metrics are size and degree of (block-)structuredness. What has not been sufficiently appreciated at this point is that these desirable properties may be at odds with one another. This paper presents the results of a twopronged study aimed at exploring the trade-off between size and structuredness of process models. The first prong of the study is a comparative analysis of the complexity of a set of unstructured process models from industrial practice and of their corresponding structured versions. The second prong is an experiment wherein a cohort of students was exposed to semantically equivalent unstructured and structured process models. The key finding is that structuredness is not an absolute desideratum vis-a-vis for process model understandability. Instead, subtle trade-offs between structuredness and other model properties are at play.

show abstract

Section: Structuring Process Modelsmentioning

confidence: 99%

Understanding Business Process Models: The Costs and Benefits of Structuredness

Dumas

Rosa

Mendling

et al. 2012

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

View full text Add to dashboard Cite

show abstract

“…The generic results for decomposition of graphs have been obtained by Johnson, Pearson, and Pingali in [22] and Tarjan and Valdes in [52]. Later Vanhatalo et al adapted these decomposition techniques for business processes [53,54]. We argue that both reduction techniques and decomposition techniques have the potential to support elimination and aggregation as the most prominent forms of abstraction.…”

Section: Bpma Related Papersmentioning

confidence: 88%

Business process model abstraction: a definition, catalog, and survey

Smirnov

Reijers

Weske

et al. 2012

Distrib Parallel Databases

108

View full text Add to dashboard Cite

The discipline of business process management aims at capturing, understanding, and improving work in organizations by using process models as central artifacts. Since business-oriented tasks require different information from such models to be highlighted, a range of abstraction techniques has been developed over the past years to manipulate overly detailed models. At this point, a clear understanding of what distinguishes these techniques and how they address real world use cases has not yet been established. In this paper we systematically develop, classify, and consolidate the use cases for business process model abstraction and present a case study to illustrate the value of this technique. The catalog of use cases that we present is based on a thorough evaluation of the state of the art, as well as on our cooperation with end users in the health insurance sector. It has been subsequently validated by experts from the consultancy and tool vendor domains. Based on our findings, we evaluate how the existing business process model abstraction approaches support the discovered use cases and reveal which areas are not adequately covered, as such providing an agenda for further research in this area. Communicated by Asuman Dogac. S. Smirnov ( ) · M. Weske

show abstract

“…As for the latter construct (structured loops), these are oriented at the widely adopted BPEL language. BPEL directly enforces such a structure; recent process graph parsing techniques can be applied to untangle loops and move them into sub-processes [82,92].…”

Section: Process Graphsmentioning

confidence: 99%

Beyond soundness: on the verification of semantic business process models

Weber

Hoffmann

Mendling

2010

Distrib Parallel Databases

View full text Add to dashboard Cite

The verification of control-flow soundness is well understood as an important step before deploying business process models. However, the control flow does not capture what the process activities actually do when they are executed. Semantic annotations offer the opportunity to take this into account. Inspired by semantic Web service approaches such as OWL-S and WSMO, we consider process models in which the individual activities are annotated with logical preconditions and effects, specified relative to an ontology that axiomatizes the underlying business domain. Verification then addresses the overall process behavior, arising from the interaction between control-flow and behavior of individual activities. To this end, we combine notions from the workflow community with notions from the AI actions and change literature. We introduce a formal execution semantics for annotated business processes. We point out four verification tasks that arise, concerning precondition/effect conflicts, reachability, and executability. We examine the borderline between classes of processes that can, or cannot, be verified in polynomial time. For precondition/effect conflicts, we show that the borderline is the same as that of the Communicated by Asuman Dogac.The major part of this work was conducted while the first and second authors worked for SAP Research, Karlsruhe. 272 Distrib Parallel Databases (2010) 27: 271-343 logic underlying the ontology axioms. For reachability and executability, we identify a class of processes that can be verified in polynomial time by a fixpoint algorithm which we design for that purpose. We show that this class of processes is maximal in the sense that, when generalizing it in any of the most relevant directions, the validation tasks become computationally hard.

show abstract

The refined process structure tree

Cited by 223 publications

References 5 publications

Understanding Business Process Models: The Costs and Benefits of Structuredness

Understanding Business Process Models: The Costs and Benefits of Structuredness

Business process model abstraction: a definition, catalog, and survey

Beyond soundness: on the verification of semantic business process models

Contact Info

Product

Resources

About