Process restoration method and device, storage medium and computer program product

Abstract

The invention discloses a process restoration method and device, a storage medium and a computer program product, and relates to the technical field of process restoration, the method comprises the following steps: according to acquired business process data, generating an activity association combination, the activity association combination comprising a current activity node and an adjacent node of the current activity node, the connection sequences of the adjacent nodes of the current active nodes are the same; determining an activity node sequence according to each activity association combination; according to each activity association combination, determining an execution relationship between the current activity nodes; and according to the sequence of the active nodes and the execution relationship between the current active nodes, sorting the current active nodes to generate an active process instance. According to the method, the sequence of the active nodes is adjusted by judging the parallel execution relation between the active nodes, so that the real flow parallel condition is restored, and the accuracy of flow restoration is improved.

Description

Technical Field

[0001] The present application relates to the field of process mining technology, and in particular to a process restoration method, device, storage medium and computer program product. Background Art

[0002] With the rapid development of information technology, business process management has become one of the key means for enterprises to optimize operational efficiency and enhance competitiveness. In the field of business process management, the use of process restoration algorithms can visualize the business processes hidden in a large amount of log data, such as directed graphs (DFG).

[0003] However, with the increase in the complexity of business processes, when a single serial process restoration method restores business processes by analyzing live log data, facing the parallel structure of the process, it may incorrectly present the restored process as a serial process based on the sequence of execution time of the activity nodes. This makes it difficult to accurately restore the execution of the activity nodes in the actual process, and the accuracy of process restoration is reduced.

[0004] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are conventional technologies. Summary of the invention

[0005] The main purpose of this application is to provide a process restoration method, device, storage medium and computer program product, aiming to solve the technical problem of how to improve the accuracy of process restoration.

[0006] To achieve the above purpose, the present application proposes a process restoration method, which includes:

[0007] Generate an activity association combination according to the acquired business process data, wherein the activity association combination includes a current activity node and adjacent nodes of the current activity node, and the connection order of the adjacent nodes of each current activity node is the same;

[0008] Determine the activity node sequence according to the activity association combination;

[0009] Determine the execution relationship between the current activity nodes according to the activity association combinations, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship;

[0010] According to the activity node sequence and the execution relationship between the current activity nodes, the current activity nodes are sorted to generate an activity process instance.

[0011] In one embodiment, the step of generating an activity association combination according to the acquired business process data includes:

[0012] According to the process instance identifier of each activity node in the business process data, each activity node in the business process data is grouped to obtain an activity variant array and an adjacent activity sequence, wherein the activity variant array includes all current activity nodes with the same process instance identifier, and the adjacent activity sequence is a set of adjacent nodes corresponding to the current activity node in the activity variant array;

[0013] The adjacent nodes corresponding to each of the current activity nodes in the adjacent activity sequence are determined and associated to generate the activity association combination.

[0014] In one embodiment, before the step of generating the activity association combination, the method further includes:

[0015] The fields of each activity node in the business process data are converted into preset standard fields.

[0016] In one embodiment, the step of determining the order of activity nodes according to each of the activity association combinations includes:

[0017] In the case where the adjacent node of each current activity is the previous activity node, determining the current activity node in the activity association combination whose adjacent node is empty as the first node;

[0018] Determine the neighboring node as the current active node in the activity association combination of the first node as a downstream node of the first node;

[0019] The downstream node of the first node is re-determined as the first node, and the step of determining the adjacent node as the current active node in the activity association combination of the first node as the downstream node of the first node is performed until the downstream node of the first node is empty, and the active node order is determined.

[0020] In one embodiment, the step of determining the order of activity nodes according to each of the activity association combinations includes:

[0021] In the case where the adjacent nodes of each of the current activities are the next active nodes, determining the current active node in the activity association combination whose adjacent nodes are empty as the second node;

[0022] Determine the adjacent node as the current active node in the activity association combination of the second node as the upstream node of the second node;

[0023] The upstream node of the second node is re-determined as the second node, and the step of determining the adjacent node as the current active node in the activity association combination of the second node as the upstream node of the second node is performed until the upstream node of the second node is empty, and the active node order is determined.

[0024] In one embodiment, the step of sorting the current active nodes according to the active node sequence and the execution relationship of the current active nodes to generate an active process instance includes:

[0025] According to the execution relationship of each of the currently active nodes, the order of the active nodes is adjusted, wherein the order of nodes corresponding to the currently active nodes belonging to the parallel execution relationship is the same;

[0026] According to the adjusted activity node sequence, the current activity nodes are sorted to generate an activity process instance.

[0027] In one embodiment, after the step of generating the activity process instance, the method further includes:

[0028] Generates time metrics for the active process instance.

[0029] In addition, to achieve the above purpose, the present application also proposes a process restoration device, which includes:

[0030] An association module, configured to generate an activity association combination according to the acquired business process data, wherein the activity association combination includes a current activity node and adjacent nodes of the current activity node, and the connection order of the adjacent nodes of each current activity node is the same;

[0031] A sorting module, used to determine the order of activity nodes according to the activity association combinations;

[0032] A parallel determination module, used to determine the execution relationship between the current activity nodes according to the activity association combination, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship;

[0033] The generating module is used to sort the current activity nodes according to the activity node sequence and the execution relationship between the current activity nodes to generate an activity process instance.

[0034] In addition, to achieve the above-mentioned purpose, the present application also proposes a process restoration device, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the process restoration method described above.

[0035] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the process restoration method described above are implemented.

[0036] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the steps of the process restoration method described above are implemented.

[0037] The embodiment of the present application provides a process restoration method, which generates an activity association combination including a current active node and adjacent nodes of the current active node according to the acquired business process data, and the connection order of the adjacent nodes of each current active node is the same; by determining the activity association combination, the order between the two active nodes is clearly displayed, which is convenient for the subsequent determination of the order between the nodes included in the activity process and the execution relationship between the nodes; and then by determining the order of the activity nodes according to each activity association combination, it is avoided that the restored process instance layout is chaotic and the process paths are intertwined; according to each activity association combination, the execution relationship of each current active node is determined, wherein the current active nodes with the same adjacent nodes are in a parallel execution relationship; by clarifying the parallel execution relationship, it is possible to avoid the situation where parallel nodes are mistakenly identified as serial execution; and then according to the activity node order and the execution relationship of each current active node, each current active node is sorted to generate an activity process instance, highly restore the real path of the business process in the actual execution process, accurately restore the parallel execution of the process, thereby improving the accuracy of process restoration. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0039] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0040] Figure 1 A flowchart diagram of the first embodiment of the process restoration method of the present application;

[0041] Figure 2 A schematic diagram of a process example for restoring the sequence of active nodes without adjusting the sequence of active nodes provided in the second embodiment of the process restoration method of the present application;

[0042] Figure 3 A schematic diagram of a process instance for restoring after adjusting the order of active nodes provided in the first embodiment of the process restoration method of the present application;

[0043] Figure 4 This is a schematic diagram of the module structure of the process restoration device of the embodiment of the present application;

[0044] Figure 5 This is a schematic diagram of the device structure of the hardware operating environment involved in the process restoration method in the embodiment of the present application. DETAILED DESCRIPTION

[0045] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0046] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0047] The main solution of the embodiment of the present application is: based on the acquired business process data, generate an activity association combination, wherein the activity association combination includes the current activity node and the adjacent nodes of the current activity node, and the connection order of the adjacent nodes of each current activity node is the same; determine the activity node order according to each activity association combination; determine the execution relationship between each current activity node according to each activity association combination, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship; sort each current activity node according to the activity node order and the execution relationship between each current activity node to generate an activity process instance.

[0048] In this embodiment, for the convenience of description, the following description is made with the terminal as the execution subject.

[0049] Conventional technology mainly restores business processes by analyzing log data based on time series using algorithms. However, with the growth and development of business processes, parallel processing, conditional branches and loop structures are also widely used in business processes. Traditional linear process restoration methods are not sufficient for in-depth analysis and cannot accurately restore the parallel operations of the actual process. Due to the different execution times of active nodes, traditional process restoration methods may cause confusion in connections and restore parallel structures to serial structures or loop structures.

[0050] The present application provides a solution, which groups business process data according to process instance identifiers to obtain an array of activity variants and corresponding adjacent activity sequences for each process, thereby facilitating process path analysis for each process; then, the current activity node and the adjacent node are correspondingly associated to obtain an activity association combination, which clearly displays the connection relationship between the two nodes and facilitates parallel judgment and sorting operations; based on each activity association combination, the execution relationship between each current activity node is determined, wherein the current activity nodes with the same adjacent nodes belong to a parallel execution relationship, and by determining the parallel relationship between the nodes, unnecessary dependencies between parallel nodes are avoided; finally, based on the activity node sequence and the execution relationship between each current activity node, each current activity node is sorted to generate an activity process instance, and the sorting and restoration are performed according to the actual node sequence, and the parallel status of the activity is determined based on whether the adjacent activities of the node are the same, thereby avoiding incorrect sorting between parallel nodes, thereby improving the accuracy of process restoration.

[0051] It should be noted that the execution subject of this embodiment may be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of realizing the above functions, etc. The following takes the terminal as the execution subject as an example to illustrate this embodiment and the following embodiments.

[0052] Based on this, the present application embodiment provides a process restoration method, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the process restoration method of the present application.

[0053] In this embodiment, the process restoration method includes steps S10 to S40:

[0054] Step S10, generating an activity association combination according to the acquired business process data, wherein the activity association combination includes a current active node and adjacent nodes of the current active node, and the connection order of adjacent nodes of each current active node is the same;

[0055] It should be noted that business process data refers to a series of data sets generated during the execution of a business process, including the process instance identifier, timestamp, and subsequent activity nodes of each activity in the business process; activity association combination refers to a series of combinations consisting of two execution-related activity nodes constructed based on business process data.

[0056] In addition, it should be noted that an activity node refers to a node on a process instance that represents a specific process step, and there is a direct or indirect interaction relationship between activity nodes. The connection order refers to the order in which activity nodes are executed in the process; an adjacent node refers to an activity node that needs to be processed immediately after the current activity node according to the business process sequence, which can be the previous activity node or the next activity node.

[0057] Exemplarily, the order processing flow obtained includes activity nodes such as "order reception", "payment processing", "shipment" and "order completion". If the connection order is the forward execution order, the generated activity association combinations include "empty->order reception" and "order reception->payment processing" and so on.

[0058] Exemplarily, the acquired order processing flow includes activity nodes such as "order receipt", "payment processing", "shipment" and "order completion". If the connection order is the reverse execution order, the generated activity association combinations include "order completion <- empty" and "shipment <- order completion" etc.

[0059] Step S20, determining the activity node sequence according to the activity association combination;

[0060] It should be noted that the activity node sequence refers to the execution order of the activity nodes arranged according to a preset logical or time sequence.

[0061] According to the activity association combination, an initial node or an end node is determined, and the information of other nodes is obtained forward or backward in sequence. Since the activity association combination only contains the information of two activity nodes, the execution order of the activity nodes can be determined.

[0062] Exemplarily, according to the activity association combinations "empty->order reception", "order reception->payment processing" and "payment processing->shipping", it can be determined that "order reception", "payment processing" and "shipping" and the corresponding activity node orders are first, second and third respectively.

[0063] It can be understood that by analyzing the activity association combination, the logical relationship between the activity nodes in the business process is effectively restored, thereby improving the accuracy of process restoration.

[0064] Step S30, determining the execution relationship between the current activity nodes according to the activity association combination, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship;

[0065] It should be noted that the execution relationship refers to the execution order and dependency relationship between the various activity nodes in the process, including serial execution, parallel execution and conditional execution; the parallel execution relationship refers to the state in which multiple activity nodes can be executed simultaneously in time without interfering with each other, indicating that the activity nodes have no time dependency.

[0066] For example, there are two activity association combinations "AD2-Key Review and Administration <-AD3-AD3" and "AD2-Key Review and Administration <-AP2-Key Review and Verification". The adjacent nodes of the two current activity nodes "AD3-AD3" and "AP2-Key Review and Verification" are both "AD2-Key Review and Administration", and there is no connection relationship between the two. It is determined that the two current activity nodes are in a parallel execution relationship.

[0067] Step S40, sorting the current activity nodes according to the activity node sequence and the execution relationship between the current activity nodes to generate an activity process instance.

[0068] It should be noted that sorting refers to adjusting the order of nodes to ensure that the activity nodes are arranged in the correct order of business logic; an activity process instance refers to a specific execution of a business process, which includes all necessary activity nodes and their execution order.

[0069] For example, by sorting in the order of activity nodes, we get "AD2-Key Review Office->AD3-AD3->AP2-Key Review and Verification", but we get the information that "AD3-AD3" and "AP2-Key Review and Verification" are in a parallel execution relationship, remove the pointing information between the two, and get the execution relationship of "AD2-Key Review Office->AP2-Key Review and Verification" according to the sequence of activity nodes. The generated process instance branches at the "AD2-Key Review Office" node, and is arranged in parallel with the two adjacent activities without dependency.

[0070] This embodiment provides a process restoration method, which obtains a clear display of the execution relationship between adjacent nodes and the current active node by constructing activity association combinations; effectively sorts the active nodes by analyzing the activity association combinations, and avoids restoring the parallel execution to a serial execution relationship by judging the parallel situation between the active nodes, and clearly displays the different paths in the process, thereby improving the accuracy of process restoration.

[0071] In a feasible implementation manner, the step of generating an activity association combination according to the acquired business process data in step S10 includes:

[0072] Step S11, grouping each activity node in the business process data according to the process instance identifier of each activity node in the business process data to obtain an activity variant array and an adjacent activity sequence, wherein the activity variant array includes all current activity nodes with the same process instance identifier, and the adjacent activity sequence is a set of adjacent nodes corresponding to the current activity node in the activity variant array;

[0073] It should be noted that the process instance ID is a field used to uniquely identify a specific process instance and is used to distinguish the activity nodes of different process instances; grouping refers to the process of grouping activities with the same process instance ID together. The activity variant array refers to an array that merges all current activity nodes with the same process instance ID together, and is used to store information about activity nodes on different execution paths in the same process instance; the adjacent activity sequence refers to the set of previous and next activity nodes that are directly connected to the current activity node in the activity variant array, and is used to describe the logical order and dependency relationship between activity nodes.

[0074] Exemplarily, the activity nodes with process instance identification equal to 1 obtained include "order received", "payment processing", "shipping" and "order completed", so the obtained activity variant array includes "order received, payment processing, shipment, order completed", and for each activity therein, read the subsequent activity node field of the corresponding activity in the business process data, and fill in the adjacent activity sequence "payment processing, shipment, order completed, empty" according to the node order of the activity variant array.

[0075] Step S12: determine and associate the adjacent nodes corresponding to each current activity node in the adjacent activity sequence to generate an activity association combination.

[0076] It should be noted that association refers to establishing a sequential pointing relationship between the current active node and its adjacent nodes.

[0077] Exemplarily, find the post-node "shipping" of the "payment processing" node in the adjacent activity sequence, associate the two activity nodes, and place them in a forward sequential execution relationship, and the generated association combination is "payment processing->shipping".

[0078] In this implementation, by grouping the business process data, the activity nodes belonging to the same process instance can be found more quickly, and then the execution order of the activity nodes under the same process instance can be determined.

[0079] In a feasible implementation manner, before the step of generating the activity association combination in step S10, the following steps are further included:

[0080] Step S01: convert the fields of each activity node in the business process data into preset standard fields.

[0081] It should be noted that standard fields refer to a set of predefined data fields used to uniformly describe the attributes of activity nodes in a business process.

[0082] For example, the process instance identification field of each activity node in the business process data is businessId, which is converted into the preset standard field case_id; the activity field of each activity node is node, which is converted into the standard field activity; other tags are similar, so they are not repeated here.

[0083] In this implementation, by converting the original fields in the business process data, the field names can be made more standardized, effectively preventing inconsistent fields when facing different business process data, reducing adjustment time, and improving the efficiency of process restoration.

[0084] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above-mentioned embodiment 1 can be referred to the above introduction, and will not be repeated in the following. On this basis, the step of determining the order of activity nodes according to the association combination of each activity in step S20 includes:

[0085] Step S201: when the adjacent node of each current activity is the previous activity node, the current activity node in the activity association combination whose adjacent node is empty is determined as the first node.

[0086] It should be noted that, in the case where the adjacent node is the previous active node, the first node can be determined as the initial node of the process instance.

[0087] Step S202, determining the current active node in the activity association combination whose adjacent node is the first node as the downstream node of the first node;

[0088] Exemplarily, the activity association combinations obtained include "empty <- order reception" and "order reception <- payment processing", and the adjacent node of the "order reception" node is found to be empty, so it can be determined that the "order reception" node is the first node of this process instance, and the adjacent node of the "payment processing" node is found to be the "order reception" node, and "payment processing" is determined as the downstream node of "order reception".

[0089] Step S203, re-determine the downstream node of the first node as the first node, and execute the step of determining the current active node in the activity association combination of the adjacent node as the first node as the downstream node of the first node, until the downstream node of the first node is empty, and determine the order of active nodes.

[0090] The sequence of activity nodes in the entire business process is determined based on all identified upstream and downstream relationships.

[0091] For example, initially, node A is the first node, and its downstream node is B. Node B is re-determined as the first node, and an activity association combination whose adjacent node is B is found. It is found that node C depends on B, and node C is determined as the downstream node of node B. Repeat the above process, and determine node D as the downstream node of node C. When node D has no downstream node, stop repeating the operation, and determine the order of activity nodes in the entire process as: A->B->C->D.

[0092] In this embodiment, the node order is determined by searching for the previous active node, and the nodes are truly sorted according to their order, which improves the efficiency of process instance construction, helps to enhance the logical clarity of the process instance, and thus improves the accuracy of process restoration.

[0093] In a feasible implementation manner, the step of determining the order of activity nodes according to the activity association combinations in step S20 includes:

[0094] Step S207, when the adjacent node of each current activity is the next active node, the current active node in the activity association combination whose adjacent node is empty is determined as the second node;

[0095] It should be noted that, in the case where the adjacent node is the next active node, the first node can be determined as the end node of the process instance.

[0096] Step S208, determining the current active node in the activity association combination whose adjacent node is the second node as the upstream node of the second node;

[0097] Step S209, re-determine the upstream node of the second node as the second node, and execute the step of determining the current active node in the activity association combination whose adjacent node is the second node as the upstream node of the second node, until the upstream node of the second node is empty, and determine the order of active nodes.

[0098] Exemplarily, it is determined that node C, whose next active node is empty, is the second node (end node), and an activity association combination whose next active node is C is searched, and it is found that node C depends on B, and its upstream node is B. Node B is re-determined as the second node, and the above process is repeated, and node A is determined as the upstream node of node B. When node A has no upstream node, the repeated operation is stopped, and the order of active nodes in the entire process is determined to be: A->B->C.

[0099] In this implementation, the execution order of the active nodes in the business process is determined by iteratively identifying the upstream nodes, and the active nodes are truly sorted according to the order of precedence, which can also improve the accuracy of process restoration.

[0100] In a feasible implementation manner, in step S40, the step of sorting the current activity nodes according to the activity node sequence and the execution relationship of the current activity nodes to generate the activity process instance includes:

[0101] Step E10, adjusting the order of the active nodes according to the execution relationship of each current active node, wherein the order of nodes corresponding to the current active nodes belonging to the parallel execution relationship is the same;

[0102] It can be understood that by marking the same activity node sequence for the activity nodes belonging to the parallel execution relationship, even if the start time of the activity nodes is different, it can be judged based on the activity node sequence that the multiple nodes are not in a serial relationship in time, but in a parallel relationship, and there is no time dependence, thereby achieving effective judgment of the parallel situation between the activity nodes and providing a basis for the subsequent clear restoration of the process instance.

[0103] Step E20, sorting each current activity node according to the adjusted activity node sequence to generate an activity process instance.

[0104] For example, the execution relationship is obtained: demand analysis is executed first, design and coding can be executed in parallel, and testing and deployment must wait for coding to be completed and then be carried out in sequence. However, in the business process, the start time of the design node is earlier than the start time of the coding node. If the node order is not adjusted, please refer to Figure 2 , Figure 2 An activity flow instance is provided that does not adjust the order of activity nodes. The coding node must be executed after the design node, but in fact the two can be executed in parallel.

[0105] For example, according to these execution relationships, design and coding are considered to be in the same activity node sequence and take precedence over testing and deployment. Figure 3 , Figure 3 An activity flow instance diagram generated after adjusting the activity sequence is provided. Based on the adjusted activity node sequence: requirement analysis -> (design, coding in parallel) -> testing -> deployment, an activity flow instance is generated in the form of a connection.

[0106] In this implementation, by analyzing the parallel execution relationship between the activity nodes in parallel, the activity node sequence is optimized and adjusted, thereby avoiding the situation where the parallel activity nodes are restored to serial nodes or loop nodes, thereby improving the accuracy of process restoration.

[0107] In a feasible implementation manner, after the step of generating the activity process instance in step S40, the following steps are further included:

[0108] Step E30, generating a time indicator for the active process instance.

[0109] It should be noted that time indicators refer to data used to measure and record key time points during the execution of an activity process instance, including the start time, end time, and waiting time of the process, which helps analyze process efficiency, bottlenecks, and performance.

[0110] Exemplarily, an aggregation function is used to calculate the basic time attributes of each active node in the process instance, including summation, averaging, maximum and minimum operations, to obtain the time index of each active node. Calculations can also be performed using third-party tools or custom programs, which are not specifically limited in this embodiment.

[0111] Exemplarily, an aggregate function or a time indicator of each activity node is used to calculate time indicators such as duration and waiting time of two or three or even the entire process instance.

[0112] In this implementation, by generating and analyzing the time indicators of the activity process instances, detailed time data of the business process execution is effectively provided, providing data support for the analysis and optimization of the process.

[0113] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the process restoration method of the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0114] The present application also provides a process restoration device, please refer to Figure 4 , the process restoration device includes:

[0115] The association module 10 is used to generate an activity association combination according to the acquired business process data, wherein the activity association combination includes a current activity node and adjacent nodes of the current activity node, and the connection order of the adjacent nodes of each current activity node is the same;

[0116] A sorting module 20 is used to determine the order of activity nodes according to the associated combinations of each activity;

[0117] A parallel determination module 30 is used to determine the execution relationship between the current activity nodes according to the activity association combination, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship;

[0118] The generating module 40 is used to sort the current activity nodes according to the activity node sequence and the execution relationship between the current activity nodes to generate an activity process instance.

[0119] Optionally, the association module 10 is further used for:

[0120] According to the process instance identifier of each activity node in the business process data, each activity node in the business process data is grouped to obtain an activity variant array and an adjacent activity sequence, wherein the activity variant array includes all current activity nodes with the same process instance identifier, and the adjacent activity sequence is a set of adjacent nodes corresponding to the current activity node in the activity variant array;

[0121] The adjacent nodes corresponding to each current activity node in the adjacent activity sequence are determined and associated to generate an activity association combination.

[0122] Optionally, the association module 10 is further used for:

[0123] Convert the fields of each activity node in the business process data into preset standard fields.

[0124] Optionally, the sorting module 20 is further used for:

[0125] In the case where the adjacent node of each current activity is the previous activity node, the current activity node in the activity association combination whose adjacent node is empty is determined as the first node;

[0126] Determine the current active node in the activity association combination whose adjacent node is the first node as a downstream node of the first node;

[0127] The downstream node of the first node is re-determined as the first node, and the step of determining the current active node in the activity association combination of the first node whose adjacent node is the first node as the downstream node of the first node is performed until the downstream node of the first node is empty, and the order of the active nodes is determined.

[0128] Optionally, the sorting module 20 is further used for:

[0129] In the case where the adjacent node of each current activity is the next active node, the current active node in the activity association combination whose adjacent node is empty is determined as the second node;

[0130] Determine the current active node in the activity association combination whose adjacent node is the second node as the upstream node of the second node;

[0131] The upstream node of the second node is re-determined as the second node, and the step of determining the current active node in the activity association combination of the second node whose adjacent node is the second node as the upstream node of the second node is performed until the upstream node of the second node is empty, and the order of the active nodes is determined.

[0132] Optionally, the generating module 40 is further used for:

[0133] According to the execution relationship of each current active node, the order of the active nodes is adjusted, wherein the order of the nodes corresponding to the current active nodes belonging to the parallel execution relationship is the same;

[0134] According to the adjusted activity node sequence, each current activity node is sorted to generate an activity process instance.

[0135] Optionally, the generating module 40 is further used for:

[0136] Generates time metrics for active process instances.

[0137] The process restoration device provided in the embodiment of the present application adopts the process restoration method in the above embodiment, which can solve the technical problem of how to improve the accuracy of process restoration. Compared with the prior art, the beneficial effects of the process restoration device provided in the embodiment of the present application are the same as the beneficial effects of the process restoration method provided in the above embodiment, and other technical features in the process restoration device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0138] An embodiment of the present application provides a process restoration device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the process restoration method in the above-mentioned embodiment one.

[0139] Reference below Figure 5 , which shows a schematic diagram of the structure of a process restoration device suitable for implementing the embodiment of the present application. The process restoration device in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The process restoration device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0140] like Figure 5As shown, the process restoration device may include a processing device 1001 (e.g., a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the process restoration device are also stored. The processing device 1001, ROM1002, and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD: Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the process restoration device to communicate with other devices wirelessly or by wire to exchange data. Although the process restoration device with various systems is shown in the figure, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems can be implemented or have alternatively.

[0141] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0142] The process restoration device provided in the embodiment of the present application adopts the process restoration method in the above embodiment, which can solve the technical problem of how to improve the accuracy of process restoration. Compared with the prior art, the beneficial effects of the process restoration device provided in the embodiment of the present application are the same as the beneficial effects of the process restoration method provided in the above embodiment, and other technical features in the process restoration device are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0143] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0144] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0145] An embodiment of the present application provides a computer-readable storage medium having computer-readable program instructions (ie, a computer program) stored thereon, wherein the computer-readable program instructions are used to execute the process restoration method in the above-mentioned embodiment.

[0146] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM: Random Access Memory), a read-only memory (ROM: Read Only Memory), an erasable programmable read-only memory (EPROM: Erasable Programmable Read Only Memory or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM: CD-Read Only Memory), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency: Radio Frequency), etc., or any suitable combination of the above.

[0147] The computer-readable storage medium may be included in the process restoration device; or may exist independently without being assembled into the process restoration device.

[0148] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the process restoration device, the process restoration device: generates an activity association combination based on the acquired business process data, wherein the activity association combination includes the current activity node and the adjacent nodes of the current activity node, and the connection order of the adjacent nodes of each current activity node is the same; determines the activity node sequence based on each activity association combination; determines the execution relationship between each current activity node based on each activity association combination, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship; sorts each current activity node based on the activity node sequence and the execution relationship between each current activity node to generate an activity process instance.

[0149] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0150] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0151] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0152] The readable storage medium provided in the embodiment of the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned process restoration method, and can solve the technical problem of how to improve the accuracy of process restoration. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in the embodiment of the present application are the same as the beneficial effects of the process restoration method provided in the above-mentioned embodiment, and will not be repeated here.

[0153] An embodiment of the present application also provides a computer program product, including a computer program, which implements the steps of the process restoration method as described above when executed by a processor.

[0154] The computer program product provided in the embodiment of the present application can solve the technical problem of how to improve the accuracy of process restoration. Compared with the prior art, the beneficial effects of the computer program product provided in the embodiment of the present application are the same as the beneficial effects of the process restoration method provided in the above embodiment, which will not be repeated here.

[0155] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A process restoration method, characterized in that: The process restoration method comprises: Generate an activity association combination according to the acquired business process data, wherein the activity association combination includes a current activity node and adjacent nodes of the current activity node, and the connection order of the adjacent nodes of each current activity node is the same; Determine the activity node sequence according to the activity association combination; Determine the execution relationship between the current activity nodes according to the activity association combinations, wherein the current activity nodes with the same adjacent nodes are in a parallel execution relationship; According to the activity node sequence and the execution relationship between the current activity nodes, the current activity nodes are sorted to generate an activity process instance.

2. The process restoration method according to claim 1, characterized in that: The step of generating an activity association combination according to the acquired business process data includes: According to the process instance identifier of each activity node in the business process data, each activity node in the business process data is grouped to obtain an activity variant array and an adjacent activity sequence, wherein the activity variant array includes all current activity nodes with the same process instance identifier, and the adjacent activity sequence is a set of adjacent nodes corresponding to the current activity node in the activity variant array; The adjacent nodes corresponding to each of the current activity nodes in the adjacent activity sequence are determined and associated to generate the activity association combination.

3. The process restoration method according to claim 1, characterized in that: Before the step of generating the activity association combination, the method further includes: The fields of each activity node in the business process data are converted into preset standard fields.

4. The process restoration method according to claim 1, characterized in that: The step of determining the order of activity nodes according to each of the activity association combinations comprises: In the case where the adjacent node of each current activity is the previous activity node, determining the current activity node in the activity association combination whose adjacent node is empty as the first node; Determine the neighboring node as the current active node in the activity association combination of the first node as a downstream node of the first node; The downstream node of the first node is re-determined as the first node, and the step of determining the adjacent node as the current active node in the activity association combination of the first node as the downstream node of the first node is performed until the downstream node of the first node is empty, and the active node order is determined.

5. The process restoration method according to claim 1, characterized in that: The step of determining the order of activity nodes according to each of the activity association combinations comprises: In the case where the adjacent nodes of each of the current activities are the next active nodes, determining the current active node in the activity association combination whose adjacent nodes are empty as the second node; Determine the adjacent node as the current active node in the activity association combination of the second node as the upstream node of the second node; The upstream node of the second node is re-determined as the second node, and the step of determining the adjacent node as the current active node in the activity association combination of the second node as the upstream node of the second node is performed until the upstream node of the second node is empty, and the active node order is determined.

6. The process restoration method according to claim 1, characterized in that: The step of sorting the current activity nodes according to the activity node sequence and the execution relationship of the current activity nodes to generate an activity process instance includes: According to the execution relationship of each of the currently active nodes, the order of the active nodes is adjusted, wherein the order of nodes corresponding to the currently active nodes belonging to the parallel execution relationship is the same; According to the adjusted activity node sequence, the current activity nodes are sorted to generate an activity process instance.

7. The process restoration method according to claim 1, characterized in that: After the step of generating the activity process instance, the method further includes: Generates time metrics for the active process instance.

8. A process restoration device, characterized in that: The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the process restoration method according to any one of claims 1 to 7.

9. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the process restoration method according to any one of claims 1 to 7 are implemented.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the process restoration method according to any one of claims 1 to 7 are implemented.

Images