A business processing method and apparatus

Abstract

An embodiment of the present invention provides a service processing method and apparatus. The method includes: receiving service information, where the service information is used to trigger a service process; determining, according to the service information, the execution relationships between each service node for processing the service process and each sub-process corresponding to each service node from a pre-configured service flow definition; thus, according to the execution relationships between the sub-processes, each service node executes its respective sub-process, thereby completing the service process. By using the above method, when it is necessary to change the execution order of service nodes or sub-processes in service processing, the execution relationships can be directly adjusted, and thus the service process can be changed. The flexibility of service processing is increased, and the cost of maintaining service processing logic is reduced.

Description

Technical Field

[0001] This application relates to the field of computer technology in financial technology (Fintech), and in particular, to a business processing method and apparatus. Background Art

[0002] In recent years, with the development of computer technology, more and more technologies have been applied in the financial field. The traditional financial industry is gradually transforming into financial technology (Fintech). However, due to the security and real-time requirements of the financial industry, higher requirements are also imposed on technologies. As more manual business processes are transformed into business processes through computer technology, the logic of business processes that the computer needs to execute becomes more complex, and the writing of process definition files for business processes becomes more complex. Correspondingly, it has also become more difficult to update the process definition files for business processes executed by the computer.

[0003] Among them, the approval services for business processes through computer technology in the prior art include leave application approval, fund application approval, planning service approval, and so on. Taking the approval of the material fund application as an example, the approval of the material fund application generally goes through the direct managers of the department where the material fund applicant is located, the managers of the material management department, and the managers of the financial department for approval. Each department may also have multiple managers and responsible persons jointly approving. Therefore, after the material fund applicant initiates the material fund application service, since the approval process needs to be limited for this scenario, the computer needs to execute a very complex process definition file for business processes including the approval of each department manager and responsible person to complete this business process. Moreover, once the business process or business rule changes, the process definition file for this business process needs to be changed. Due to the complexity of the process definition file for business processes, it makes the workload of technicians to change this process definition file large, and the cycle for changing this process definition file is long. Summary of the Invention

[0004] Embodiments of the present invention provide a business processing method and apparatus, which are used to increase the flexibility of business processing and reduce the cost of maintaining business processing logic.

[0005] In a first aspect, embodiments of the present invention provide a business processing method, and the method includes:

[0006] Receiving business information, where the business information is used to trigger a business process; determining, according to the business information, an execution relationship between each business node for processing the business process and each sub-process corresponding to each business node from a pre-configured business flow definition; and executing respective sub-processes of each business node according to the execution relationship between the sub-processes, so as to complete the business process.

[0007] Using the above method, after receiving the service information, the service process is triggered, and then the execution relationships between the service nodes corresponding to the service information and the sub-processes corresponding to each service node are obtained from the pre-configured service flow definition. Further, according to the execution relationships, each sub-process is executed to complete the service process. In this way, when the execution order of service nodes or sub-processes needs to be changed during service processing, the execution relationships can be directly adjusted to achieve the change of the service process. This increases the flexibility of service processing and reduces the cost of maintaining service processing logic.

[0008] In a possible design, determining the execution relationships between the service nodes for processing the service process and the sub-processes corresponding to each service node from the pre-configured service flow definition according to the service information includes: determining each service node in the service process from the pre-configured process node definition according to the service type in the service information; and determining the execution relationships between the sub-processes corresponding to each service node from the pre-configured process flow definition according to the service parameters in the service information and each service node.

[0009] Using the above method, the service nodes involved in the service type can be obtained through the service type. Further, the execution relationships of each sub-process can be specifically determined according to specific service parameters. That is to say, in the pre-configured service flow definition, the service nodes corresponding to the service type can be pre-set, and different sub-process execution relationships corresponding to the service nodes under different service parameters can be pre-set. In this way, the determination of the execution relationships between sub-processes is accelerated, and the service processing speed is increased.

[0010] In a possible design, the service flow definition further includes the completion conditions of the service process; executing the respective sub-processes through the service nodes includes: monitoring the execution status of each sub-process; determining the next sub-process according to the execution status of each sub-process; or ending the service process when it is determined that the execution status of each sub-process meets the completion conditions.

[0011] Using the above method, by monitoring the execution status of the sub-processes, the integrity of the service processing corresponding to the service process can be ensured, and the accuracy of service processing can be ensured on the premise of improving the flexibility of service processing.

[0012] In a possible design, the service flow definition further includes the process definition file of the sub-process; executing the respective sub-processes through the service nodes includes: for any service node, calling the process definition file of the sub-process of the service node, and executing the sub-process based on the process engine of the sub-process and the process definition file; wherein, task preconditions are set in the process definition file, and the task preconditions are used to determine whether a sub-process to be transferred needs to be executed.

[0013] Using the above method, after obtaining the execution relationships of the sub-processes, the process definition files of the sub-processes are called according to the execution relationships, and the sub-processes are executed based on the process engine and the process definition files. In this way, when the sub-process logic in the business process changes, the independent process definition file corresponding to the sub-process can be directly found in the business flow definition, and the process definition file corresponding to the sub-process can be directly modified. Since the process definition file of each sub-process is much smaller than the process definition file corresponding to the entire business process; therefore, compared with the prior art of modifying in the process definition file of the entire business process handling, the present application directly modifies the process definition file corresponding to the sub-process, greatly reducing the workload of technical staff and enabling the process definition file to be updated quickly.

[0014] In a possible design, the business flow definition further includes rule definitions; according to the execution relationships between the sub-processes, each business node executes its respective sub-process, including: generating the execution basis for each sub-process according to the rule definitions and the execution relationships between the sub-processes; wherein, the execution basis includes the inter-node sequence of the node where the sub-process is located, the serial-parallel relationship and the serial-parallel quantity between the sub-processes located at the same node; each business node executes its respective sub-process according to the execution basis of its respective sub-process.

[0015] Using the above method, the business flow definition includes rule definitions, and the execution basis for each sub-process is generated according to the rule definitions and the execution relationships between the sub-processes, so that subsequently, each sub-process in each node is executed according to the inter-node sequence of the node where the sub-process is located in the execution basis, and each sub-process in the node is executed according to the serial-parallel relationship and the serial-parallel quantity between the sub-processes at the same node in the execution basis. In this way, subsequent sub-processes can be executed accurately and orderly according to the execution basis, ensuring the orderliness and accuracy of the business process execution. In a possible design, the rule definitions further include the completion ratio of the business node and whether each sub-process has a process change function; the completion ratio of the business node is used to indicate that when each sub-process with a parallel execution relationship in the business node meets the completion ratio of the business node, the task of the business node ends; the process change function is used to indicate whether the sub-process initiates another sub-process again.

[0016] Using the above method, the rule definition may also include the completion ratio of business nodes. Therefore, by setting the completion ratio in the rule definition, each sub-process executed in parallel can end the task of the business node after executing some or all of the sub-processes. In this way, by setting the completion ratio, the number of completed sub-processes executed in parallel can be flexibly determined, increasing the flexibility of business processing and reducing the cost of maintaining business processing logic. The rule definition may also include whether each sub-process has a process change function. In this way, when the sub-process is a transfer sub-process, the process change function can be used to instruct the sub-process to initiate a sub-process again. Further, when it is necessary to trace and transfer the original sub-process of the sub-process, the original sub-process can be determined according to the indication information of the process change function.

[0017] In a possible design, it further includes: receiving a configuration instruction; and updating the business flow definition according to the configuration instruction.

[0018] Using the above method, the business flow definition is updated by receiving a configuration instruction. Compared with directly updating in the process definition file of business processing in the prior art, it can increase the flexibility of business processing and reduce the cost of maintaining business processing logic.

[0019] In a second aspect, an embodiment of the present invention provides a business processing device, which includes:

[0020] A transceiver module, configured to receive business information, where the business information is used to trigger a business process;

[0021] A processing module, configured to determine, according to the business information, the execution relationship between each business node for processing the business process and each sub-process corresponding to each business node from a pre-configured business flow definition;

[0022] The processing module is further configured to execute respective sub-processes of each business node according to the execution relationship between the sub-processes, so as to complete the business process.

[0023] In a third aspect, an embodiment of the present invention further provides a computing device, including: a memory, configured to store a computer program; and a processor, configured to call the computer program stored in the memory and execute the method described in various possible designs of the first aspect according to the obtained program.

[0024] In a fourth aspect, an embodiment of the present invention further provides a computer-readable non-volatile storage medium, including a computer-readable program, which, when read and executed by a computer, causes the computer to execute the method described in various possible designs of the first aspect.

[0025] These implementation manners or other implementation manners of the present invention will be more clearly understood in the following description of the embodiments. Brief Description of the Drawings

[0026] To more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for description in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0027] Figure 1 It is a schematic architecture diagram of a service processing method provided by an embodiment of the present invention;

[0028] Figure 2 It is a schematic architecture diagram of a service process provided by an embodiment of the present invention;

[0029] Figure 3 It is a schematic architecture diagram of a service sub - process in a service process provided by an embodiment of the present invention;

[0030] Figure 4 It is a schematic flow diagram of a service processing method provided by an embodiment of the present invention;

[0031] Figure 5 It is a schematic architecture diagram of a sub - process provided by an embodiment of the present invention;

[0032] Figure 6 It is a schematic architecture diagram of another sub - process provided by an embodiment of the present invention;

[0033] Figure 7 It is a schematic flow diagram of a service processing method provided by an embodiment of the present invention;

[0034] Figure 8 It is a schematic diagram of a service processing device provided by an embodiment of the present invention. Detailed Embodiments

[0035] To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of them. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts belong to the scope of protection of the present invention.

[0036] A schematic architecture diagram of a service processing method provided by an embodiment of the present invention, as Figure 1 shown, the process execution unit 101 may include a service process and a process engine for this service process; an embodiment of the present invention also provides a schematic architecture diagram of a service process, as Figure 2As shown in the figure, after the process execution unit 101 obtains the service information, the service processing in the service process obtains the service information, and obtains each service node corresponding to the service type from the service flow definition in the rule library 102 according to the service type in the service information. Further, the preprocessing in the service process obtains the execution relationship between each service node and each sub-process corresponding to each service node from the service flow definition in the rule library 102 according to the service parameters in the service information and each service node corresponding to the service type, and generates the execution basis for each sub-process according to the rule definition in the service flow definition and the execution relationship between each sub-process corresponding to each service node. In this way, the service sub-process obtains the process definition file corresponding to the currently to-be-executed sub-process from the rule library 102 according to the execution basis, and executes the currently to-be-executed sub-process according to the process definition file. Assume that the currently to-be-executed sub-process corresponds to Figure 3 sub-process 1 in it. Then, obtain the process definition file of sub-process 1 from the rule library 102 according to sub-process 1, and execute sub-process 1 according to the process definition file; then, the calculation sub-process rule determines that the service processing is not completed according to the execution basis, and returns to the preprocessing in the service process; after that, the service sub-process obtains the process definition file of sub-process 2 from the rule library 102 according to the execution basis, and executes sub-process 2 according to the process definition file; the calculation sub-process rule determines that the service processing is not completed according to the execution basis, and returns to the preprocessing in the service process; then, the service sub-process obtains the process definition files of sub-process 3, sub-process 4, and sub-process 5 from the rule library 102 according to the execution basis, and executes sub-process 3, sub-process 4, and sub-process 5 in parallel according to the process definition files; finally, the calculation sub-process rule determines that the service processing is completed according to the execution basis. Perform process end processing. Among them, Figure 2 the service process in it can be a service process model, and the service process model can obtain and execute corresponding sub-processes according to the input service information; among them, the work of obtaining the execution relationship between each service node and each sub-process corresponding to each service node from the service flow definition in the rule library 102 according to the service parameters in the service information and each service node corresponding to the service type in the preprocessing of the service process model can be processed in the service processing, or a service process processing node can be added to the service process model; the form of the service process model here is not specifically limited.

[0037] Based on this, an embodiment of the present application provides a process of a service processing method, as Figure 4 shown, including:

[0038] Step 401, receive service information, where the service information is used to trigger a service process;

[0039] Here, the service information includes the service type of service processing and the related parameters of the service. For example, the service type of leave application service processing is leave application, and the service-related parameters are the number of leave days, the start time of leave, the end time of leave, the department where the applicant is located, the remaining annual leave days of the applicant, and so on. When the service processing in the service process receives the service information, the service processing begins.

[0040] Step 402: Determine the execution relationship between each service node for processing the service process and each sub-process corresponding to each service node from the pre-configured service flow definition according to the service information;

[0041] Here, the service flow definition can be pre-configured and can be changed as needed in the application. In this way, the execution relationship between each service node and each sub-process corresponding to each service node can be changed, increasing the flexibility of service processing, making the change of the execution relationship between each service node and each sub-process corresponding to each service node easier, reducing the workload of technicians for changing the execution relationship and shortening the change cycle. Here, the change of the pre-configured service flow definition can be changed through the corresponding preset management program, and the specific change method of the service flow definition is not limited.

[0042] Step 403: Execute their respective sub-processes through the respective service nodes according to the execution relationship between the sub-processes, so as to complete the service process.

[0043] Here, as Figure 3 shown in the schematic diagram of the service sub-process architecture, in a possible design, if the service processing is leave application service processing, then sub-process 1 is the approval process of the direct superior department of the applicant, and the direct superior department is the first service node; sub-process 2 is the personnel approval process, and the personnel department is the second service node; sub-processes 3, 4, and 5 are the approval processes of the finance department, and the finance department is the third service node; execute sub-process 1 of the first service node and sub-process 2 of the second service node in a serial execution relationship, and then execute sub-processes 3, 4, and 5 in the third service node in parallel; thus completing the service process of leave application service processing.

[0044] Using the above method, after receiving the service information, the service process is triggered, and then the execution relationship between each service node corresponding to the service information and each sub-process corresponding to each service node is obtained from the pre-configured service flow definition. Furthermore, each sub-process is executed according to the execution relationship to complete the service process. In this way, when the execution order of the service node or sub-process in the service processing needs to be changed, the execution relationship can be directly adjusted to achieve the change of the service process. It increases the flexibility of service processing, realizes the dynamic approval of service processing, and reduces the cost of maintaining service processing logic.

[0045] The embodiments of the present application provide a process of a service processing method. According to the service information, the execution relationships between each service node for processing the service process and each sub-process corresponding to each service node are determined from a pre-configured service flow definition, including: determining each service node in the service process from a pre-configured process node definition according to the service type in the service information; and determining the execution relationships between each sub-process corresponding to each service node from a pre-configured process flow definition according to the service parameters in the service information and each service node.

[0046] Here, the pre-configured service flow definition may further include a process node definition and a process flow definition. The process node definition includes the service nodes corresponding to each service type and the execution relationships of each service node. In this way, after obtaining the service information, the corresponding service nodes and the execution relationships of each service node can be determined according to the service type in the service information. The process flow definition includes the sub-processes included in each service node under different service parameters and the execution relationships of each sub-process. In this way, after obtaining the service parameters and each service node, the execution relationships between each service node and the sub-processes of each service node can be determined according to the service parameters and each service node. Here, the execution relationships of each service node can also be stored in the process flow definition. The stored contents of the process node definition and the process flow definition can be adjusted as needed, and are not specifically limited. In this way, the adjustability of service processing is greatly increased, making the service processing dynamic and reducing the cost of maintaining service processing logic.

[0047] The embodiments of the present application provide a process of a service processing method, where the service flow definition further includes the completion conditions of the service process; and by each service node executing its respective sub-processes, it includes: monitoring the execution status of each sub-process; determining the next sub-process according to the execution status of each sub-process; or, when determining that the execution status of each sub-process meets the completion conditions, ending the service process.

[0048] Here, the service flow definition may further include the completion conditions of the service process. For example, if the completion ratio is 30.33%, the completion ratio can be obtained from the pre-processing or calculation sub-process rules in the service process; in this way, Figure 2 if any one of sub-process 3, sub-process 4, and sub-process 5 in the service process is completed, the calculation sub-process rules determine to perform process end processing; or if there is a sub-process 6 after sub-process 3, sub-process 4, and sub-process 5, after any one of sub-process 3, sub-process 4, and sub-process 5 is completed, the calculation sub-process rules determine to execute the next sub-process, return to the pre-processing, and the service sub-process continues to execute sub-process 6. Or, if the completion ratio is 100%, in this way, Figure 3 Figure 3 ​Only when sub-process 3, sub-process 4, and sub-process 5 are all completed, the calculation sub-process rule will determine to end the process; or there is a sub-process 6 after sub-process 3, sub-process 4, and sub-process 5. In a sub-process 6, after any one of sub-process 3, sub-process 4, and sub-process 5 is completed, the calculation sub-process rule will determine to execute the next sub-process, return to the previous processing, and the business sub-process will continue to execute sub-process 6.

[0049] An embodiment of the present application provides a process of a business processing method, wherein the business flow definition also includes a process definition file of a sub-process; each sub-process is executed through each business node, including: for any business node, calling the process definition file of the sub-process of the business node, and executing the sub-process based on a process engine and the process definition file; wherein a task prerequisite is set in the process definition file, and the task prerequisite is used to determine whether the transferred sub-process needs to be executed.

[0050] Here, the business flow definition can also include the process definition files of each sub-process. In this way, when business processing is performed through the business process, the business sub-process can obtain the process definition files of the sub-process that needs to be executed from the business flow definition in sequence according to the execution relationship. In this way, the process definition files of each sub-process are decoupled, the difficulty of writing process definition files is reduced, and the flexibility of business processing is improved. The process engine can be divided into multiple; such as Figure 2 The business process can correspond to a process engine, each business node in the business sub-process can correspond to a process engine, and each sub-process can correspond to a process engine respectively. The specific implementation of the process engine is not limited here. The process engine can route the execution order of each node, each business node, each sub-process, and the nodes in the sub-process of the business process according to the process definition file to ensure the accuracy of business processing. You can also set TaskListener (listener) and JavaDelegat (event driver) in the process engine to asynchronously calculate the process flow data, and drive the process flow through the JavaDelegat that comes with the process engine. Among them, the process engine can also be used as a part of the application system, and provide it with core solutions that have a decisive effect on each application system, such as determining the information transmission route and content level according to different roles, division of labor and conditions. The process engine includes important functions such as process node management, flow management, and process sample management.

[0051] The embodiment of the present invention also provides a schematic diagram of the architecture of a sub-process, such as Figure 5 As shown, the process definition file of the sub-process is set with a task predecessor, which is the name of the task to be executed in the sub-process. Among them, by calculating the next task, it is determined whether there are any unexecuted tasks in the sub-process. Until all tasks of the sub-process are executed, the process flow is transferred to the calculation sub-process rule of the business process, such as Figure 2The calculation sub - process rules of the business process therein are used to determine the next sub - process to be executed. Here, task pre - conditions can include assistance, transfer, joint signature, etc., which are used to determine whether a transferred sub - process needs to be executed. And sub - processes can also be set within sub - processes; for example, in Figure 4 In the example of leave business processing in the process, sub - process 2 of the business node of the human resources department is the process approved by the human resources department manager; task sub - process 1 can also be set in sub - process 2, as Figure 6 shown, Figure 6 In sub - process 2 therein, process changes such as transfer and assistance can occur, corresponding to generating a task sub - process, for example, the process approved by the supervisor of the human resources department; task sub - process 2 can also be set in task sub - process 1, for example, the process approved by the person in charge of the human resources department. In this way, sub - processes can be nested in business processes, task sub - processes can be nested in sub - processes, and task sub - processes can also be nested in task sub - processes. However, a task sub - process nested in a task sub - process is still a task sub - process, a task sub - process nested in a sub - process is still a sub - process, and a sub - process nested in a business process is still a business process. Sub - processes and \ task sub - processes can be infinitely nested to expand sub - processes and \ task sub - processes. That is, by adopting this recursive algorithm, multiple - instance sub - processes that can include serial and \ or parallel sub - processes and multiple - instance task sub - processes (such as joint signature, transfer, etc.) that are serial and \ or parallel are continuously generated until the end conditions of each sub - process or each task sub - process are reached. In this way, by recursively executing sub - processes and task sub - processes, not only the flexibility of business processing is ensured, but also the simplicity of rule calculation is achieved through the recursive method, and at the same time, the consistency of the judgment logic of each sub - process and each task sub - process is ensured. Among them, in order to ensure the consistency of rule calculation, the input and output of sub - processes and task sub - processes are uniformly calculated through Figure 2 , Figure 5 the "pre - processing" and "task pre - conditions" in.

[0052] The embodiment of the present application provides a process of a business processing method. The business flow definition also includes rule definition; according to the execution relationship between the sub - processes, each business node executes its own sub - process, including: generating the execution basis of each sub - process according to the rule definition and the execution relationship between the sub - processes; wherein, the execution basis includes the inter - node sequence of the node where the sub - process is located, the serial - parallel relationship and the serial - parallel quantity between the sub - processes located at the same node; each business node executes its own sub - process according to the execution basis of its own sub - process.

[0053] Here, the business process definition may also include rule definitions; in the rule definitions, markers corresponding to the execution relationships of each business node and markers corresponding to the execution relationships of each sub-process in each business node can be defined; in this way, based on the execution relationships of each business node and each sub-process and the rule definitions, each business node and each sub-process are assigned values to generate the execution basis. For example, in the previous example, the leave application process contains three business nodes, namely the direct department, the human resources department, and the finance department, which correspond to sub-process 1, sub-process 2, sub-process 3, sub-process 4, and sub-process 5 respectively. Then the assignment corresponding to the direct department is 1, the assignment corresponding to the human resources department is 2, and the assignment corresponding to the finance department is 3. In this way, sub-process 1 is assigned 1-1-1-0-1, that is, the first 1 indicates that sub-process 1 is in the first business node, the direct department; the second 1 indicates that the number of parallel sub-processes of sub-process 1 in this business node is 1, that is, only sub-process 1; the third 1 indicates that sub-process 1 is the first serial sub-process in this business node; the fourth 0 indicates whether sub-process 1 is a transferred sub-process. 0 can be used to indicate that sub-process 1 is not a transferred sub-process, and 1 can be used to indicate that sub-process 1 has been transferred once. If it has been transferred twice, then the fourth digit is 2. In this way, the fourth digit can mark the number of transfers and can also record the transfer path to facilitate subsequent tracking of the node that initiated the transfer; the fifth 1 can mark the number of completed sub-processes, that is, when sub-process 1 is completed, this business node is completed; sub-process 2 is assigned 2-1-1-0-1; sub-process 3 is assigned 3-1-1-0-3; sub-process 4 is assigned 3-2-1-0-3; sub-process 5 is assigned 3-3-1-0-3. In the third business node, because sub-process 3, sub-process 4, and sub-process 5 all need to be completed to complete this business node, so the fifth digit is 3; if there is a serial sub-process 6 after sub-process 5 in this business node, then sub-process 6 is assigned 3-3-2-0-3. The rule definition of the above example can be uniformly implemented using the rule calculator RuleCompareListener. The specific implementation solution is as follows: In the rule definition, a taskSequence variable can be defined. This variable consists of 5 digits (such as 3-3-2-0-3), and each digit has corresponding meanings:

[0054] The first digit: the sequence of the current business node, from 1 to n. For example, in the above example, the assignment corresponding to the direct department is 1, the assignment corresponding to the human resources department is 2, and the assignment corresponding to the finance department is 3. Then the execution sequence is the direct department business node - the human resources department business node - the finance department business node;

[0055] Second digit: Number of parallel sub - processes (the first digit is the same - for the same business node, different second digits indicate the existence of parallel sub - processes). In the previous example, sub - processes 3, 4, and 5 are processed in parallel; sub - process 3 is assigned 3 - 1 - 1 - 0 - 3; sub - process 4 is assigned 3 - 2 - 1 - 0 - 3; sub - process 5 is assigned 3 - 3 - 1 - 0 - 3.

[0056] Third digit: The order of sequential sub - processes in the business node. In the previous example, sub - process 5 is assigned 3 - 3 - 1 - 0 - 3. If there is a sequential sub - process 6 after sub - process 5 of this business node, then sub - process 6 is assigned 3 - 3 - 2 - 0 - 3.

[0057] Fourth digit: Whether to forward, default is 0. If there are process change functions such as transfer, assistance, countersignature, etc., for each implementation of the process change function, it is incremented by 1. A non - zero value indicates that a parallel sub - process has been added to the sub - process; a value of 0 indicates that the process change function has not been implemented.

[0058] Fifth digit: The number of parallel sub - processes that need to be completed. After completing this quantity, the sub - processes that generate the current business node end. The calculation method for the fifth digit is: x = Math.ceil(y * p), where y is the number of sub - processes of this business node, and p is the completion ratio of the sub - processes of this business node defined in the rules. In the previous example, sub - processes 3, 4, and 5 are processed in parallel, and the completion ratio of the sub - processes of this business node defined in the rules is 0.6. x = Math.ceil(3 * 0.6)≈2, the 5th digit is 2. Two of the sub - processes need to be completed to end this business process. Then sub - process 3 is assigned 3 - 1 - 1 - 0 - 2; sub - process 4 is assigned 3 - 2 - 1 - 0 - 2; sub - process 5 is assigned 3 - 3 - 1 - 0 - 2.

[0059] In addition, when the process change function is implemented once, 4 parallel sub-processes are generated. Then L (number of sub-processes to be completed) = Math.ceil(M * (N + 1) * P), where P represents the completion ratio of the parallel sub-processes including assistance, transfer, etc., M (number of parallel sub-processes) = taskSequence.get(2), which is generated from the second position of taskSequence and is 4; N (number of sub-processes for implementing the process change function) = taskSequence.get(4), which is generated from the fourth position of taskSequence and is 1. In the previous example, 3 people approve in parallel, and there is one transfer (a total of 4 parallel sub-processes including the sub-process after one transfer and the original sub-process), P = 50%. Then L = 3 * 2 * 0.5 = 3, and a total of 3 sub-processes need to be completed. That is: among the original sub-process 3, sub-process 4, sub-process 5, and 1 transfer sub-process, 3 sub-processes need to be completed. For example, when one sub-process that initiates a transfer has been completed, actually only two more original sub-processes need to be completed to finish this business node, that is: nrOfCompletedInstances + 1 >= nrOfNeededInstances. In this way, the above assignment rule can be an implementation method for determining the execution basis according to the rule definition and the serial and / or parallel execution relationships of each sub-process, and specific limitations are not made.

[0060] The embodiment of the present application provides a rule definition, and the rule definition further includes the completion ratio of the business node and whether each sub-process has a process change function; the completion ratio of the business node is used to indicate that when each sub-process with a parallel execution relationship in the business node meets the completion ratio of the business node, the task of the business node ends; the process change function is used to indicate whether the sub-process initiates a sub-process again.

[0061] Here, the rule definition further includes the completion ratio of the business node and whether each sub-process has a process change function. In this way, when in a business node in the business processing rule that includes multiple parallel sub-processes, only part of the sub-processes need to be completed to determine that the business node is processed, then the completion ratio can be set or changed in the rule definition accordingly. If a business sub-process in the business processing rule needs a process change, the sub-process can initiate a sub-process again by calling the process change function in the rule definition. Among them, the process change function can include assistance handling, transfer handling, conversion to meeting handling, countersignature handling, etc., and specific limitations are not made here for the process change function.

[0062] The embodiment of the present application provides a method for configuring a business process definition, further including: receiving a configuration instruction; and updating the business process definition according to the configuration instruction.

[0063] Here, the business process definition may include process node definitions, process flow definitions, definition files for each sub - process, and rule definitions. In this way, through configuration instructions, the process node definitions, process flow definitions, definition files for each sub - process, and rule definitions can be updated. This enables the business processing to achieve maximum flexibility; and compared with the prior art where the process definition files are coupled, in the embodiments of the present application, technicians do not need to face complex process files. They only need to directly configure the business processing in the business process definition through configuration instructions, which greatly reduces the workload, shortens the business processing update cycle; and increases the reusability of the process definition files for each sub - process.

[0064] Based on the above process, an embodiment of the present application provides a process of a business processing method, as Figure 7 shown, including:

[0065] Step 701, receive business information.

[0066] Step 702, determine a business node from the process node definitions in the business process definition according to the business type in the business information.

[0067] Step 703, determine the execution relationships between each business node and each sub - process of each business node from the process flow definitions in the business process definition according to the business parameters in the business information and each business node.

[0068] Step 704, determine the execution basis according to the rule definitions in the business process definition, each business node, and the execution relationships between each sub - process of each business node.

[0069] Step 705, determine the currently to - be - executed sub - process according to the execution basis and execute the sub - process.

[0070] Step 706, determine whether there are still unexecuted sub - processes. If so, return to Step 705; if not, execute Step 707.

[0071] Step 707, the business processing process ends.

[0072] Based on the same concept, an embodiment of the present application provides a business processing device, Figure 8 which is a schematic diagram of a business processing provided for an embodiment of the present application, as Figure 8 shown, including:

[0073] A transceiver module 801, configured to receive business information, where the business information is used to trigger a business process;

[0074] A processing module 802, configured to determine the execution relationships between each business node for processing the business process and each sub - process corresponding to each business node from the pre - configured business process definition according to the business information;

[0075] The processing module 802 is further configured to execute the respective sub-processes through the service nodes according to the execution relationship between the sub-processes, thereby completing the service process.

[0076] In a possible design, the processing module 802 is specifically configured to:

[0077] According to the business type in the business information, each business node in the business process is determined from a pre-configured process node definition; according to the business parameters in the business information and each business node, the execution relationship between each sub-process corresponding to each business node is determined from a pre-configured process flow definition.

[0078] In one possible design, the processing module 802 is specifically used to: monitor the execution status of each sub-process; determine the next sub-process based on the execution status of each sub-process; or, when it is determined that the execution status of each sub-process meets the completion condition, end the business process.

[0079] In one possible design, the processing module 802 is specifically used to: for any business node, call the process definition file of the sub-process of the business node, and execute the sub-process based on the process engine and the process definition file; wherein, a task prerequisite is set in the process definition file, and the task prerequisite is used to determine whether the transferred sub-process needs to be executed.

[0080] In a possible design, the processing module 802 is specifically configured to:

[0081] According to the rule definition and the execution relationship between the sub-processes, the execution basis of each sub-process is generated; wherein the execution basis includes the node order of the node where the sub-process is located, the serial-parallel relationship and the serial-parallel number of the sub-processes located at the same node; each business node executes its own sub-process according to the execution basis of its own sub-process. In a possible design, the processing module 802 is specifically used for: the rule definition also includes the completion ratio of the business node and whether each sub-process has a process change function; the completion ratio of the business node is used to indicate that when each sub-process with a parallel execution relationship in the business node meets the completion ratio of the business node, the task of the business node ends; the process change function is used to indicate whether the sub-process initiates the sub-process again.

[0082] In a possible design, the transceiver module 801 is also used to: receive configuration instructions; and update the service flow definition according to the configuration instructions.

[0083] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) that contain computer-usable program code.

[0084] The present application is described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram, as well as the combination of flows and / or blocks in the flowchart and / or block diagram, can be realized by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing devices generate a device for realizing the functions specified in Figure 1 one or more of the flows Figure 1 or blocks or the combination of blocks.

[0085] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing devices to work in a specific manner, such that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device that realizes the functions specified in Figure 1 one or more of the flows Figure 1 or blocks or the combination of blocks.

[0086] These computer program instructions can also be loaded onto a computer or other programmable data processing devices, such that a series of operation steps are executed on the computer or other programmable devices to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable devices provide steps for realizing the functions specified in Figure 1 one or more of the flows Figure 1 or blocks or the combination of blocks.

[0087] Obviously, those skilled in the art can make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application is also intended to include these modifications and variations.

Claims

1. A business processing method, characterized in that, it includes: Receiving business information, where the business information is used to trigger a business process; According to the business information, determining the execution relationship between each business node for processing the business process and each sub-process corresponding to each business node from a pre-configured business process definition; According to the execution relationship between the sub-processes, each business node executes its respective sub-process through the respective business nodes, thereby completing the business process; Among them, according to the business information, determining the execution relationship between each business node for processing the business process and each sub-process corresponding to each business node from a pre-configured business process definition includes: According to the business type in the business information, determining each business node in the business process from a pre-configured process node definition; According to the business parameters in the business information and each business node, determining the execution relationship between each sub-process corresponding to each business node from a pre-configured process flow definition; The method further includes: receiving a configuration instruction; according to the configuration instruction, updating the business process definition; The business process definition further includes a process definition file of the sub-process; Executing each sub-process through the respective business nodes includes: For any business node, calling the process definition file of the sub-process of the business node, and based on a process engine and the process definition file, executing the sub-process; wherein, a task precondition is set in the process definition file, and the task precondition is used to determine whether a sub-process to be transferred needs to be executed; the process engine routes the execution order of each sub-process and nodes within the sub-process of the business process according to the process definition file; The business process definition further includes a rule definition; According to the execution relationship between the sub-processes, executing each sub-process through the respective business nodes includes: According to the rule definition and the execution relationship between the sub-processes, generating an execution basis for each sub-process; wherein, the execution basis includes the inter-node order of the node where the sub-process is located, the serial-parallel relationship and the number of serial-parallel of each sub-process located at the same node; Each business node executes its respective sub-process according to the execution basis of its respective sub-process.

2. The method according to claim 1, characterized in that, The business process definition further includes a completion condition of the business process; executing each sub-process through the respective business nodes includes: Monitoring the execution status of each sub-process; According to the execution status of each sub-process, determining the next sub-process; or, when it is determined that the execution status of each sub-process meets the completion condition, ending the business process.

3. The method according to claim 1, characterized in that, it includes: The rule definition further includes the completion ratio of the business node and whether each sub-process has a process change function; The completion ratio of the business node is used to indicate that when the completion ratio of the business node is met for each sub-process with a parallel execution relationship in the business node, the task of the business node ends; The process change function is used to indicate whether the sub-process initiates a sub-process again.

4. A business processing device, characterized in that, the device includes: A transceiver module for receiving service information for triggering a service process; A processing module for determining, according to the service information, the execution relationship between each service node for processing the service process and each sub-process corresponding to each service node from a pre-configured service flow definition; The processing module is further configured to complete the service process by executing respective sub-processes of each service node according to the execution relationship between the sub-processes; Specifically, the processing module is configured to determine each service node in the service process from a pre-configured process node definition according to the service type in the service information; Determine the execution relationship between each sub-process corresponding to each service node from a pre-configured process flow definition according to the service parameters in the service information and each service node; A receiving module for receiving a configuration instruction; the processing module is further configured to update the service flow definition; Specifically, the processing module is configured to, for any service node, call a process definition file of the sub-process of the service node, and execute the sub-process based on a process engine and the process definition file; wherein, a task precondition is set in the process definition file, and the task precondition is used to determine whether a sub-process to be transferred needs to be executed; the process engine routes the execution order of each sub-process of the service process and the nodes within the sub-process according to the process definition file; generate an execution basis for each sub-process according to a rule definition and the execution relationship between the sub-processes; wherein, the execution basis includes the inter-node order of the node where the sub-process is located, the serial / parallel relationship and the serial / parallel quantity between each sub-process located at the same node; Each service node executes its respective sub-process according to the execution basis of its respective sub-process.

5. A computer-readable storage medium, characterized in that the storage medium stores a program, and when the program runs on a computer, the computer is caused to implement the method according to any one of claims 1 to 3.

6. A computer device, characterized in that comprising: a memory for storing a computer program; a processor for calling the computer program stored in the memory and executing the method according to any one of claims 1 to 3 according to the obtained program.

Images