The Refined Process Structure Tree

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

doi:10.1007/978-3-540-85758-7_10

Cited by 150 publications

(162 citation statements)

References 8 publications

Supporting

Mentioning

161

Contrasting

Unclassified

Order By: Relevance

“…This searcher is similar to the distance doc searcher, except that it relies on the Refined Process Structure Tree (RPST) [9] for grouping activities. The RPST parses a process model into a hierarchy of fragments with a single entry node and a single exit node.…”

Section: Match Searchersmentioning

confidence: 99%

See 1 more Smart Citation

The ICoP Framework: Identification of Correspondences between Process Models

Weidlich

Dijkman

Mendling

2010

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

127

View full text Add to dashboard Cite

Abstract. Business process models can be compared, for example, to determine their consistency. Any comparison between process models relies on a mapping that identifies which activity in one model corresponds to which activity in another. Tools that generate such mappings are called matchers. This paper presents the ICoP framework, which can be used to develop such matchers. It consists of an architecture and re-usable matcher components. The framework enables the creation of matchers from the reusable components and, if desired, newly developed components. It focuses on matchers that also detect complex correspondences between groups of activities, where existing matchers focus on 1:1 correspondences. We evaluate the framework by applying it to find matches in process models from practice. We show that the framework can be used to develop matchers in a flexible and adaptable manner and that the resulting matchers can identify a significant number of complex correspondences.

show abstract

Section: Match Searchersmentioning

confidence: 99%

“…Consequently, they form a tree-structure, as illustrated in Fig. 4(b) (cf., [9]). We leverage the hierarchy of fragments in order to select the groups of activities that will be considered by the searcher.…”

Section: Match Searchersmentioning

confidence: 99%

The ICoP Framework: Identification of Correspondences between Process Models

Weidlich

Dijkman

Mendling

2010

Notes on Numerical Fluid Mechanics and Multidisciplinary Design

127

View full text Add to dashboard Cite

show abstract

“…The RPST [20,21] is a technique for detecting the structure of a workflow graph. A workflow graph can be parsed into a hierarchy of fragments with a single entry and a single exit, such that the RPST is a containment hierarchy of canonical fragments of the graph.…”

Section: The Refined Process Structure Treementioning

confidence: 99%

“…A workflow graph can be parsed into a hierarchy of fragments with a single entry and a single exit, such that the RPST is a containment hierarchy of canonical fragments of the graph. The RPST is unique for a given workflow graph and can be computed in linear time [20,21]. Although the RPST has been introduced for workflow graphs, the technique can be applied to other graph based behavioural models such as WF-systems in a straight-forward manner.…”

Section: The Refined Process Structure Treementioning

confidence: 99%

See 1 more Smart Citation

Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition

Weidlich

Polyvyanyy

Mendling

et al. 2010

Applications and Theory of Petri Nets

View full text Add to dashboard Cite

Abstract. Identification of behavioural contradictions is an important aspect of software engineering, in particular for checking the consistency between a business process model used as system specification and a corresponding workflow model used as implementation. In this paper, we propose causal behavioural profiles as the basis for a consistency notion, which capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities. Existing notions of behavioural equivalence, such as bisimulation and trace equivalence, might also be applied as consistency notions. Still, they are exponential in computation. Our novel concept of causal behavioural profiles provides a weaker behavioural consistency notion that can be computed efficiently using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S-or T-nets.

show abstract

A knowledge‐based approach to manage configurable business processes

Benallal

Barhamgi

Benslimane

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThis paper stresses out the struggle of organizations when managing multiple variants of the same business process. Each variant constitutes a response to structural and/or functional needs that overtime become unsustainable due to the multiplicity and complexity of these needs. To mitigate this struggle, a knowledge‐based approach for capturing these versions into a single configurable business process and splitting this process into fragments is discussed in the paper. The approach builds a configuration knowledge base to track the business process variability (ie, particularities of each business process variant). Variants are represented as a new configurable process structure tree resulting from fragmenting a business process. Implementation of the approach is, also, reported in this paper.

show abstract

The Refined Process Structure Tree

Cited by 150 publications

References 8 publications

The ICoP Framework: Identification of Correspondences between Process Models

The ICoP Framework: Identification of Correspondences between Process Models

Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition

A knowledge‐based approach to manage configurable business processes

Contact Info

Product

Resources

About