Simplified Computation and Generalization of the Refined Process Structure Tree

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. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

[1]  Tharam S. Dillon,et al.  On the Move to Meaningful Internet Systems, OTM 2010 , 2010, Lecture Notes in Computer Science.

[2]  Robert E. Tarjan.  Prime subprogram parsing of a program , 1980, POPL '80.

[3]  Athman Bouguettaya,et al.  Service-Oriented Computing - ICSOC 2008, 6th International Conference, Sydney, Australia, December 1-5, 2008. Proceedings , 2008, ICSOC.

[4]  Richard Johnson.  Efficient program analysis using dependence flow graphs , 1995 .

[5]  Frank Leymann,et al.  Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition , 2007, ICSOC.

[6]  Zahir Tari,et al.  On the Move to Meaningful Internet Systems: OTM 2008 , 2008, Lecture Notes in Computer Science.

[7]  Mathias Weske,et al.  The Triconnected Abstraction of Process Models , 2009, BPM.

[8]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[9]  Priya Narasimhan,et al.  Service-Oriented Computing - ICSOC 2007, Fifth International Conference, Vienna, Austria, September 17-20, 2007, Proceedings , 2007, ICSOC.

[10]  T. Curran,et al.  SAP R/3 Business Blueprint: Understanding the Business Process Reference Model , 1997 .

[11]  Frank Leymann,et al.  Automatic Workflow Graph Refactoring and Completion , 2008, ICSOC.

[12]  Keshav Pingali,et al.  The program structure tree: computing control regions in linear time , 1994, PLDI '94.

[13]  M. Weske,et al.  Unveiling Hidden Unstructured Regions in Process Models , 2009, OTM Conferences.

[14]  Gregor Engels,et al.  Detecting and Resolving Process Model Differences in the Absence of a Change Log , 2008, BPM.

[15]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[16]  Dirk Fahland,et al.  Instantaneous Soundness Checking of Industrial Business Process Models , 2009, BPM.

[17]  Jana Koehler,et al.  The refined process structure tree , 2008, Data Knowl. Eng..

[18]  Jana Koehler,et al.  Applying Patterns during Business Process Modeling , 2008, BPM.

[19]  Jacobo Valdes.  Parsing Flowcharts and Series-Parallel Graphs , 1978 .

[20]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

[21]  Luciano García-Bañuelos.  Pattern Identification and Classification in the Translation from BPMN to BPEL , 2008, OTM Conferences.