## The refined process structure tree

### Cached

### Download Links

- [user.enterpriselab.ch]
- [user.enterpriselab.ch]
- [user.enterpriselab.ch]
- [user.enterpriselab.ch]
- DBLP

### Other Repositories/Bibliography

Venue: | IBM Research Report RZ |

Citations: | 51 - 7 self |

### BibTeX

@ARTICLE{Vanhatalo_therefined,

author = {Jussi Vanhatalo and Hagen Völzer and Jana Koehler},

title = {The refined process structure tree},

journal = {IBM Research Report RZ},

year = {},

pages = {2008}

}

### OpenURL

### Abstract

Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a process modeled in a graph-based language such as BPMN into a process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modular and as fine as possible, where modular means that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes [11]. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan [3] that finds the triconnected components of a biconnected graph.

### Citations

171 |
Dividing A Graph into Triconnected Components
- Hopcroft, Tarjan
- 1973
(Show Context)
Citation Context .... It is based on and extends similar work for sequential programs by Tarjan and Valdes [11]. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan =-=[3]-=- that finds the triconnected components of a biconnected graph. Keywords. Workflow graph parsing, Control flow, Model decomposition, BPMN to BPEL translation/ roundtripping, Subprocess detection, Grap... |

64 | Analyzing Process Models using Graph Reduction Techniques - Sadiq, Orlowska |

59 | F.: Faster and more focused control-flow analysis for business process models through sese decomposition
- Vanhatalo, Völzer, et al.
- 2007
(Show Context)
Citation Context ...description (e.g. a BPMN diagram) into a block-based process description (e.g. BPEL process), but there are also other use cases for workflow graph parsing. For example, Vanhatalo, Völzer and Leymann =-=[14]-=- show how parsing speeds up control-flow analysis. Küster et al. [6] show how differences between two process models can be detected and resolved based on decompositions of these process models. We be... |

58 | The Program Structure Tree: Computing Control Regions in Linear Time - Johnson, Pearson, et al. - 1994 |

35 |
A linear time implementation of SPQRtrees
- Gutwenger, Mutzel
- 2001
(Show Context)
Citation Context ...ot. There are also fragments that are not component subgraphs, for instance, { j, k, l, m}. The precise definition of the triconnected components is rather lengthy and has therefore been omitted (see =-=[12, 2, 3]-=-). Instead we present here the exact relationship between the triconnected components and fragments we are going to exploit. The proofsof the following two theorems can be found in [12]. First, we ob... |

26 | Fully-automatic translation of open workflow net models into human-readable abstract BPEL processes, in: Modellierung 2008
- Lohmann, Kleine
(Show Context)
Citation Context ...whether the if-block or the repeat-until-block is found first by the parsing algorithm. One idea to resolve some of this nondeterminism is to define priorities on the syntactic categories to be found =-=[9, 7, 8]-=-. For example, if in each step the parsing algorithm tries to find sequences first, then if-blocks and then repeat-until-blocks, we can only obtain the parse in Fig. 1(a) in our example. However, this... |

15 | Ayesta, Parsing flowcharts and series-parallel graphs - Valdes - 1978 |

14 |
Detecting and Resolving Process Model Differences in the Absence of a Change Log
- Küster, Gerth, et al.
- 2008
(Show Context)
Citation Context ...ion (e.g. BPEL process), but there are also other use cases for workflow graph parsing. For example, Vanhatalo, Völzer and Leymann [14] show how parsing speeds up control-flow analysis. Küster et al. =-=[6]-=- show how differences between two process models can be detected and resolved based on decompositions of these process models. We believe that parsing also helps in understanding large processes and i... |

11 | Applying patterns during business process modeling - Gschwind, Koehler, et al. - 2008 |

9 |
Efficient Program Analysis Using Dependence Flow Graphs
- Johnson
- 1995
(Show Context)
Citation Context ...ems, a specification of the translation that is independent of the actual translation algorithm. A unique and modular decomposition is provided by the program structure tree defined by Johnson et al. =-=[4, 5]-=- for sequential programs. It was applied to workflow graphs by Vanhatalo et al. [14] to find control-flow errors. The corresponding decomposition for our first example is shown in Fig. 2. It uses the ... |

9 | WorkflowNet2BPEL4WS: A tool for translating unstructured workflow processes to readable BPEL
- Lassen, Aalst
(Show Context)
Citation Context ...whether the if-block or the repeat-until-block is found first by the parsing algorithm. One idea to resolve some of this nondeterminism is to define priorities on the syntactic categories to be found =-=[9, 7, 8]-=-. For example, if in each step the parsing algorithm tries to find sequences first, then if-blocks and then repeat-until-blocks, we can only obtain the parse in Fig. 1(a) in our example. However, this... |

8 | From BPMN Process Models to BPEL Web Services
- Ouyang, Dumas, et al.
(Show Context)
Citation Context ...y a local change and its parse. (e) Parse tree corresponding to (d). the same BPEL process. Consider, for example, the workflow graph in Fig. 1(a). The translation algorithm proposed by Ouyang et al. =-=[9]-=- is nondeterministic. It may produce one of the two parses shown in Fig. 1(a) and (b), depending on whether the if-block or the repeat-until-block is found first by the parsing algorithm. One idea to ... |

8 |
Prime Subprogram Parsing of a Program
- Tarjan, Valdes
- 1980
(Show Context)
Citation Context ... decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes =-=[11]-=-. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan [3] that finds the triconnected components of a biconnected graph. Keywords. Workflow graph... |

5 | Automatic workflow graph refactoring and completion - Vanhatalo, Völzer, et al. - 2008 |

1 |
Parsing flowcharts and series-parallel graphs
- Ayesta
- 1978
(Show Context)
Citation Context ...arent and all canonical fragments below the siblings of X. 3 Computing the PST In this section, we describe an algorithm that computes the PST in linear time. We have extended the algorithm by Valdes =-=[1]-=- to find all the canonical fragments (his algorithm produces a coarser decomposition, cf. Sect. 4). The algorithm has three high-level steps that are illustrated in Fig. 11 and described in Alg. 1. In... |

1 | Structural analysis of business process models using the process structure trees, to be submitted as a dissertation - Vanhatalo |

1 | ter Hofstede, W.M.P. van der Aalst, From BPMN process models to BPEL web services, in - Ouyang, Dumas, et al. |

1 | Prime subprogram parsing of a program, in: POPL ’80 - Tarjan, Valdes - 1980 |