-
1.
公开(公告)号:US20070055558A1
公开(公告)日:2007-03-08
申请号:US11506844
申请日:2006-08-21
Applicant: James Shanahan , Ricardo Silva , Jiji Zhang
Inventor: James Shanahan , Ricardo Silva , Jiji Zhang
IPC: G06F17/50
CPC classification number: G06Q10/06 , G06Q10/06316 , G06Q10/0633
Abstract: 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.
Abstract translation: 描述了用于从过程的经验数据生成工作流图的方法和处理系统。 获得一个进程的多个实例的数据,该数据包括关于任务排序的信息。 处理系统分析任务的出现以识别订单约束。 表示任务的一组节点被划分成一系列子集,其中给定子集的任何节点在给定子集的任何其他节点之前不被约束,除非所述一对节点有条件地独立于给定一个或多个紧邻的子集中的一个或多个节点 ,并且使得以下子集的任何节点不被约束到给定子集的任何节点之前。 每个子集的节点基于订单约束并基于应用于节点子集的条件独立性测试,连接到具有边的每个相邻子集的节点,从而提供工作流图。