| 摘要 |
A method and processing system for generating a workflow graph from empirical data of a process are described. Data for multiple instances of a process are obtained, the data including information about task ordering. The processing system analyzes occurrences of tasks to identify order constraints. A set of nodes representing tasks is partitioned into a series of subsets, where no node of a given subset is constrained to precede any other node of the given subset unless said pair of nodes are conditionally independent given one or more nodes in an immediately preceding subset, and such that no node of a following subset is constrained to precede any node of the given subset. Nodes of each subset are connected to nodes of each adjacent subset with edges based upon the order constraints and based upon conditional independence tests applied to subsets of nodes, thereby providing a workflow graph.
|
