Enterprise process management method

Through in-depth analysis and optimization of enterprise-level business processes and operation process data, unnecessary fallback lines are removed and visual charts are generated, which solves the problem of complexity of enterprise-level business processes and improves operational efficiency and management efficiency.

CN119090430APending Publication Date: 2024-12-06SUNYARD SYST ENG CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411130869.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-16
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The disorderly accumulation of enterprise-level business processes and operational process data leads to complicated processes, hindering business development and increasing management costs.

Method used

By obtaining process relationship data, performing data cleaning and analysis, using the PageRank algorithm to calculate node weights, removing unnecessary fallback lines, optimizing process chains, generating visual DFG and BPMN graphs, and simplifying enterprise-level business processes and operation process structures.

Benefits of technology

It realizes the main process restoration and subprocess extraction of enterprise-level business processes and operation processes, simplifies the process structure, and improves operational efficiency and management efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119090430A_ABST
    Figure CN119090430A_ABST
Patent Text Reader

Abstract

The invention discloses an enterprise process management method, and particularly relates to the technical field of data processing, and the method comprises the following steps: S01, obtaining process relation data of a to-be-processed and restored main process, the process relation data comprising non-process log data; s02, performing data cleaning and analysis on the flow relation data to obtain a data packet; s03, performing path analysis on the data packet, and performing node weight calculation based on a PageRank algorithm to obtain a PageRank value of each node; s04, judging whether a rollback line needs to be removed or not according to the PageRank value of each node; and S05, according to a node removal requirement, re-removing the nodes of the specified type in the PageRank from which each node is removed, and connecting the processed nodes. According to the method, main line process extraction and sub-process analysis and splitting can be carried out on historical or newly-added process data, the original appearance of the process and sub-process branch content can be clearly displayed, and precious key data is provided for enterprise process management.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to an enterprise process management method. Background Art

[0002] In today's era of rapid development of informatization, enterprise processes, as the core elements supporting the implementation of its products and services, are becoming increasingly important. Enterprise processes are not only related to the smoothness of daily operations, but also the key to the implementation of corporate strategies and market competitiveness. However, with the continuous expansion of business and the increasing complexity of the market, enterprises are facing a severe challenge: the disorderly accumulation and barbaric growth of data in enterprise-level business processes and operational processes.

[0003] This disordered state has caused enterprise processes to become increasingly complex and chaotic, which not only seriously hinders the further development of the business and reduces operational efficiency, but also becomes a key factor driving the continuous increase in management costs. Therefore, when faced with massive and complex process assets, how to effectively understand, manage and govern, and optimize the structure of enterprise-level business processes and operational processes is expected to be well solved! Summary of the invention

[0004] The purpose of the present invention is to provide an enterprise process management method, which aims to help enterprises achieve mainline process restoration and sub-process extraction of their historical or existing enterprise-level business processes and operation process data.

[0005] In order to achieve the above object, the present invention provides the following technical solutions:

[0006] An enterprise process management method comprises the following steps:

[0007] S01, obtaining process relationship data of the main process to be restored, wherein the process relationship data includes non-process log data;

[0008] S02, cleaning and analyzing the process relationship data to obtain a data packet;

[0009] S03, after performing path analysis on the data packet, performing node weight calculation based on the PageRank algorithm to obtain the PageRank value of each node;

[0010] S04, judging whether it is necessary to remove the fallback line according to the PageRank value of each node;

[0011] S05, re-removing the designated type nodes in the PageRank of each node according to the node removal requirement, and connecting the processed nodes to form a process chain;

[0012] S06. Optimizing the process chain according to an internal algorithm to obtain the shortest process chain;

[0013] S07, judging all process nodes of the short process chain uniquely pointing to the end node according to the end node information:

[0014] If not, a consistency check is performed and the result is output after confirmation;

[0015] If yes, merge the end nodes first and then proceed to consistency check;

[0016] S08. Based on the output results, the coordinate positions of the DFG and BPMN diagrams are calculated, and the specific coordinate positions of the diagrams can be output;

[0017] S09. Generate a visualized DFG and BPMN diagram based on the calculation results of the specific positions of the diagram coordinates.

[0018] Preferably, in step S02, the obtained data packet also needs to be judged whether it meets the flow matrix data format requirements required for subsequent processing steps;

[0019] If it is in compliance, directly execute step S03;

[0020] If it does not meet the requirements, the adjacency matrix construction algorithm is used to calculate the matrix data according to the following steps;

[0021] Preferably, the processing of executing the adjacency matrix construction algorithm for the process matrix data format that does not meet the processing requirements of the subsequent steps includes:

[0022] According to the number of nodes n in the flowchart, create an n×n zero matrix A, where: the rows and columns of the matrix A correspond to the nodes in the flowchart;

[0023] In step S02, it is determined whether the process matrix data format required for the subsequent step processing is met: if it is met, the weight analysis is directly performed, and then step S03 is executed; if it is not met, the adjacency matrix construction algorithm needs to be executed, and then the weight analysis is performed, and the weight analysis includes:

[0024] Traverse all the edges in the flowchart and assign values ​​to the corresponding positions in the matrix A according to the type and weight of each edge (i, j), where:

[0025] For an undirected graph, since it is an undirected connection, both A(i,j) and A(j,i) should be assigned a value, and the value is 1;

[0026] For a directed graph, simply assign A(i,j) the weight of the edge or 1, indicating a directed connection from node i to node j;

[0027] If there is a self-loop in the flowchart, that is, an edge from a node to itself, you need to assign values ​​to the corresponding positions on the diagonal of the matrix;

[0028] In the above, i and j are the two node positions of the edge;

[0029] After traversing all edges, the matrix A is constructed.

[0030] Preferably, all edges in the flow chart are traversed, and nodes and edges in the matrix A are divided into multiple sub-graphs according to the Kernighan-Lin algorithm and the spectral clustering algorithm, each sub-graph corresponds to a sub-process;

[0031] Using non-process log data as a restriction condition, a heuristic search algorithm is used to screen sub-processes during sub-process extraction, and the screened sub-processes that do not meet the restriction condition are returned to the main process;

[0032] The coordinates of the sub-process are verified using an algorithm, and the coordinate position information of the BPMN diagram is input based on the acquired coordinates to generate a visual BPMN diagram located on the sub-process, and the DFG and BPMN information are output.

[0033] Preferably, the sub-process that does not meet the restriction condition is substituted into step S07 for consistency check, and the data that has completed the verification is retained in the sub-process.

[0034] Preferably, the step S03 of performing path analysis on the data packet includes:

[0035] S31, traverse all nodes in the flowchart based on depth-first search (DFS) and find any path from the starting point to the end point;

[0036] S32. Analyze any multiple paths through the Markov chain model, and combine the analysis of event logs or actual business data to determine the transition rules between different states in the path process.

[0037] Preferably, the node weight calculation based on the PageRank algorithm in step S03 includes:

[0038] S33, assigning an initial weight of 1 / N to each node, where N is the total number of nodes;

[0039] S34. For each node i in the network, calculate the sum of the weights transmitted by all its incoming nodes j;

[0040] S35, multiplying the sum of the weights by a damping coefficient d, and then adding (1-d) / N to obtain the updated PageRank value of node i, where d is 0.85;

[0041] S36. Repeat steps S33 to S35 until the PageRank values ​​of all nodes converge or reach a preset number of iterations.

[0042] Preferably, the internal algorithm described in step S06 is an operation on a flow chart, wherein:

[0043] When the flowchart is an undirected graph, the internal algorithm is the Kahn algorithm;

[0044] When the flowchart is a directed graph, the internal algorithm is a breadth-first search (BFS) algorithm;

[0045] When the edges in the flowchart have weights, the internal algorithm is the Dijkstra algorithm.

[0046] Preferably, the step S04 determines whether the fallback line needs to be removed by performing a fallback process determination on the main flowchart data to remove it. If the main flowchart data is completely executed after the removal, the step S05 is continued; if the main flowchart data cannot be executed after the removal, the removal is not performed, and the step S05 is continued.

[0047] Preferably, in step S05, after removing the designated node, the nodes are connected to form a process chain. If bidirectional loops A and B appear in the process chain, whether to retain the bidirectional loops or remove one of them is determined based on the bidirectional loop determination.

[0048] In the above technical solution, the enterprise process management method provided by the present invention has the following beneficial effects: based on the original process data, through deep analysis and data mining technology, the priority weight ratio of each node is analyzed and determined, and unnecessary fallback lines are judged and removed based on this, simplifying the structure of enterprise-level business processes and operation processes. Then, using the principles of operations research and optimization algorithms, blank transfer nodes that do not need to be displayed are further eliminated, and the process lines are reconnected and optimized to ensure the continuity and efficiency of the process. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] 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 will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0050] Figure 1 A flow chart of the main process restoration algorithm provided by an embodiment of the present invention;

[0051] Figure 2 A schematic diagram of the consistency check provided by an embodiment of the present invention;

[0052] Figure 3 A flow chart of an algorithm for extracting sub-processes from a main process provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0053] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0054] Embodiment 1

[0055] like Figure 1 and Figure 3 As shown, an enterprise process management method includes the following steps:

[0056] S01. Obtain process relationship data of the main process to be restored, where the process relationship data includes non-process log data;

[0057] S02. Clean and analyze the process relationship data to obtain a data packet. It is also necessary to determine whether the obtained data packet meets the process matrix data format requirements required for subsequent processing steps;

[0058] If it is in compliance, directly execute step S03;

[0059] If it does not meet the requirements, the adjacency matrix construction algorithm is used to calculate the matrix data according to the following steps;

[0060] The processing of the process matrix data format that does not meet the processing requirements of the subsequent steps requires the execution of the adjacency matrix construction algorithm, including:

[0061] The processing of the process matrix data format that does not meet the processing requirements of the subsequent steps requires the execution of the adjacency matrix construction algorithm, including:

[0062] According to the number of nodes n in the flowchart, create an n×n zero matrix A, where: the rows and columns of the matrix A correspond to the nodes in the flowchart;

[0063] In step S02, it is determined whether the process matrix data format required for the subsequent step processing is met: if it is met, the weight analysis is directly performed, and then step S03 is executed; if it is not met, the adjacency matrix construction algorithm needs to be executed, and then the weight analysis is performed, and the weight analysis includes:

[0064] Traverse all the edges in the flowchart and assign values ​​to the corresponding positions in the matrix A according to the type and weight of each edge (i, j), where:

[0065] For an undirected graph, since it is an undirected connection, both A(i,j) and A(j,i) should be assigned a value, and the value is 1;

[0066] For a directed graph, simply assign A(i,j) the weight of the edge or 1, indicating a directed connection from node i to node j;

[0067] If there is a self-loop in the flowchart, that is, an edge from a node to itself, you need to assign values ​​to the corresponding positions on the diagonal of the matrix;

[0068] In the above, i and j are the two node positions of the edge;

[0069] After traversing all edges, the matrix A is constructed;

[0070] Traverse all the edges in the flow graph, and divide the nodes and edges in the matrix A into multiple subgraphs according to the Kernighan-Lin algorithm and the spectral clustering algorithm, each subgraph corresponds to a sub-process;

[0071] Taking non-process log data as the restriction condition, a heuristic search algorithm is used to screen the sub-processes during the sub-process extraction process, and the screened sub-processes that do not meet the restriction condition are returned to the main process.

[0072] S03, after performing path analysis on the data packet, performing node weight calculation based on the PageRank algorithm to obtain the PageRank value of each node;

[0073] S04. Determine whether the fallback line needs to be removed based on the PageRank value of each node:

[0074] If after removal, the main flow chart data is completely executed, then continue to step S05;

[0075] If the main flow chart data cannot be executed after the removal, the removal is not performed and the process continues to step S05;

[0076] S05. Re-remove the designated type nodes in the PageRank of each node according to the node removal requirement, and connect the processed nodes to form a process chain;

[0077] S06. Optimize the process chain according to the internal algorithm to obtain the shortest process chain;

[0078] S07. Determine the uniqueness of all process nodes of the short process chain pointing to the end node according to the end node information:

[0079] If not, a consistency check is performed and the result is output after confirmation;

[0080] If yes, merge the end nodes first and then proceed to consistency check;

[0081] The above consistency check also includes a sub-process integrity consistency check, which is similar to using an algorithm to verify the coordinates of the sub-process, and then substituting the sub-process that does not meet the restriction conditions for consistency check, and retaining the completed verification data in the sub-process.

[0082] S08. Based on the output results, the coordinate positions of the DFG and BPMN diagrams are calculated, and the specific coordinate positions of the diagrams can be output;

[0083] S09. Generate a visualized DFG and BPMN diagram based on the calculation results of the specific positions of the diagram coordinates.

[0084] Embodiment 2

[0085] In this embodiment, the path analysis of the data packet in step S03 of the first embodiment includes:

[0086] S31, traverse all nodes in the flowchart based on depth-first search (DFS) and find any path from the starting point to the end point;

[0087] S32. Analyze any multiple paths through the Markov chain model, and combine the analysis of event logs or actual business data to determine the transition rules between different states in the path process.

[0088] The Markov chain model in the above embodiment allows the transition probability of activities to be inferred from the sequential relationship of DFG even without a complete log, guiding the layout of tasks and gateways in BPMN. Markov chain is a discrete-time random process with "no memory", that is, the probability distribution of the next state is determined only by the current state and has nothing to do with the past state. This feature makes Markov chain an ideal tool for modeling and analyzing systems with state transition characteristics. In process discovery, it is first necessary to define each activity or stage in the actual business process as the state of the Markov chain. These states represent possible situations of the process at different points in time. By analyzing event logs or actual business data, the probability of transitioning from one state to another can be calculated, that is, a state transition matrix is ​​constructed. This matrix describes the transition rules of the process between different states.

[0089] Embodiment 3

[0090] The PageRank algorithm of this embodiment relative to the first embodiment is an algorithm for determining node weights based on the link relationship between nodes in the network. The importance of a node depends on the importance of other nodes pointing to it and the connection strength between these nodes. Through iterative calculation, the PageRank algorithm can fully reflect the actual influence of the node in the entire main process. The node weight calculation based on the PageRank algorithm in step S03 includes:

[0091] S33, assigning an initial weight of 1 / N to each node, where N is the total number of nodes;

[0092] S34. For each node i in the network, calculate the sum of the weights transmitted by all its incoming nodes j;

[0093] S35, multiplying the sum of the weights by a damping coefficient d, and then adding (1-d) / N to obtain the updated PageRank value of node i, where d is 0.85;

[0094] S36. Repeat steps S33 to S35 until the PageRank values ​​of all nodes converge or reach a preset number of iterations.

[0095] Embodiment 4

[0096] This embodiment is relative to the first embodiment, in step S05, after removing the specified node, the nodes are connected to form a process chain. If the process chain has bidirectional loops A and B, for example, A->B and B->A, it is determined based on the bidirectional loop judgment whether to retain the bidirectional loop or remove one of them.

[0097] Furthermore, the internal algorithm in the fourth embodiment is an operation on the flow chart, and the short path is optimized by combining the node weight and the coverage of the path direction, so as to remove the line sensory impact of the short path on the original appearance of the main process. For example, when A->B->C and A->C exist at the same time, A->C can be removed as an auxiliary method, where:

[0098] For undirected flowcharts, the internal algorithm is the Kahn algorithm;

[0099] For directed flowcharts, the internal algorithm is the breadth-first search (BFS) algorithm;

[0100] When the edges in the flowchart have weights, the internal algorithm is the Dijkstra algorithm.

[0101] Embodiment 5

[0102] Combination Figure 2 As shown in the figure, consistency check is performed on the process from four quality dimensions: fit, simplicity, accuracy and generalization:

[0103]

[0104] In summary, the above technology is based on the original process data, through deep analysis and data mining technology, to analyze and determine the priority weight ratio of each node, based on which to judge and remove unnecessary fallback routes, simplifying the structure of enterprise-level business processes and operation processes. Then, using the principles of operations research and optimization algorithms, we further eliminate the blank transfer nodes that do not need to be displayed, reconnect and optimize the process routes, and ensure the continuity and efficiency of the process.

[0105] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0106] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0107] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0108] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0109] The present invention uses specific embodiments to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

[0110] The embodiments of the present application also provide a specific implementation of an electronic device capable of implementing all the steps of the method in the above embodiments, and the electronic device specifically includes the following contents:

[0111] Processor, memory, communications interface and bus;

[0112] Wherein, the processor, memory, and communication interface communicate with each other via the bus;

[0113] The processor is used to call the computer program in the memory, and when the processor executes the computer program, all the steps in the method in the above embodiment are implemented.

[0114] The embodiments of the present application also provide a computer-readable storage medium capable of implementing all the steps of the method in the above embodiments, wherein a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, all the steps of the method in the above embodiments are implemented.

[0115] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the hardware + program embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. Although the embodiment of this specification provides the method operation steps described in the embodiment or flow chart, more or less operation steps can be included based on conventional or non-creative means. The order of steps listed in the embodiment is only one way of executing the order of many steps, and does not represent the only execution order. When the device or terminal product in practice is executed, it can be executed in sequence or in parallel according to the method shown in the embodiment or the accompanying drawings (for example, a parallel processor or a multi-threaded processing environment, or even a distributed data processing environment). The term "include", "include" or any other variant thereof is intended to cover non-exclusive inclusion, so that the process, method, product or device including a series of elements includes not only those elements, but also includes other elements that are not explicitly listed, or also includes elements inherent to such a process, method, product or device. In the absence of more restrictions, it is not excluded that there are other identical or equivalent elements in the process, method, product or device including the elements. For the convenience of description, the above device is described by dividing it into various modules according to its functions. Of course, when implementing the embodiments of this specification, the functions of each module can be implemented in the same one or more software and / or hardware, or the module implementing the same function can be implemented by a combination of multiple sub-modules or sub-units. The device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the coupling or direct coupling or communication connection between each other shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms. The present invention is described with reference to the flowchart and / or block diagram of the method, device (system) and computer program product according to the embodiments of the present invention. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the process and / or box in the flowchart and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the process Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0116] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems or computer program products. Therefore, the embodiments of this specification may be in the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, the embodiments of this specification may be in the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes. Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts refer to the partial description of the method embodiment. In the description of this specification, the description of the reference term "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the embodiment of this specification.

[0117] In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradicting each other. The above is only an embodiment of the embodiment of this specification and is not intended to limit the embodiment of this specification. For those skilled in the art, the embodiment of this specification may have various changes and variations. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiment of this specification shall be included in the scope of the claims of the embodiment of this specification.

Claims

1. A method for enterprise process management, characterized in that: The following steps are involved: S01, obtaining process relationship data of the main process to be restored, wherein the process relationship data includes non-process log data; S02, cleaning and analyzing the process relationship data to obtain a data packet; S03, after performing path analysis on the data packet, performing node weight calculation based on the PageRank algorithm to obtain the PageRank value of each node; S04, judging whether it is necessary to remove the fallback line according to the PageRank value of each node; S05, re-removing the designated type nodes in the PageRank of each node according to the node removal requirement, and connecting the processed nodes to form a process chain; S06. Optimizing the process chain according to an internal algorithm to obtain the shortest process chain; S07, judging all process nodes of the short process chain uniquely pointing to the end node according to the end node information: If not, a consistency check is performed and the result is output after confirmation; If yes, merge the end nodes first and then proceed to consistency check; S08. Based on the output results, the coordinate positions of the DFG and BPMN diagrams are calculated, and the specific coordinate positions of the diagrams can be output; S09. Generate a visualized DFG and BPMN diagram based on the calculation results of the specific positions of the diagram coordinates.

2. The enterprise process management method according to claim 1, characterized in that: In step S02, the obtained data packet needs to be judged whether the process matrix data format required for subsequent processing is required: If it is in compliance, directly execute step S03; If it does not meet the requirements, the adjacency matrix construction algorithm is used to perform operations according to the following steps to obtain the matrix data.

3. The enterprise process management method according to claim 2, characterized in that: The processing of the process matrix data format that does not meet the processing requirements of the subsequent steps requires the execution of the adjacency matrix construction algorithm, including: According to the number of nodes n in the flowchart, create an n×n zero matrix A, where: the rows and columns of the matrix A correspond to the nodes in the flowchart; In step S02, it is determined whether the process matrix data format required for the subsequent step processing is met: if it is met, the weight analysis is directly performed, and then step S03 is executed; if it is not met, the adjacency matrix construction algorithm needs to be executed, and then the weight analysis is performed, and the weight analysis includes: Traverse all the edges in the flowchart and assign values ​​to the corresponding positions in the matrix A according to the type and weight of each edge (i, j), where: For an undirected graph, since it is an undirected connection, both A(i,j) and A(j,i) should be assigned a value, and the value is 1; For a directed graph, simply assign A(i,j) the weight of the edge or 1, indicating a directed connection from node i to node j; If there is a self-loop in the flowchart, that is, an edge from a node to itself, you need to assign values ​​to the corresponding positions on the diagonal of the matrix; In the above, i and j are the two node positions of the edge; After traversing all edges, the matrix A is constructed.

4. The enterprise process management method according to claim 3, characterized in that: Traverse all the edges in the flow graph, and divide the nodes and edges in the matrix A into multiple subgraphs according to the Kernighan-Lin algorithm and the spectral clustering algorithm, each subgraph corresponds to a sub-process; Using non-process log data as a restriction condition, a heuristic search algorithm is used to screen sub-processes during sub-process extraction, and the screened sub-processes that do not meet the restriction condition are returned to the main process; The coordinates of the sub-process are verified using an algorithm, and the coordinate position information of the BPMN diagram is input based on the acquired coordinates to generate a visual BPMN diagram located on the sub-process, and the DFG and BPMN information are output.

5. The enterprise process management method according to claim 4, characterized in that: The sub-process that does not meet the restriction condition is substituted into step S07 for consistency detection, and the data that has completed the verification is retained in the sub-process.

6. The enterprise process management method according to claim 1, characterized in that: The step S03 of performing path analysis on the data packet comprises: S31, traverse all nodes in the flowchart based on depth-first search (DFS) and find any path from the starting point to the end point; S32. Analyze any multiple paths through the Markov chain model, and combine the analysis of event logs or actual business data to determine the transition rules between different states in the path process.

7. The enterprise process management method according to claim 1, characterized in that: The node weight calculation based on the PageRank algorithm in step S03 includes: S33, assigning an initial weight of 1 / N to each node, where N is the total number of nodes; S34. For each node i in the network, calculate the sum of the weights transmitted by all its incoming nodes j; S35, multiplying the sum of the weights by a damping coefficient d, and then adding (1-d) / N to obtain the updated PageRank value of node i, where d is 0.85; S36. Repeat steps S33 to S35 until the PageRank values ​​of all nodes converge or reach a preset number of iterations.

8. The enterprise process management method according to claim 1, characterized in that: The internal algorithm described in step S06 is an operation on the flow chart, wherein: When the flowchart is an undirected graph, the internal algorithm is the Kahn algorithm; When the flowchart is a directed graph, the internal algorithm is a breadth-first search (BFS) algorithm; When the edges in the flowchart have weights, the internal algorithm is the Dijkstra algorithm.

9. The enterprise process management method according to claim 1, characterized in that: In step S04, judging whether the fallback line needs to be removed is to perform fallback process judgment and removal on the main flowchart data. If the main flowchart data is completely executed after the removal, then continue to step S05; if the main flowchart data cannot be executed after the removal, then the removal is not performed and continue to step S05.

10. The enterprise process management method according to claim 1, characterized in that: In the step S05, after removing the designated node, the nodes are connected to form a process chain. If the process chain has bidirectional loops A and B, it is determined whether to retain the bidirectional loops or remove one of them based on the bidirectional loop determination.