Dynamic storage and retrieval of process graphs representative of business processes and extraction of formal process models therefrom
First Claim
Patent Images
1. A computer-implemented method for modeling a process, comprising:
- receiving a plurality of graphs representing a business process at a plurality of different times wherein for each graph, process steps of the business process are represented as nodes, edges connecting pairs of nodes represent transitions between process steps, and thicknesses of the edges reflect frequencies of the transitions between the process steps;
calculating a numeric value representative of graph appearance for each of the plurality of received graphs based on the nodes, edges, and edge thicknesses using a distance function that computes a measure of dissimilarity between two graphs of the plurality of graphs;
storing each of the plurality of received graphs within a tree-like data structure according to its corresponding numeric value;
determining a measure of dissimilarity between the process at each of the plurality of different times and a standard version of the process based on the plurality of received graphs stored in the tree-like data structure and a standard graph representing the standard version of the process; and
generating an alert when the determined measure of dissimilarities indicate that the business process has changed beyond a predetermined level within a set period of time,wherein each of the above steps is performed using a computer system, andwherein each of the received plurality of graphs is generated by automatically parsing one or more activity log files generated in the course of executing the one or more business processes by a plurality of computerized platforms involved in executing the one or more business processes.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system.
-
Citations
15 Claims
-
1. A computer-implemented method for modeling a process, comprising:
-
receiving a plurality of graphs representing a business process at a plurality of different times wherein for each graph, process steps of the business process are represented as nodes, edges connecting pairs of nodes represent transitions between process steps, and thicknesses of the edges reflect frequencies of the transitions between the process steps; calculating a numeric value representative of graph appearance for each of the plurality of received graphs based on the nodes, edges, and edge thicknesses using a distance function that computes a measure of dissimilarity between two graphs of the plurality of graphs; storing each of the plurality of received graphs within a tree-like data structure according to its corresponding numeric value; determining a measure of dissimilarity between the process at each of the plurality of different times and a standard version of the process based on the plurality of received graphs stored in the tree-like data structure and a standard graph representing the standard version of the process; and generating an alert when the determined measure of dissimilarities indicate that the business process has changed beyond a predetermined level within a set period of time, wherein each of the above steps is performed using a computer system, and wherein each of the received plurality of graphs is generated by automatically parsing one or more activity log files generated in the course of executing the one or more business processes by a plurality of computerized platforms involved in executing the one or more business processes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer-implemented method for modeling a process, comprising:
-
receiving a plurality of graph snapshots representing a dynamic business process at various instantaneous points in time, wherein for each snapshot, a sequence of process steps of the processes are represented as nodes, edges connecting pairs of nodes represent transitions between process steps, and thicknesses of the edges reflect frequencies of the transitions between the process steps; calculating a numeric value representative of graph appearance for each of the plurality of received snapshots based on the nodes, edges, and edge thicknesses using a distance function that computes a measure of dissimilarity between two graph snapshots of the plurality of graph snapshots; storing each of the plurality of received snapshots within a tree-like data structure according to its corresponding numeric value, wherein each of the above steps is performed using a computer system; determining a measure of dissimilarity between the process at each of the various instantaneous points of time and a standard version of the process based on the plurality of received snapshots stored in the tree-like data structure and a standard graph representing the standard version of the process; and generating an alert when the determined measure of dissimilarities indicate that the dynamic business process has changed beyond a predetermined level within a set period of time, wherein each of the received plurality of graphs is generated by automatically parsing one or more activity log files generated in the course of executing the dynamic business process by a plurality of computerized platforms involved in executing the dynamic business process. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A computer program product for modeling a process, the computer program product comprising:
-
a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising; computer readable program code configured to receive a plurality of graphs representing a business process at a plurality of different times wherein for each graph, process steps of the business process are represented as nodes, edges connecting pairs of nodes represent transitions between process steps, and thicknesses of the edges reflect frequencies of the transitions between the process steps; computer readable program code configured to calculate a numeric value representative of graph appearance for each of the plurality of received graphs based on the nodes, edges, and edge thicknesses; computer readable program code configured to store each of the plurality of received graphs within a tree-like data structure according to its corresponding numeric value; computer readable program code configured use a distance function to determine a measure of dissimilarity between the process at each of the plurality of different times and a standard version of the process based on the plurality of received graphs stored in the tree-like data structure and a standard graph representing the standard version of the process; and computer readable program code configured to generate an alert when the determined measure of dissimilarities indicate that the business process has changed beyond a predetermined level within a set period of time, wherein each of the received plurality of graphs is generated by automatically parsing one or more activity log files generated in the course of executing the one or more business processes by a plurality of computerized platforms involved in executing the one or more business processes.
-
Specification