公开(公告)号：GB2466344A

公开(公告)日：2010-06-23

申请号：GB0920057

申请日：2009-11-17

Applicant: IBM

Inventor： MOSER SIMON ,  GSCHWIND THOMAS ,  SCHULZE THOMAS ,  VANHATALO JUSSI ,  VOELZER HAGEN

IPC: G06Q10/00

Abstract: Methods, systems and programs for refactoring a directed workflow graph are disclosed. A workflow graph containing at least one start node s, and at least one end node t, with a multitude of nodes x residing between s and t on a directed path is first completed into a two terminal graph with a single start node and end node (if necessary) and then decomposed into a set of canonical R-fragments (A-I). The workflow graph is then expanded by splitting (X1' X1" X2' X2") shared nodes (X1, X2) between R-fragments (D, E). An R-fragment is a connected subgraph such that an R fragment has exactly two boundary nodes. A boundary node (X1, X2) of an R Fragment is a node of the fragment that has at least two edges incident to this node, one of which belongs to the fragment, while the other does not. Tests of a directed graph with multiple end nodes or of its expanded form or of R-fragments are generated and IOR joins are substituted with AND or XOR joins.