Conference Proceedings

Simplified Computation and Generalization of the Refined Process Structure Tree

Artem Polyvyanyy, Jussi Vanhatalo, Hagen Voelzer, M Bravetti, T Bultan

WEB SERVICES AND FORMAL METHODS | SPRINGER-VERLAG BERLIN | Published : 2011

Abstract

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. ..

View full abstract