A method, apparatus, electronic device, and medium for comparing business processes

Abstract

This invention discloses a method, apparatus, electronic device, and medium for comparing business processes. The method includes acquiring multiple business processes, each containing multiple sequentially arranged business nodes; creating a node arrival set and an antecedent set for all business nodes of the multiple business processes; applying a sorting algorithm to obtain the arrangement order of the business nodes based on the node arrival set and antecedent set; and displaying the execution process of the business processes using a linear graph based on the order of the business nodes. This invention uses a linear graph to represent and compare the execution paths of business processes. Compared with business process diagrams and relation matrices, this method can not only display the overall overview of the business process but also show the differences in specific steps of the business execution path. Furthermore, the node sorting algorithm ensures that the display of the linear graph is the most concise, facilitating users to compare and analyze business processes.

Description

Technical Field

[0001] This invention relates to a method, apparatus, electronic device, and medium for comparing business processes, belonging to the field of process mining technology. Background Technology

[0002] Process mining technology can reconstruct the flowchart of a business process from the process logs of a business system, and use it to visualize the execution path of the business process. This makes it easier for enterprises to understand the actual execution process of the business process, so as to analyze, evaluate and improve the execution of the business process.

[0003] When comparing different execution paths of the same business process, methods such as business process diagrams and business node relationship matrices can be used. Business process diagrams can visually compare the overall overview of different execution paths, but they are not convenient for showing the exact relationships between business nodes; business node relationship matrices can accurately represent the dependencies between different business nodes, but they cannot show the overall picture of the business execution path. When conducting comparative analysis of business processes, a method is needed to compare and analyze different execution paths of the same business process, quickly identify and statistically analyze the differences in execution paths and their impact on the business. Summary of the Invention

[0004] The purpose of this invention is to overcome the shortcomings of the prior art and provide a method, apparatus, electronic device and medium for comparing business processes. It provides a visual representation of business process paths and enables convenient viewing and comparison of different execution paths of the same business process.

[0005] To achieve the above objectives, the present invention is implemented using the following technical solution:

[0006] In a first aspect, the present invention provides a method for comparing business processes, comprising:

[0007] Obtain multiple business processes, each containing multiple business nodes arranged in sequence;

[0008] Create a node arrival set and a preceding set for all business nodes of the multiple business processes;

[0009] Based on the node arrival set and the preceding set, a sorting algorithm is applied to obtain the order of the business nodes;

[0010] Based on the order of business nodes, a linear diagram is used to illustrate the execution process of the business process.

[0011] Furthermore, the node arrival set is the set of the next nodes adjacent to the business node in all business processes, and the node precedence set is the set of the previous nodes adjacent to the business node in all business processes.

[0012] Furthermore, based on the node arrival set and the preceding set, a sorting algorithm is applied to obtain the arrangement order of the business nodes, including:

[0013] Create three lists: a default list, a front-end list, and a back-end list. All business nodes are initially placed in the default list.

[0014] The first update step includes: for business nodes whose preceding set is empty, removing the business node from the default list, storing it in the front-end list, and deleting the business node from the preceding set and the arriving set of other business nodes;

[0015] The second update step includes: for business nodes whose arrival set is empty, removing the business node from the default list, storing it in the backend list, and deleting the business node from the arrival set of other business nodes;

[0016] Repeat the first update step and the second update step until the business nodes in the default list have no empty arrival set and no empty lookahead set;

[0017] Combine all business nodes that intersect with the reachable set and the preceding set into a virtual business node, recalculate the relationship between the other business nodes in the default list and the virtual business node, and update the reachable set and the preceding set of the node;

[0018] Execute the first update step and the second update step until there are no empty reachable sets and empty lookahead sets in the default list except for virtual business nodes;

[0019] Expand the virtual business node into the original business node, recalculate the preceding set and the arriving set of the business nodes in the default list, and execute the first update step and the second update step.

[0020] Move all business nodes from the default list to either the front list or the back list until the default list is empty; sort the nodes in the front list in ascending order and the nodes in the back list in descending order, then merge the sorted front list and back list to obtain the order of all nodes.

[0021] Furthermore, all nodes contained in the virtual business nodes that appear in all business processes are replaced with virtual nodes, and the arrival set and preceding set of all nodes are recalculated.

[0022] Secondly, the present invention provides an apparatus for comparing business processes, characterized in that it comprises:

[0023] The business process acquisition module is used to acquire multiple business processes, each of which contains multiple business nodes.

[0024] The node arrival set creation module is used to create node arrival sets and precedence sets for all business nodes of the multiple business processes.

[0025] The sorting module is used to obtain the order of business nodes by applying a sorting algorithm based on the node arrival set and the preceding set.

[0026] The execution process display module is used to display the execution process of a business process using a linear graph according to the order of business nodes.

[0027] Furthermore, in the node arrival set creation module, the node arrival set is the set of the next nodes adjacent to the business node in all business processes, and the node precedence set is the set of the previous nodes adjacent to the business node in all business processes.

[0028] Furthermore, the sorting module includes:

[0029] The list creation unit is used to create three lists: the default list, the front-end list, and the back-end list. All business nodes are initially placed in the default list.

[0030] The first update unit is used to remove a business node from the default list and store it in the front-end list if the preceding set is empty, and to delete the business node from the preceding set and the arriving set of other business nodes.

[0031] The second update unit is used to remove a business node from the default list and store it in the backend list for a business node whose arrival set is empty, and to delete the business node from the arrival set of other business nodes.

[0032] The first execution unit is used to repeatedly execute the first update unit and the second update unit until the business nodes in the default list have no empty arrival set and no empty lookahead set.

[0033] The third update unit is used to merge all business nodes that have intersections in the arrival set and the preceding set into a virtual business node, recalculate the relationship between other business nodes in the default list and the virtual business node, and update the node's reachable set and the preceding set;

[0034] The second execution unit is used to execute the first update step and the second update step until there are no empty reachable sets and empty lookahead sets in the default list except for virtual business nodes;

[0035] The third execution unit is used to expand the virtual business node into the original business node, recalculate the preceding set and the arriving set of the business nodes in the default list, and execute the first update step and the second update step.

[0036] The move unit is used to move all business nodes in the default list into the front-end list or the back-end list until the default list is empty.

[0037] The sorting unit is used to arrange the nodes of the front list in sequential order and the nodes of the back list in reverse order, and then merge the sorted front and back lists to obtain the order of all nodes.

[0038] Furthermore, it also includes a replacement unit, which is used to replace all nodes contained in the virtual business nodes that appear in all business processes with virtual nodes, and recalculate the arrival set and preceding set of all nodes.

[0039] Thirdly, the present invention provides an electronic device, including a processor and a storage medium;

[0040] The storage medium is used to store instructions;

[0041] The processor is configured to operate according to the instructions to perform the steps of the method according to any of the preceding claims.

[0042] Fourthly, the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the preceding methods.

[0043] Compared with existing technologies, the beneficial effects achieved by this invention are that it provides a method for representing the execution path of a business process. Compared with business process diagrams and business node relationship matrices, this linear diagram can not only show the overall execution process of the business process, but also show the differences in specific steps of the business execution path. Furthermore, the node sorting algorithm ensures that the display of the linear diagram is the most concise, allowing users to view the execution process of the actual business process from the perspective of a standard business process in an intuitive and accurate way. This facilitates users' understanding of the interrelationships between business nodes and enables them to compare and analyze business processes. Attached Figure Description

[0044] Figure 1 This is a flowchart of a method for comparing business processes provided in an embodiment of the present invention;

[0045] Figure 2 This is a business process diagram generated based on example data in an embodiment of the present invention.

[0046] Figure 3 This is a graph showing the node arrival set and feasible set obtained from example data in this embodiment of the invention.

[0047] Figure 4 This is a linear graph obtained without applying a node sorting algorithm in this embodiment of the invention;

[0048] Figure 5This is a linear graph obtained after applying a node sorting algorithm in an embodiment of the present invention. Detailed Implementation

[0049] The present invention will be further described below with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present invention, and should not be used to limit the scope of protection of the present invention.

[0050] Example 1

[0051] like Figure 1 As shown in the figure, this embodiment introduces a method for comparing business processes, including:

[0052] Obtain multiple business processes, each containing multiple business nodes arranged in sequence;

[0053] Create a node arrival set and a preceding set for all business nodes of the multiple business processes;

[0054] Based on the node arrival set and the preceding set, a sorting algorithm is applied to obtain the order of the business nodes;

[0055] Based on the order of business nodes, a linear diagram is used to illustrate the execution process of the business process.

[0056] The method for comparing business processes provided in this embodiment involves the following steps in its application:

[0057] S1, obtain multiple business processes, each of which contains multiple business nodes arranged in sequence;

[0058] Business process data is retrieved from the log files of the business system or the backend database. Each business process contains multiple sequentially arranged business nodes, representing the specific execution process of the business process. The business system can be enterprise software such as ERP and CRM, or it can be a local application or a web application. The business system runs on electronic devices, such as PCs, mobile phones, or tablets. Business process data can be stored as files or databases. Common file formats include CSV and JSON, and common databases include MySQL. Business process data contains many records, each with multiple attributes, the three most important of which are: timestamp, business number, and activity name. For simplicity, the business process data below shows activity names sorted by time, with each row representing the same business number.

[0059] The following is a simplified example of business process data:

[0060] D,B,A,F,C,E,G:10

[0061] D,B,A,D,B,A,F,C,E,G:5

[0062] D,B,A,F,C,E,C,E,G:8

[0063] D,B,A,D,B,A,F,C,E,C,E,G:3

[0064] Each line represents a business process, and the number following it represents the number of times the business process is executed. Taking the first line as an example, it means that the business process consists of seven nodes, and the execution order is D, B, A, F, C, E, G. This execution path appears 10 times.

[0065] Applying a process mining algorithm to the above example data, we obtain, as follows: Figure 2 The business process diagram shown is used to illustrate the overall execution of the business process.

[0066] S2, create a node arrival set and a precedence set for all business nodes of the multiple business processes;

[0067] In a business process, adjacent nodes represent the execution order of corresponding business steps. In a business process, the node preceding each node represents the previous execution step in the process; all preceding nodes for each node are represented using an antecedent set. Similarly, the node following each node represents the next execution step in the process; all following nodes for each node are represented using an arrival set. Using the example data above, the arrival set and antecedent set for each node are calculated, and the results are as follows: Figure 3 As shown;

[0068] S3, based on the node arrival set and the preceding set, apply a sorting algorithm to obtain the arrangement order of the business nodes;

[0069] 1. Create three lists: a default list, a front list, and a back list, and put all nodes into the default list;

[0070] 2. Locate nodes whose antecedent set is empty. These nodes have no preceding node and represent the start of a certain level of process. They should be placed before other nodes. Move these nodes from the default list to the preceding list.

[0071] 3. Locate nodes whose set is empty. These nodes have no subsequent node, representing the end of a certain level, and should be placed after other nodes. Move these nodes from the default list to the next list.

[0072] 4. Repeat steps 2 and 3, directly assuming that there are no nodes in the list that have an earlier set or an empty reach set;

[0073] 5. Check the nodes where the forward set and the arrival set of the default list intersect. Merge all these nodes into a virtual node and use this virtual node to replace the nodes that intersect. Recalculate the forward set and arrival set of the nodes in the default list. Repeat steps 2, 3, and 4.

[0074] 6. Restore the virtual nodes to the original nodes, recalculate the antecedent set and arrival set of the nodes in the default list, and repeat steps 2, 3, and 4 until the default list is empty.

[0075] 7. Sort the first part of the list in the order of insertion, and the second part of the list in reverse order of insertion.

[0076] And add it to the end of the list in front to get the sorting order of all nodes.

[0077] Using the example data above, and applying the sorting algorithm described above, the final node sorting result is: A, B, D, F, C, E, G.

[0078] S4 uses a linear diagram to illustrate the execution process of the business process according to the order of the business nodes.

[0079] The ordered business nodes are represented in a linear graph. The linear graph consists of two parts: the left side displays all nodes that appear in the business process, each node representing a business step. The business nodes are ordered according to the order of occurrence of the most common business paths to facilitate identification of standard business process execution. The right side of the linear graph displays multiple business execution paths from left to right, with directional arrows clearly indicating the execution order of the business nodes. Arrows conforming to the standard flow execution path are the shortest downward arrows; if there are step jumps, the arrows are longer; if the order deviates from the standard flow, the arrows are upward arrows. Figure 4 It is a linear diagram of the business process when sorted alphabetically. Figure 5 These are linear graphs sorted according to the sorting algorithm described above. They use exactly the same business process data, but... Figure 5 The presence of more short and medium-length arrows and fewer upward arrows better reflects the actual execution of business processes.

[0080] Example 2

[0081] This embodiment provides an apparatus for comparing business processes, including:

[0082] The business process acquisition module is used to acquire multiple business processes, each of which contains multiple business nodes.

[0083] The node arrival set creation module is used to create node arrival sets and precedence sets for all business nodes of the multiple business processes.

[0084] The sorting module is used to obtain the order of business nodes by applying a sorting algorithm based on the node arrival set and the preceding set.

[0085] The execution process display module is used to display the execution process of a business process using a linear graph according to the order of business nodes.

[0086] Specifically, in the node arrival set creation module, the node arrival set is the set of the next nodes adjacent to the business node in all business processes, and the node precedence set is the set of the previous nodes adjacent to the business node in all business processes.

[0087] Specifically, the sorting module includes:

[0088] The list creation unit is used to create three lists: the default list, the front-end list, and the back-end list. All business nodes are initially placed in the default list.

[0089] The first update unit is used to remove a business node from the default list and store it in the front-end list if the preceding set is empty, and to delete the business node from the preceding set and the arriving set of other business nodes.

[0090] The second update unit is used to remove a business node from the default list and store it in the backend list for a business node whose arrival set is empty, and to delete the business node from the arrival set of other business nodes.

[0091] The first execution unit is used to repeatedly execute the first update unit and the second update unit until the business nodes in the default list have no empty arrival set and no empty lookahead set.

[0092] The third update unit is used to merge all business nodes that have intersections in the arrival set and the preceding set into a virtual business node, recalculate the relationship between other business nodes in the default list and the virtual business node, and update the node's reachable set and the preceding set;

[0093] The second execution unit is used to execute the first update step and the second update step until there are no empty reachable sets and empty lookahead sets in the default list except for virtual business nodes;

[0094] The third execution unit is used to expand the virtual business node into the original business node, recalculate the preceding set and the arriving set of the business nodes in the default list, and execute the first update step and the second update step.

[0095] The move unit is used to move all business nodes in the default list into the front-end list or the back-end list until the default list is empty.

[0096] The sorting unit is used to arrange the nodes of the front list in sequential order and the nodes of the back list in reverse order, and then merge the sorted front and back lists to obtain the order of all nodes.

[0097] Specifically, it also includes a replacement unit, which is used to replace all nodes contained in the virtual business nodes that appear in all business processes with virtual nodes, and recalculate the arrival set and preceding set of all nodes.

[0098] Example 3

[0099] This embodiment provides an electronic device, including a processor and a storage medium;

[0100] The storage medium is used to store instructions;

[0101] The processor is configured to operate according to the instructions to perform the steps of the method according to any one of Embodiment 1.

[0102] Example 4

[0103] This embodiment provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the methods described in Embodiment 1.

[0104] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the technical principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A method for comparing business processes, characterized in that, include: Obtain multiple business processes, each containing multiple business nodes arranged in sequence; Create a node arrival set and a preceding set for all business nodes of the multiple business processes; Based on the node arrival set and the preceding set, a sorting algorithm is applied to obtain the order of the business nodes; Based on the order of business nodes, a linear diagram is used to illustrate the execution process of the business process; The step of obtaining the order of business nodes by applying a sorting algorithm based on the node arrival set and the preceding set includes: Create three lists: a default list, a front-end list, and a back-end list. All business nodes are initially placed in the default list. The first update step includes: for business nodes whose preceding set is empty, removing the business node from the default list, storing it in the front-end list, and deleting the business node from the preceding set and the arriving set of other business nodes; The second update step includes: for business nodes whose arrival set is empty, removing the business node from the default list, storing it in the backend list, and deleting the business node from the arrival set of other business nodes; Repeat the first update step and the second update step until the business nodes in the default list have no empty arrival set and no empty lookahead set; Combine all business nodes that intersect with the reachable set and the preceding set into a virtual business node, recalculate the relationship between the other business nodes in the default list and the virtual business node, and update the reachable set and the preceding set of the node; Execute the first update step and the second update step until there are no empty reachable sets and empty lookahead sets in the default list except for virtual business nodes; Expand the virtual business node into the original business node, recalculate the preceding set and the arriving set of the business nodes in the default list, and execute the first update step and the second update step. Move all business nodes in the default list to the front-end list or back-end list until the default list is empty; Arrange the nodes of the first segment list in sequential order and the nodes of the second segment list in reverse order. Merge the sorted first segment list and the second segment list to obtain the order of all nodes.

2. The method for comparing business processes according to claim 1, characterized in that, The node arrival set is the set of the next nodes adjacent to the business node in all business processes, and the node precedence set is the set of the previous nodes adjacent to the business node in all business processes.

3. The method for comparing business processes according to claim 1, characterized in that, Replace all nodes in the business process that are contained in the virtual business nodes with virtual nodes, and recalculate the arrival set and preceding set of all nodes.

4. An apparatus for comparing business processes, characterized in that, include: The business process acquisition module is used to acquire multiple business processes, each of which contains multiple business nodes arranged in sequence. The node arrival and preceding set creation module is used to create node arrival sets and preceding sets for all business nodes in all business processes; The sorting module is used to obtain the order of business nodes by applying a sorting algorithm based on the node arrival set and the preceding set. The execution process display module is used to display the execution process of a business process using a linear graph based on the order of business nodes. The sorting module includes: The list creation unit is used to create three lists: the default list, the front-end list, and the back-end list. All business nodes are initially placed in the default list. The first update unit is used to remove a business node from the default list and store it in the front-end list if the preceding set is empty, and to delete the business node from the preceding set and the arriving set of other business nodes. The second update unit is used to remove a business node from the default list and store it in the backend list for a business node whose arrival set is empty, and to delete the business node from the arrival set of other business nodes. The first execution unit is used to repeatedly execute the first update unit and the second update unit until the business nodes in the default list have no empty arrival set and no empty lookahead set. The third update unit is used to merge all business nodes that have intersections in the arrival set and the preceding set into a virtual business node, recalculate the relationship between other business nodes in the default list and the virtual business node, and update the node's reachable set and the preceding set; The second execution unit is used to execute the first update step and the second update step until there are no empty reachable sets and empty lookahead sets in the default list except for virtual business nodes; The third execution unit is used to expand the virtual business node into the original business node, recalculate the preceding set and the arriving set of the business nodes in the default list, and execute the first update step and the second update step. The move unit is used to move all business nodes in the default list into the front-end list or the back-end list until the default list is empty. The sorting unit is used to arrange the nodes of the front list in sequential order and the nodes of the back list in reverse order, and then merge the sorted front and back lists to obtain the order of all nodes.

5. The apparatus for comparing business processes according to claim 4, characterized in that, In the node arrival set creation module, the node arrival set is the set of the next nodes adjacent to the business node in all business processes, and the node precedence set is the set of the previous nodes adjacent to the business node in all business processes.

6. The apparatus for comparing business processes according to claim 4, characterized in that, It also includes a replacement unit, which is used to replace all nodes contained in the virtual business nodes that appear in all business processes with virtual nodes, and recalculate the arrival set and preceding set of all nodes.

7. An electronic device, characterized in that: Including processor and storage media; The storage medium is used to store instructions; The processor is configured to operate according to the instructions to perform the steps of the method according to any one of claims 1 to 3.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When executed by a processor, the program implements the steps of the method described in any one of claims 1 to 3.

Images