Business process approval method and device, equipment, storage medium and program product

Abstract

The invention discloses a business process approval method and device, equipment, a storage medium and a program product, and relates to the technical field of business management. The method comprises the steps of obtaining an approval request of a business process, wherein the business process comprises at least one item auditing node and a business handling node; executing the at least one item auditing node and the business handling node in a parallel mode; under the condition that the node states of the at least one item auditing node and the business handling node are both successful execution, determining that the approval result of the business process is approved; and under the condition that the node state of the node in the at least one item auditing node and the business handling node is unsuccessful execution, determining the approval result of the business process as approval failure. According to the embodiment of the invention, the efficiency of the business process can be improved.

Description

Technical Field

[0001] The present application belongs to the field of business management technology, and in particular, relates to a business process approval method, device, equipment, storage medium and program product. Background Art

[0002] A business process can be a collection of steps or tasks that are combined to achieve a certain business purpose. Usually, a business process is a sequential process, that is, each step must be completed in sequence, and the next node can only be entered after the previous node is completed, until the process is finally completed.

[0003] However, this sequential execution process is inefficient because there are dependencies between each step, and the next step must wait until the previous step is fully completed before proceeding. This will cause unnecessary waiting time, especially when a certain step takes a long time, which will extend the execution time of the entire process. This will reduce the efficiency of the business process. Summary of the invention

[0004] The embodiments of the present application provide a business process approval method, apparatus, device, storage medium and program product, which can solve the problem of low efficiency of existing business processes.

[0005] In a first aspect, an embodiment of the present application provides a business process approval method, the method comprising:

[0006] Obtaining an approval request for a business process, wherein the business process includes at least one matter review node and a business handling node;

[0007] Execute the at least one matter review node and the business handling node in parallel;

[0008] When the node statuses of the at least one item review node and the business handling node are both successful, determining the approval result of the business process as approved;

[0009] When the node status of a node in the at least one matter review node and the business processing node is unsuccessful execution, the approval result of the business process is determined as approval failure.

[0010] In some embodiments, after executing the at least one matter review node and the business handling node in parallel, the method further includes:

[0011] When the node status of the business processing node is successful execution and there is an item review node that has not been completed, the status of the business process is updated to a frozen state;

[0012] If it is detected that the node status of the at least one item review node is all executed successfully, the status of the business process is updated to approved;

[0013] If it is detected that the node status of the item review node is execution failure, the status of the business process is updated to approval failure.

[0014] In some embodiments, the method further comprises:

[0015] For any first node in the business process, acquiring node dependency information of the first node from a node dependency table associated with the first node;

[0016] executing a function of the first node based on the node dependency information;

[0017] An execution flag of the first node is updated based on an execution result of the function of the first node, where the execution flag is used to indicate a node state of the first node.

[0018] In some embodiments, after updating the execution flag of the first node based on the execution result of the function of the first node, the method further includes:

[0019] When the execution flag of the first node is updated to a success flag, determining a set of subsequent nodes of the first node;

[0020] For any second node in the set of successor nodes, determine a set of predecessor nodes of the second node;

[0021] When the execution flags of all the predecessor nodes in the predecessor node set are success flags, the execution flag of the second node is updated to a ready state.

[0022] In some embodiments, after acquiring the node dependency information of the first node from the node dependency table associated with the first node, the method further includes:

[0023] When there are multiple subsequent triggering actions for the first node, obtaining the priorities of the multiple subsequent triggering actions;

[0024] The multiple subsequent triggering actions are executed in order of priority from high to low.

[0025] In some embodiments, the node dependency information includes a retry count, and executing the function of the first node based on the node dependency information includes:

[0026] When the function of the first node fails to be executed for the i-th time, obtaining a first value of the number of possible retries;

[0027] When the first value of the number of retry attempts is greater than 0, updating the number of retry attempts from the first value to a second value, where the second value is the first value minus 1;

[0028] When the first value of the number of retry attempts is 0, the execution flag of the first node is updated to a failure state.

[0029] In a second aspect, an embodiment of the present application provides a business process approval device, the device comprising:

[0030] An acquisition module, used to acquire an approval request for a business process, wherein the business process includes at least one matter review node and a business handling node;

[0031] An execution module, configured to execute the at least one matter review node and the business handling node in parallel;

[0032] A first determination module is used to determine the approval result of the business process as approved when the node status of the at least one matter review node and the business handling node are both successful execution;

[0033] The second determination module is used to determine the approval result of the business process as approval failure when the node status of a node in the at least one matter review node and the business processing node is unsuccessful execution.

[0034] In a third aspect, an embodiment of the present application provides a business process approval device, the device comprising: a processor and a memory storing computer program instructions;

[0035] When the processor executes the computer program instructions, the above business process approval method is implemented.

[0036] In a fourth aspect, an embodiment of the present application provides a computer storage medium on which computer program instructions are stored. When the computer program instructions are executed by a processor, the above-mentioned business process approval method is implemented.

[0037] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes computer program instructions, and when the computer program instructions are executed by a processor, the above-mentioned business process approval method is implemented.

[0038] In this application, by processing the matter review nodes and business handling nodes in the business process in parallel, multiple nodes can be operated at the same time, thereby shortening the execution time of the entire process. Since the nodes can run in parallel, the waiting time is reduced, and the approval decision is made immediately after all nodes are successfully completed, which greatly improves the efficiency of approval. At the same time, the node failure is determined in time and the process is terminated, avoiding unnecessary waste of resources. This parallel processing method effectively optimizes the speed and efficiency of the business process. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0040] Figure 1 It is a flowchart of a business process approval method provided by an embodiment of the present application;

[0041] Figure 2 It is a structural diagram of a business process approval device provided in an embodiment of the present application;

[0042] Figure 3 It is a schematic diagram of the hardware structure of a business process approval device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0043] The features and exemplary embodiments of various aspects of the present application will be described in detail below. In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain the present application, rather than to limit the present application. For those skilled in the art, the present application can be implemented without the need for some of these specific details. The following description of the embodiments is only to provide a better understanding of the present application by illustrating the examples of the present application.

[0044] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "include..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0045] It should be noted that the acquisition, storage, use, and processing of data in the technical solution of this application are in compliance with the relevant provisions of national laws and regulations.

[0046] It should be noted that in the embodiments of the present application, certain software, components, models and other existing solutions in the industry may be mentioned, and they should be regarded as exemplary. Their purpose is only to illustrate the feasibility of implementing the technical solution of the present application, but it does not mean that the applicant has or will necessarily use the solution.

[0047] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The embodiments will be described in detail below in conjunction with the accompanying drawings.

[0048] Specifically, in order to solve the problems of the prior art, the embodiments of the present application provide a business process approval method, device, equipment, storage medium and program product. The business process approval method provided by the embodiments of the present application is first introduced below.

[0049] Figure 1 A flowchart of a business process approval method provided by an embodiment of the present application is shown. The method comprises the following steps:

[0050] S110, obtaining an approval request for a business process, wherein the business process includes at least one matter review node and a business processing node.

[0051] In this embodiment, the business process may be a set of steps or tasks, which are combined to achieve a certain business purpose. For example, the business process may be a product return process, an asset application process, or an enrollment application process.

[0052] An event review node is a step that requires review of certain conditions or requirements. For example, in the business process of asset application, the bank needs to review the customer's credit record and income certificate. These review steps are event review nodes. A business handling node is a specific operation or processing step, usually the actual processing of the customer's needs or applications. For example, in the enrollment application process, the operation of issuing the admission notice is a business handling node.

[0053] S120, executing the at least one matter review node and the business processing node in parallel.

[0054] In this embodiment, during the approval process of the business process, the system will execute all the matter review nodes and business handling nodes at the same time, rather than in a certain order. The overall efficiency of the business process can be improved by parallel processing.

[0055] S130, when the node statuses of the at least one matter review node and the business processing node are both successfully executed, determining the approval result of the business process as approved.

[0056] S140, when the node status of a node in the at least one matter review node and the business processing node is unsuccessful execution, the approval result of the business process is determined as approval failure.

[0057] In this embodiment, if all nodes (including all matter review nodes and business processing nodes) are successfully completed, the system will determine the approval result of the entire business process as "approved". If the execution of any node is unsuccessful, such as the review of the matter review node fails, or the processing of the business processing node fails, the system will determine the approval result of the entire business process as "failed".

[0058] In the embodiment of the present application, by processing the matter review node and the business handling node in the business process in parallel, multiple nodes can be operated at the same time, thereby shortening the execution time of the entire process. Since the nodes can run in parallel, the waiting time is reduced, and the approval decision is made immediately after all nodes are successfully completed, which greatly improves the efficiency of approval. At the same time, the node failure is determined in time and the process is terminated, avoiding unnecessary waste of resources. This parallel processing method effectively optimizes the speed and efficiency of the business process.

[0059] As an optional embodiment, after executing the at least one matter review node and the business handling node in parallel, the method further includes:

[0060] When the node status of the business processing node is successful execution and there is an item review node that has not been completed, the status of the business process is updated to a frozen state;

[0061] If it is detected that the node status of the at least one item review node is all executed successfully, the status of the business process is updated to approved;

[0062] If it is detected that the node status of the item review node is execution failure, the status of the business process is updated to approval failure.

[0063] In this embodiment, during the approval process of a business process, if the business handling node has been successfully completed, but some item review nodes are still in progress, the system will mark the status of the entire business process as "frozen". The frozen state means that the business process is temporarily stopped and will continue after all item review nodes are completed. This frozen state can prevent the process from ending prematurely and ensure that all necessary reviews have been completed.

[0064] After that, the system will continue to monitor the status of all item review nodes. Once all review nodes are successfully completed, the system will update the status of the entire business process to "approved". This means that the process was successfully completed and the final result was the approval of the business request. If the system detects that any item review node fails to execute, it means that some qualifications in the business process do not meet the requirements of business handling, and the status of the process will be updated to "approval failed". This status means that the process is rejected due to the failure of a certain item review node, and the business process will no longer continue.

[0065] Taking the business process of applying for admission to a school as an example, the admission application includes the academic score review node and the interview arrangement node. The academic score review and interview arrangement can be carried out at the same time. Assume that the interview has been successfully completed and passed, but the academic score review is still in progress. At this time, the system will mark the status of the admission application as "frozen" and wait for the results of the academic score review. If the academic score review is also completed and passed, the system will update the status of the admission application to "approved". If the academic score review does not pass (i.e. fails), even if the interview has passed, the system will still update the application status to "approved not passed".

[0066] This embodiment significantly shortens the processing time of the business process by processing the matter review node and the business processing node in parallel. When the business processing node is successful but the review node is not completed, the process status will be temporarily frozen to ensure that the process will not be ended rashly when the review is not completed. If all review nodes are successful, the process will be automatically updated to approved; if an audit node fails, the process will be terminated in time and updated to unapproved. This mechanism improves the efficiency and reliability of the process and ensures that all key steps are properly handled.

[0067] As an optional embodiment, the method further includes:

[0068] For any first node in the business process, acquiring node dependency information of the first node from a node dependency table associated with the first node;

[0069] executing a function of the first node based on the node dependency information;

[0070] An execution flag of the first node is updated based on an execution result of the function of the first node, where the execution flag is used to indicate a node state of the first node.

[0071] In this embodiment, the node dependency table records the dependency relationship between each node in the business process. It defines information such as the predecessor node, the successor node, and the number of retries of a node. Through this table, the system can understand whether the node can be executed and under what conditions. The node dependency information is all the data related to a specific node extracted from the node dependency table. The node dependency information determines the execution conditions and execution order of the node, including which other nodes' completion status it depends on. The function of the node is the actual operation or task that the node needs to complete in the business process.

[0072] In this embodiment, the system first identifies the first node that needs to be processed, and then obtains the node dependency information related to the first node from the node dependency table. The node dependency information may include the business scenario, the preceding node, the following node, the number of retries, and other configurations of the first node, the preceding function ID, the following function ID, and other parameters. For example, the node dependency table may be as shown in Table 1 below:

[0073] Table 1

[0074]

[0075] After obtaining the node dependency information of the first node, the system will check whether the execution condition of the node is met. The execution condition can be whether the previous node has been successfully executed. If the execution condition is met, the system will execute the function of the first node. After executing the function of the first node, the system will update the status of the node according to the execution result of the function. This status will be recorded in the process engine operation details table (i.e., Table 2 below), and the execution status of the current node (such as success, failure, ready) will be marked by the execution flag.

[0076] Table 2

[0077]

[0078] In the above scheme, by obtaining and utilizing node dependency information, each node is ensured to be executed only after meeting specific conditions, thus ensuring the logic and sequence of the process. By updating the execution flag of the node, the system can track the status of each node in real time, thereby improving the transparency and controllability of the process.

[0079] As an optional embodiment, after updating the execution flag of the first node based on the execution result of the function of the first node, the method further includes:

[0080] When the execution flag of the first node is updated to a success flag, determining a set of subsequent nodes of the first node;

[0081] For any second node in the set of successor nodes, determine a set of predecessor nodes of the second node;

[0082] When the execution flags of all the predecessor nodes in the predecessor node set are success flags, the execution flag of the second node is updated to a ready state.

[0083] In this embodiment, the post-node refers to a node that needs to be started after the current node is successfully executed in the process. The predecessor node refers to a node that must be completed before the subsequent node can be started in the process. The post-node set refers to all the post-nodes of the current node, and the predecessor node set includes all the predecessor nodes of the current node.

[0084] Taking the first node as an example, when the first node successfully completes its function and updates the execution flag to a success flag, the system will search and determine all the successor nodes of the first node to form the successor node set of the first node. For any second node in the successor node set, the system will determine all the predecessor nodes that the second node depends on, that is, the predecessor node set of the second node. The system will check whether all the predecessor nodes of the second node have been successfully executed. If the status of all predecessor nodes is marked as successful, the system will update the execution flag of the second node to "ready state", indicating that the node can start execution. "Ready state" means that the second node has met all execution conditions and is waiting for the system to schedule execution.

[0085] For example, when the first node a1 is executed successfully, the node dependency table will be used to obtain the set of subsequent nodes of the first node (B) = {b1, b2...bn}, and all the predecessor nodes of the second node b1 (C) = {c1, c2...cn}. If all nodes in (C) are in a successful state, then the process engine operation details table will generate a record of b1's exec_flag = 0. Among them, exec_flag indicates the business execution status, 0 is ready, 1 is successful, and 2 is failed.

[0086] This method ensures that each node in the business process is executed only after all preconditions are met, thus ensuring the logic and sequence of the process. By dynamically updating the execution status of the nodes, the system can automatically manage the progress of the process, reduce human intervention, and improve the automation and efficiency of the process. This mechanism can also identify and handle dependencies in a timely manner to ensure that the process can proceed smoothly.

[0087] As an optional embodiment, after acquiring the node dependency information of the first node from the node dependency table associated with the first node, the method further includes:

[0088] When there are multiple subsequent triggering actions for the first node, obtaining the priorities of the multiple subsequent triggering actions;

[0089] The multiple subsequent triggering actions are executed in order of priority from high to low.

[0090] In this embodiment, the subsequent triggering action refers to other operations or functions that the system needs to automatically execute after a node is successfully executed. The priority of the subsequent triggering action refers to the importance level of these actions in the execution order. If multiple subsequent triggering actions are triggered after the first node is executed, the system will obtain the priority of each subsequent triggering action. And the system will execute these subsequent actions in order from high to low according to the obtained priority.

[0091] Specifically, the priority of the subsequent triggering action of the first node can be queried through Table 3.

[0092] Table 3

[0093]

[0094] In the above Table 2, bsn_id represents a unique business; function_id represents the action id that needs to be triggered, corresponding to pre_function_id and post_function_id in the node dependency table; bean_obj_nm and method_nm determine which method in which java class implements the action; prty_lvl represents the priority of the action, so you can also query Table 2 to determine what method is used to execute the above subsequent trigger action.

[0095] In the above embodiment, priority management can enable subsequent triggering actions to be executed in order of importance, ensuring that key tasks are completed in a timely manner, thereby improving the efficiency and reliability of the process. At the same time, this mechanism reduces resource competition and waiting time, and optimizes the execution speed of the overall process.

[0096] As an optional embodiment, the node dependency information includes a number of possible retries, and the executing the function of the first node based on the node dependency information includes:

[0097] When the function of the first node fails to be executed for the i-th time, obtaining a first value of the number of retries, where i is a positive integer;

[0098] When the first value of the number of retry attempts is greater than 0, updating the number of retry attempts from the first value to a second value, where the second value is the first value minus 1;

[0099] When the first value of the number of retry attempts is 0, the execution flag of the first node is updated to a failure state.

[0100] In this embodiment, retry_nums in Table 1 above represents the number of retries, which refers to the number of times the system allows automatic retries to execute a node when a node function fails in the business process. This value determines the number of times the system can retry when encountering temporary errors or problems to increase the chance of success of the process.

[0101] When a node function is executed for the first time, retry_nums is a preset value, which indicates the maximum number of times the node can be retried when encountering a failure. Each time a retry is performed, the value of retry_nums decreases by 1 until the value becomes 0. If retry_nums decreases to 0, the system will no longer retry and update the status of the node to failure.

[0102] Therefore, in this embodiment, when the system attempts to execute the function of the first node, if the function fails in the i-th execution, the system will first obtain the current number of retry times of the first node. If the first value of the number of retry times is greater than 0, it means that the node can still be retried. The system will reduce the number of retry times by 1, update the first value of the number of retry times to the second value, and prepare to retry to execute the function of the first node. If the first value of the number of retry times is already 0, it means that the node has exhausted all retry opportunities. The system updates the execution flag of the node to "failed state" and stops further attempts.

[0103] In this way, a fault-tolerant mechanism can be provided for the functional execution of each node, allowing the system to automatically retry when encountering temporary failures, reducing process interruptions caused by occasional problems.

[0104] Based on the business process approval method provided in the above embodiment, the present application also provides a specific implementation of the business process approval device. Please refer to the following embodiment.

[0105] See first Figure 2 The business process approval device 200 provided in the embodiment of the present application includes the following modules:

[0106] The acquisition module 201 is used to acquire the approval request of the business process, wherein the business process includes at least one item review node and a business handling node;

[0107] An execution module 202, configured to execute the at least one matter review node and the business handling node in parallel;

[0108] A first determination module 203 is used to determine the approval result of the business process as approved when the node status of the at least one matter review node and the business handling node are both successful execution;

[0109] The second determination module 204 is used to determine the approval result of the business process as approval failure when the node status of a node in the at least one matter review node and the business processing node is unsuccessful execution.

[0110] The device can process the item review node and business handling node in the business process in parallel, so that multiple nodes can be operated at the same time, thus shortening the execution time of the entire process. Since the nodes can run in parallel, the waiting time is reduced, and the approval decision is made immediately after all nodes are successfully completed, which greatly improves the efficiency of approval. At the same time, the node failure is determined in time and the process is terminated, avoiding unnecessary waste of resources. This parallel processing method effectively optimizes the speed and efficiency of the business process.

[0111] As an implementation of the present application, the above-mentioned business process approval device 200 may further include:

[0112] A freezing module, used to update the status of the business process to a frozen status when the node status of the business processing node is successfully executed and there is an item review node that has not been completed;

[0113] A first approval module, configured to update the status of the business process to approved if it is detected that the node status of the at least one item review node is all executed successfully;

[0114] The second approval module is used to update the status of the business process to approval failure if it is detected that the node status of the event review node is execution failure.

[0115] As an implementation of the present application, the above-mentioned business process approval device 200 can also be used for:

[0116] For any first node in the business process, acquiring node dependency information of the first node from a node dependency table associated with the first node;

[0117] executing a function of the first node based on the node dependency information;

[0118] An execution flag of the first node is updated based on an execution result of the function of the first node, where the execution flag is used to indicate a node state of the first node.

[0119] As an implementation of the present application, the above-mentioned business process approval device 200 may further include:

[0120] When the execution flag of the first node is updated to a success flag, determining a set of subsequent nodes of the first node;

[0121] For any second node in the set of successor nodes, determine a set of predecessor nodes of the second node;

[0122] When the execution flags of all the predecessor nodes in the predecessor node set are success flags, the execution flag of the second node is updated to a ready state.

[0123] As an implementation of the present application, the above-mentioned business process approval device 200 can also be used for:

[0124] When there are multiple subsequent triggering actions for the first node, obtaining the priorities of the multiple subsequent triggering actions;

[0125] The multiple subsequent triggering actions are executed in order of priority from high to low.

[0126] As an implementation of the present application, the above-mentioned business process approval device 200 can also be used for:

[0127] When the function of the first node fails to be executed for the i-th time, obtaining a first value of the number of possible retries;

[0128] When the first value of the number of retry attempts is greater than 0, updating the number of retry attempts from the first value to a second value, where the second value is the first value minus 1;

[0129] When the first value of the number of retry attempts is 0, the execution flag of the first node is updated to a failure state.

[0130] The business process approval device provided in the embodiment of the present invention can implement each step in the above method embodiment, and will not be described again here to avoid repetition.

[0131] Figure 3 A schematic diagram of the hardware structure of a business process approval device provided in an embodiment of the present application is shown.

[0132] The business process approval device may include a processor 1001 and a memory 1002 storing computer program instructions.

[0133] Specifically, the processor 1001 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiments of the present application.

[0134] The memory 1002 may include a large capacity memory for data or instructions. By way of example and not limitation, the memory 1002 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive or a combination of two or more of these. In appropriate cases, the memory 1002 may include a removable or non-removable (or fixed) medium. In appropriate cases, the memory 1002 may be inside or outside the integrated gateway disaster recovery device. In a specific embodiment, the memory 1002 is a non-volatile solid-state memory.

[0135] The memory may include read-only memory (ROM), random access memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical or other physical / tangible memory storage devices. Thus, typically, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to an aspect of the present disclosure.

[0136] The processor 1001 implements any one of the business process approval methods in the above embodiments by reading and executing the computer program instructions stored in the memory 1002 .

[0137] In one example, the business process approval device may further include a communication interface 1003 and a bus 1010. Figure 3 As shown, the processor 1001, the memory 1002, and the communication interface 1003 are connected via a bus 1010 and communicate with each other.

[0138] The communication interface 1003 is mainly used to implement communication between various modules, devices, units and / or equipment in the embodiments of the present application.

[0139] Bus 1010 includes hardware, software or both, coupling the components of the approval device of the business process to each other. For example and not limitation, the bus may include an accelerated graphics port (AGP) or other graphics bus, an enhanced industrial standard architecture (EISA) bus, a front-end bus (FSB), a hypertransport (HT) interconnect, an industrial standard architecture (ISA) bus, an infinite bandwidth interconnect, a low pin count (LPC) bus, a memory bus, a micro channel architecture (MCA) bus, a peripheral component interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a serial advanced technology attachment (SATA) bus, a video electronics standard association local (VLB) bus or other suitable bus or a combination of two or more of these. Where appropriate, bus 1010 may include one or more buses. Although the present application embodiment describes and shows a specific bus, the present application considers any suitable bus or interconnect.

[0140] The approval device of the business process can be based on the above embodiment, so as to realize the approval method and device combined with the above business process.

[0141] In addition, in combination with the business process approval method in the above-mentioned embodiment, the embodiment of the present application may provide a computer storage medium to implement it. The computer storage medium stores computer program instructions; when the computer program instructions are executed by the processor, any one of the business process approval methods in the above-mentioned embodiment is implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here. Among them, the above-mentioned computer-readable storage medium may include non-transitory computer-readable storage media, such as read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), a disk or an optical disk, etc., which are not limited here.

[0142] In addition, an embodiment of the present application further provides a computer program product, including computer program instructions, which can implement the steps and corresponding contents of the aforementioned method embodiment when the computer program instructions are executed by a processor.

[0143] It should be clear that the present application is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present application is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present application.

[0144] The functional blocks shown in the above block diagram can be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present application are programs or code segments that are used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link by a data signal carried in a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, optical fiber media, radio frequency (RF) links, etc. The code segment can be downloaded via a computer network such as the Internet, an intranet, etc.

[0145] It should also be noted that the exemplary embodiments mentioned in this application describe some methods or systems based on a series of steps or devices. However, this application is not limited to the order of the above steps, that is, the steps can be performed in the order mentioned in the embodiment, or in a different order from the embodiment, or several steps can be performed simultaneously.

[0146] Aspects of the present disclosure are described above with reference to the flowchart and / or block diagram of the method, device and computer program product according to the embodiment of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each 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, or other programmable data processing device to produce a machine so that these instructions executed by the processor of the computer or other programmable data processing device enable the implementation of the function / action specified in one or more boxes of the flowchart and / or block diagram. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field programmable logic circuit. It can also be understood that each box in the block diagram and / or flowchart and the combination of boxes in the block diagram and / or flowchart can also be implemented by dedicated hardware that performs a specified function or action, or can be implemented by a combination of dedicated hardware and computer instructions.

[0147] The above are only specific implementation methods of the present application. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, modules and units described above can refer to the corresponding processes in the aforementioned method embodiments, and will not be repeated here. It should be understood that the protection scope of the present application is not limited to this. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed in this application, and these modifications or replacements should be included in the protection scope of this application.

Claims

1. A business process approval method, characterized in that: The method comprises: Obtaining an approval request for a business process, wherein the business process includes at least one matter review node and a business handling node; Execute the at least one matter review node and the business handling node in parallel; When the node statuses of the at least one item review node and the business handling node are both successful, determining the approval result of the business process as approved; When the node status of a node in the at least one matter review node and the business processing node is unsuccessful execution, the approval result of the business process is determined as approval failure.

2. The business process approval method according to claim 1, characterized in that: After executing the at least one matter review node and the business handling node in parallel, the method further includes: When the node status of the business processing node is successful execution and there is an item review node that has not been completed, the status of the business process is updated to a frozen state; If it is detected that the node status of the at least one item review node is all executed successfully, the status of the business process is updated to approved; If it is detected that the node status of the item review node is execution failure, the status of the business process is updated to approval failure.

3. The business process approval method according to claim 1, characterized in that: The method further comprises: For any first node in the business process, acquiring node dependency information of the first node from a node dependency table associated with the first node; executing a function of the first node based on the node dependency information; An execution flag of the first node is updated based on an execution result of the function of the first node, where the execution flag is used to indicate a node state of the first node.

4. The business process approval method according to claim 3 is characterized in that: After updating the execution flag of the first node based on the execution result of the function of the first node, the method further includes: When the execution flag of the first node is updated to a success flag, determining a set of subsequent nodes of the first node; For any second node in the set of successor nodes, determine a set of predecessor nodes of the second node; When the execution flags of all the predecessor nodes in the predecessor node set are success flags, the execution flag of the second node is updated to a ready state.

5. The business process approval method according to claim 3, characterized in that: After acquiring the node dependency information of the first node from the node dependency table associated with the first node, the method further includes: When there are multiple subsequent triggering actions for the first node, obtaining the priorities of the multiple subsequent triggering actions; The multiple subsequent triggering actions are executed in order of priority from high to low.

6. The business process approval method according to claim 3, characterized in that: The node dependency information includes a number of possible retries, and the performing the function of the first node based on the node dependency information includes: When the function of the first node fails to be executed for the i-th time, obtaining a first value of the number of possible retries; When the first value of the number of retry attempts is greater than 0, updating the number of retry attempts from the first value to a second value, where the second value is the first value minus 1; When the first value of the number of retry attempts is 0, the execution flag of the first node is updated to a failure state.

7. A business process approval device, characterized in that: The device comprises: An acquisition module, used to acquire an approval request for a business process, wherein the business process includes at least one matter review node and a business handling node; An execution module, configured to execute the at least one matter review node and the business handling node in parallel; A first determination module is used to determine the approval result of the business process as approved when the node status of the at least one matter review node and the business handling node are both successful execution; The second determination module is used to determine the approval result of the business process as approval failure when the node status of a node in the at least one matter review node and the business processing node is unsuccessful execution.

8. A business process approval device, characterized in that: The business process approval device includes: a processor and a memory storing computer program instructions; When the processor executes the computer program instructions, the business process approval method according to any one of claims 1 to 6 is implemented.

9. A computer storage medium, characterized in that The computer storage medium stores computer program instructions, and when the computer program instructions are executed by a processor, the business process approval method according to any one of claims 1 to 6 is implemented.

10. A computer program product, characterized in that The computer program product includes computer program instructions, and when the computer program instructions are executed by a processor, the business process approval method according to any one of claims 1 to 6 is implemented.

Images