CN111754200A - Service processing method and device - Google Patents

Service processing method and device Download PDF

Info

Publication number
CN111754200A
CN111754200A CN202010607775.0A CN202010607775A CN111754200A CN 111754200 A CN111754200 A CN 111754200A CN 202010607775 A CN202010607775 A CN 202010607775A CN 111754200 A CN111754200 A CN 111754200A
Authority
CN
China
Prior art keywords
service
sub
flow
execution
processes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010607775.0A
Other languages
Chinese (zh)
Inventor
宁汉平
卢道和
谢波
朱敏毅
李万龙
蔡源尉
谢余平
沈卫华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
WeBank Co Ltd
Original Assignee
WeBank Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by WeBank Co Ltd filed Critical WeBank Co Ltd
Priority to CN202010607775.0A priority Critical patent/CN111754200A/en
Publication of CN111754200A publication Critical patent/CN111754200A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/02Banking, e.g. interest calculation or account maintenance

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Accounting & Taxation (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Finance (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Data Mining & Analysis (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Technology Law (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The embodiment of the invention provides a service processing method and a device, wherein the method comprises the following steps: receiving service information, wherein the service information is used for triggering a service process; determining each service node for processing the service flow and the execution relation among each sub-flow corresponding to each service node from a service flow definition configured in advance according to the service information; thus, according to the execution relation among the sub-processes, the respective sub-process is executed through the service nodes, and the service process is completed. By adopting the method, when the execution sequence of the service nodes or the sub-processes in the service processing needs to be changed, the execution relation can be directly adjusted, and the change of the service process can be realized. The flexibility of service processing is increased, and the maintenance cost of service processing logic is reduced.

Description

Service processing method and device
Technical Field
The present application relates to the field of computer technologies in financial technology (Fintech), and in particular, to a method and an apparatus for processing a service.
Background
In recent years, with the development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually changing to financial technology (Fintech), but higher requirements are also put on the technologies due to the requirements of the financial industry on safety and real-time performance. However, as more manual business processes are converted into business processes performed by a computer technology, the logic of the business processes correspondingly executed by the computer is more complex, and the compiling of the process definition file of the business processes is more complex; accordingly, updating of the process definition file of the business process performed by the computer becomes more difficult.
In the prior art, the approval service for performing service processing through a computer technology includes approval for leave request service, approval for payment request service, planning service approval, and the like. Taking the examination and approval of the material payment service as an example, the examination and approval of the material payment service is generally carried out by a direct manager of a department where a material payment initiator is located, a manager of a material management department and a manager of a financial department, and each department may have a plurality of managers and responsible persons for examination and approval together. Therefore, after the material payment initiator initiates the material payment service, since the approval process needs to be limited for the scene, the computer needs to execute a very complex process definition file of the service process including approval of each department manager and the responsible person, so as to complete the service process. And once the business process or the business rule is changed, the process definition file of the business process needs to be changed. Due to the complexity of the process definition file of the business processing, the workload of technical personnel for changing the process definition file is large, and the period for changing the process definition file is long.
Disclosure of Invention
The embodiment of the invention provides a service processing method and a service processing device, which are used for increasing the flexibility of service processing and reducing the maintenance cost of service processing logic.
In a first aspect, an embodiment of the present invention provides a service processing method, where the method includes:
receiving service information, wherein the service information is used for triggering a service process; determining each service node for processing the service flow and the execution relation among each sub-flow corresponding to each service node from a service flow definition configured in advance according to the service information; and executing the respective sub-processes through the service nodes according to the execution relation among the sub-processes, thereby completing the service processes.
By adopting the method, after the business information is received, the business process is triggered, the execution relation between each business node corresponding to the business information and each sub-process corresponding to each business node is further obtained from the preset business flow definition, and further, each sub-process is executed according to the execution relation to complete the business process. Therefore, when the execution sequence of the service nodes or the sub-processes in the service processing needs to be changed, the execution relation can be directly adjusted, and the change of the service process can be realized. The flexibility of service processing is increased, and the maintenance cost of service processing logic is reduced.
In one possible design, determining, according to the service information, an execution relationship between each service node that processes the service flow and each sub-flow corresponding to each service node from a service flow definition configured in advance includes: determining each service node in the service flow from a preset flow node definition according to the service type in the service information; and determining the execution relation between the sub-processes corresponding to the service nodes from the pre-configured process flow direction definition according to the service parameters in the service information and the service nodes.
By adopting the method, the service node related to the service type can be obtained through the service type, and further, the execution relation of each sub-process is specifically determined according to specific service parameters. That is to say, a service node corresponding to a service type may be preset in a service flow definition configured in advance, and the service node may correspond to different sub-process execution relationships under different service parameters. Therefore, the determination of the execution relation among the sub-processes is accelerated, and the service processing speed is accelerated.
In one possible design, the service flow definition further includes a completion condition of the service flow; executing respective sub-processes by the service nodes, including: monitoring the execution condition of each sub-process; determining the next sub-process according to the execution condition of each sub-process; or, when the execution condition of each sub-process is determined to meet the completion condition, ending the business process.
By adopting the method, the integrity of the business processing corresponding to the business flow can be ensured by monitoring the execution condition of the sub-flow, and the accuracy of the business processing is ensured on the premise of improving the flexibility of the business processing.
In one possible design, the service flow definition further includes a flow definition file of a sub-flow; executing respective sub-processes by the service nodes, including: calling a flow definition file of a sub-flow of the service node aiming at any service node, and executing the sub-flow based on a flow engine of the sub-flow and the flow definition file; the flow definition file is provided with a task front, and the task front is used for determining whether a sub-flow of transfer needs to be executed.
By adopting the method, after the execution relation of each sub-process is obtained, the process definition file of each sub-process is called according to the execution relation, and the sub-process is executed based on the process engine and the process definition file. Therefore, when the sub-process logic in the business process is changed, 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 changed. The process definition file of each sub-process is far smaller than the process definition file corresponding to the whole business process; therefore, compared with the prior art that the flow definition file of the whole business process is changed, the flow definition file corresponding to the sub-flow is directly modified, so that the workload of technical workers is greatly reduced, and the flow definition file can be rapidly updated.
In one possible design, a rule definition is further included in the service flow definition; executing respective sub-processes through the service nodes according to the execution relation among the sub-processes, wherein the execution relation comprises the following steps: generating an execution basis of each sub-process according to the rule definition and the execution relation between each sub-process; the execution is carried out according to the sequence among the nodes of the nodes where the sub-processes are located, the serial-parallel relation among the sub-processes located in the same node and the serial-parallel quantity; and the service nodes execute respective sub-processes according to the execution basis of the respective sub-processes.
By adopting the method, the service flow definition comprises the rule definition, the execution basis of each sub-process is generated according to the rule definition and the execution relation among the sub-processes, so that each sub-process in each node is sequentially executed according to the node of the node where the sub-process in the execution basis is positioned, and each sub-process in the node is executed according to the serial-parallel relation and the serial-parallel quantity among the sub-processes of the same node in the execution basis. Therefore, each subsequent sub-process can be accurately and orderly executed according to the execution basis, and the order and the accuracy of the execution of the business process are ensured. In a possible design, the rule definition further includes a completion ratio of the service node and whether each sub-process has a process change function; the completion proportion of the service node is used for indicating that when the completion proportion of the service node is met by each sub-process with parallel execution relation, the task of the service node is ended; the flow change function is used for indicating whether the sub-flow initiates the sub-flow again.
By adopting the method, the rule definition can also comprise the completion proportion of the service node. Therefore, the completion ratio can be set in the rule definition, so that each sub-process executed in parallel can execute a part of sub-processes or all sub-processes, and then the task of the service node is ended. Therefore, the completion number of each sub-process executed in parallel can be flexibly determined by setting the completion proportion, the flexibility of service processing is increased, and the maintenance cost of service processing logic is reduced. The rule definition may further include whether each sub-process has a process change function. Therefore, when the sub-process is a transfer sub-process, the sub-process can be instructed to initiate the sub-process again through the process change function, and further, when the original sub-process transferred to the sub-process needs to be traced, the original sub-process can be determined according to the instruction information of the process change function.
In one possible design, further comprising: receiving a configuration instruction; and updating the service flow definition according to the configuration instruction.
By adopting the method, the service flow definition is updated by receiving the configuration instruction. Compared with the prior art, the method is directly updated in the process definition file of the business processing. The flexibility of service processing can be increased, and the maintenance cost of service processing logic can be reduced.
In a second aspect, an embodiment of the present invention provides a service processing apparatus, where the apparatus includes:
the receiving and sending module is used for receiving service information, and the service information is used for triggering a service process;
the processing module is used for determining execution relations among all service nodes for processing the service flow and all sub-flows corresponding to the service nodes from a service flow definition configured in advance according to the service information;
the processing module is further configured to execute the respective sub-process through each service node according to the execution relationship among the sub-processes, thereby completing the service process.
In a third aspect, an embodiment of the present invention further provides a computing device, including: a memory for storing a computer program; a processor for calling the computer program stored in said memory and executing the method as described in the various possible designs of the first aspect according to the obtained program.
In a fourth aspect, embodiments of the present invention also provide a computer-readable non-volatile storage medium, which includes a computer-readable program, which, when read and executed by a computer, causes the computer to perform the method as set forth in the various possible designs of the first aspect.
These and other implementations of the invention will be more readily understood from the following description of the embodiments.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a schematic structural diagram of a service processing method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a business process according to an embodiment of the present invention;
fig. 3 is a schematic diagram of an architecture of a business sub-process in a business process according to an embodiment of the present invention;
fig. 4 is a schematic flowchart of a service processing method according to an embodiment of the present invention;
FIG. 5 is a block diagram of a sub-process according to an embodiment of the present invention;
FIG. 6 is a block diagram illustrating another sub-process according to an embodiment of the present invention;
fig. 7 is a schematic flowchart of a service processing method according to an embodiment of the present invention;
fig. 8 is a schematic diagram of a service processing apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, a flow execution unit 101 may include a service flow and a flow engine of the service flow; as shown in fig. 2, 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 base 102 according to the service type in the service information. Further, the pre-processing in the service flow obtains the execution relationship between each service node and each sub-flow corresponding to each service node from the service flow definition in the rule base 102 according to the service parameters in the service information and each service node corresponding to the service type, and generates the execution basis of each sub-flow according to the rule definition in the service flow definition and the execution relationship between each sub-flow corresponding to each service node. Thus, the business sub-process obtains the process definition file corresponding to the currently executed sub-process from the rule base 102 according to the execution basis, and executes the currently executed sub-process according to the process definition file. Assuming that the sub-process to be executed at present corresponds to the sub-process 1 in fig. 3, acquiring a process definition file of the sub-process 1 from the rule base 102 according to the sub-process 1, and executing the sub-process 1 according to the process definition file; then, calculating the sub-process rule to determine that the business processing is not completed according to the execution basis, and returning to the pre-processing in the business process; then, the business sub-process obtains the process definition file of the sub-process 2 from the rule base 102 according to the execution basis, and executes the sub-process 2 according to the process definition file; calculating a sub-process rule, determining that the business processing is not completed according to an execution basis, and returning to the pre-processing in the business process; then, the business sub-process obtains the process definition files of the sub-process 3, the sub-process 4 and the sub-process 5 from the rule base 102 according to the execution basis, and executes the sub-process 3, the sub-process 4 and the sub-process 5 in parallel according to the process definition files; and finally, calculating the sub-process rule to determine that the business processing is finished according to the execution basis. The flow end processing is performed. The business process in fig. 2 may be a business process model, and the business process model may obtain and execute a corresponding sub-process according to the input business information; in the business process model preprocessing, according to the business parameters in the business information and the business nodes corresponding to the business types, the business process model preprocessing can acquire the business nodes and the execution relation between the sub-processes corresponding to the business nodes from the business flow definition in the rule base 102, and can process the business process or add the business process processing nodes in the business process model; the form of the business process model is not particularly limited herein.
Based on this, an embodiment of the present application provides a flow of a service processing method, as shown in fig. 4, including:
step 401, receiving service information, wherein the service information is used for triggering a service process;
here, the service information includes a service type of the service process and related parameters of the service, for example, a service type of the leave service process is leave, and the related parameters of the service are leave days, leave start time, leave deadline, department of leave, annual leave remaining days of leave, and so on. And when the service processing in the service flow receives the service information, the service processing is started.
Step 402, according to the service information, determining each service node for processing the service flow and the execution relation between each sub-flow corresponding to each service node from a service flow definition configured in advance;
here, the service flow definition may be configured in advance, and may be changed as needed in the application, so as to implement the change of the execution relationship between each service node and each sub-flow corresponding to each service node, increase the flexibility of service processing, make the change of the execution relationship between each service node and each sub-flow corresponding to each service node simpler and more convenient, reduce the workload of technicians for changing the execution relationship, and shorten the change period. Here, the change of the service flow definition configured in advance may be performed through a corresponding preset management program, and the change mode of the service flow definition is not particularly limited.
And 403, executing the respective sub-processes through the service nodes according to the execution relation among the sub-processes, thereby completing the service process.
Here, as shown in the schematic diagram of the business sub-process architecture shown in fig. 3, in a possible design, if the business process is a leave-asking business process, the sub-process 1 is an approval process of a directly subordinate department of a leave-asking person, and the directly subordinate department is a first business node; the sub-process 2 is a personnel examination and approval process, and the personnel department is a second service node; the sub-process 3, the sub-process 4 and the sub-process 5 are approval processes of the financial department, and the financial department is a third service node; executing a sub-process 1 of a first service node and a sub-process 2 of a second service node in a serial execution relation, and then executing a sub-process 3, a sub-process 4 and a sub-process 5 in a third service node in parallel; thereby completing the business process of the leave-asking business processing.
By adopting the method, after the business information is received, the business process is triggered, the execution relation between each business node corresponding to the business information and each sub-process corresponding to each business node is further obtained from the preset business flow definition, and further, each sub-process is executed according to the execution relation to complete the business process. Therefore, when the execution sequence of the service nodes or the sub-processes in the service processing needs to be changed, the execution relation can be directly adjusted, and the change of the service process can be realized. The flexibility of service processing is increased, dynamic approval of the service processing is realized, and the cost of service processing logic maintenance is reduced.
The embodiment of the present application provides a process of a service processing method, where according to the service information, an execution relationship between each service node and each sub-process corresponding to each service node that processes the service process is determined from a service flow definition configured in advance, including: determining each service node in the service flow from a preset flow node definition according to the service type in the service information; and determining the execution relation between the sub-processes corresponding to the service nodes from the pre-configured process flow direction definition according to the service parameters in the service information and the service nodes.
Here, the service flow definition configured in advance may further include a flow node definition and a flow direction definition, where the flow node definition includes service nodes corresponding to each service type and execution relationships of the service nodes. Therefore, after the service information is obtained, the corresponding service node and the execution relation of each service node can be determined according to the service type in the service information. The flow direction definition includes sub-flows included by each service node under different service parameters and the execution relation of each sub-flow. Therefore, after the service parameters and the service nodes are obtained, the execution relation between the service nodes and the sub-processes of the service nodes can be determined according to the service parameters and the service nodes. Here, the execution relationship of each service node may also be stored in the flow direction definition, and the storage contents of the flow node definition and the flow direction definition may be adjusted as needed, and are not particularly limited. Therefore, the adjustability of the service processing is greatly increased, the service processing is dynamic, and the maintenance cost of the service processing logic is reduced.
The embodiment of the application provides a flow of a service processing method, wherein the service flow definition further comprises a service flow completing condition; executing respective sub-processes by the service nodes, including: monitoring the execution condition of each sub-process; determining the next sub-process according to the execution condition of each sub-process; or, when the execution condition of each sub-process is determined to meet the completion condition, ending the business process.
Here, the service flow definition may further include a completion condition of the service flow. For example, if the completion rate is 30.33%, the completion rate can be obtained by pre-processing or calculating sub-process rules in the business process of fig. 2; thus, any one of the sub-process 3, the sub-process 4 and the sub-process 5 in fig. 3 is completed, and if the sub-process rule is calculated, the process end processing is determined; or a sub-process 6 is also existed after the sub-process 3, the sub-process 4 and the sub-process 5, after any one of the sub-process 3, the sub-process 4 and the sub-process 5 is completed, the sub-process rule is calculated, then the next sub-process is determined to be executed, the pre-processing is returned, and the business sub-process continues to execute the sub-process 6. Or, the completion ratio is 100%, so that the sub-process 3, the sub-process 4, and the sub-process 5 in fig. 3 are all completed, and the calculation of the sub-process rule determines to perform the process end processing; or after the sub-process 3, the sub-process 4 and the sub-process 5, a sub-process 6 exists, in the sub-process 6, after any one of the sub-process 3, the sub-process 4 and the sub-process 5 is completed, the sub-process rule is calculated, then the next sub-process is determined to be executed, the pre-processing is returned, and the business sub-process continues to execute the sub-process 6.
The embodiment of the application provides a process of a business processing method, wherein the business flow definition also comprises a process definition file of a sub-process; executing respective sub-processes by the service nodes, including: calling a flow definition file of a sub-flow of the service node aiming at any service node, and executing the sub-flow based on a flow engine and the flow definition file; the flow definition file is provided with a task front, and the task front is used for determining whether a sub-flow of transfer needs to be executed.
Here, the service flow definition may further include a flow definition file of each sub-flow. Therefore, when the business process is used for business processing, the business sub-processes can sequentially acquire the process definition files of the sub-processes which need to be executed currently from the business flow definition according to the execution relation. Therefore, the flow definition files of the sub-flows are decoupled, the writing difficulty of the flow definition files is reduced, and the flexibility of business processing is improved. The flow engine can be divided into a plurality of flow engines; for example, the service process shown in fig. 2 may correspond to a process engine, each service node in a service sub-process may correspond to a process engine, and each sub-process may correspond to a process engine, where the specific implementation of the process engine is not limited. The process engine can route the execution sequence of each node, each service node, each sub-process and the nodes in the sub-process of the service process according to the process definition file, and the accuracy of service processing is ensured. The taskliner and the JavaDelegat can be arranged in the flow engine, flow circulation data are calculated asynchronously, and the flow circulation is driven by the JavaDelegat in the flow engine. The process engine can also be used as a part of the application system and provides core solutions for determining information transfer routes, content levels and the like according to different roles, division and conditions which have determination effects on each application system. The process engine includes important functions of node management, flow direction management, process sample management and the like of the process.
As shown in fig. 5, a task prefix is set in a flow definition file of a sub-flow, and a name of a task to be executed in the sub-flow. Wherein, it is determined whether there are any unexecuted tasks in the sub-process by calculating the next task until all tasks in the sub-process are executed, the process flow is switched to the calculation sub-process rule of the business process, such as the calculation sub-process rule of the business process in fig. 2, and then the next sub-process to be executed is determined. Here, assistance, transfer, countersigning, etc. may be included in the task front-end to determine whether a sub-flow of transfer needs to be performed. And sub-processes can also be set in the sub-processes; for example, in the leave-asking business processing example in the flow of fig. 4, the sub-flow 2 of the personnel department business node is the flow approved by the personnel department manager; a task sub-process 1 may also be set in the sub-process 2, as shown in fig. 6, the sub-process 2 in fig. 6 may be subjected to process changes such as transfer, assistance, and the like, and a task sub-process, for example, a process of approval by a supervisor of a personnel department, is correspondingly generated; a task sub-process 2, such as a process of approval by a person in charge of a personnel department, may also be set in the task sub-process 1. Therefore, sub-processes can be nested in the business process, task sub-processes can be nested in the sub-processes, and task sub-processes can also be nested in the task sub-processes. However, the task sub-process is also a task sub-process in the task sub-process, the task sub-process is also a sub-process in the sub-process, the task sub-process is also a business process in the business process, and the sub-process and/task sub-process can be infinitely nested and expanded. By adopting the recursive algorithm, multi-instance sub-processes which can comprise serial and/or parallel sub-processes, and multi-instance sub-tasks (countersigning, forwarding and the like) of serial and/or parallel task sub-processes are continuously generated until the conditions for ending each sub-process or each task sub-process are reached. Therefore, the sub-processes and the task sub-processes are executed in a recursion mode, the flexibility of service processing is guaranteed, the simplicity of rule calculation is realized in the recursion mode, and the consistency of judgment logics of the sub-processes and the task sub-processes is guaranteed. In order to ensure the consistency of the rule calculation, the input and output of the sub-process and the task sub-process are respectively calculated uniformly by the "pre-processing" and the "task pre-processing" in fig. 2 and 5.
The embodiment of the application provides a flow of a service processing method, wherein the service flow definition also comprises a rule definition; executing respective sub-processes through the service nodes according to the execution relation among the sub-processes, wherein the execution relation comprises the following steps: generating an execution basis of each sub-process according to the rule definition and the execution relation between each sub-process; the execution is carried out according to the sequence among the nodes of the nodes where the sub-processes are located, the serial-parallel relation among the sub-processes located in the same node and the serial-parallel quantity; and the service nodes execute respective sub-processes according to the execution basis of the respective sub-processes.
Here, the service flow definition may further include a rule definition; the rule definition can define a mark corresponding to the execution relation of each service node and a mark corresponding to the execution relation of each sub-process in each service node; and assigning values to the service nodes and the sub-processes according to the execution relation of the service nodes and the execution relation of the sub-processes and the rule definition to generate an execution basis. For example, in the above example, the leave-asking processing flow includes three service nodes, which are a direct department, a personnel department, and a financial department, and correspond to the sub-flow 1, the sub-flow 2, the sub-flow 3, the sub-flow 4, and the sub-flow 5, respectively. The assignment corresponding to the direct department is 1, the assignment corresponding to the personnel department is 2, and the assignment corresponding to the financial department is 3. Thus, the assignment of the sub-process 1 is 1-1-1-0-1, i.e., the first bit 1 indicates that the sub-process 1 is in the first business node direct department; the second bit 1 indicates that the number of parallel sub-processes of the sub-process 1 in the service node is 1, that is, only the sub-process 1 is provided; the third bit 1 indicates that the sub-process 1 is the serial first sub-process in the service node; the fourth bit 0 represents whether the sub-process 1 is a transfer sub-process, 0 represents that the sub-process 1 is a non-transfer sub-process, 1 represents that the sub-process 1 is subjected to transfer once, and if the sub-process 1 is subjected to transfer twice, the fourth bit is 2, so that the fourth bit can mark transfer times and can record a transfer path so as to facilitate subsequent tracking of nodes for initiating transfer; the fifth bit 1 can mark the number of completed sub-processes, that is, the sub-process 1 is completed, and the service node is completed; the sub-process 2 is assigned as 2-1-1-0-1; the sub-process 3 is assigned a value of 3-1-1-0-3; the sub-process 4 is assigned as 3-2-1-0-3; the sub-process 5 is assigned as 3-3-1-0-3, and in the third service node, the service node can be completed only when the sub-process 3, the sub-process 4 and the sub-process 5 are completed, so the fifth bit is 3; if a serial sub-process 6 is left after the sub-process 5 of the service node, the sub-process 6 is assigned as 3-3-2-0-3. The rule definitions of the above examples may be implemented uniformly using the rule calculator rulecompleerelistener. The specific implementation scheme is as follows: a taskSequence variable may be defined in the rule definition, which consists of 5 digits (e.g., 3-3-2-0-3), each digit containing the corresponding meaning:
the first bit: in the current service node sequence, from 1 to n, as in the above example, if the assignment corresponding to the direct department is 1, the assignment corresponding to the personnel department is 2, and the assignment corresponding to the financial department is 3, the execution sequence is the direct department service node-personnel department service node-financial department service node;
second position: the number of parallel sub-flows (the first bit is the same-the same service node, and the second bit is different, which indicates that there is a parallel sub-flow), as in the above example, sub-flow 3, sub-flow 4, and sub-flow 5 are processed in parallel; the sub-process 3 is assigned a value of 3-1-1-0-3; the sub-process 4 is assigned as 3-2-1-0-3; the sub-process 5 is assigned a value of 3-3-1-0-3.
Third position: the order of the serial sub-flows in the service node, as in the previous example, sub-flow 5 is assigned a value of 3-3-1-0-3. If a serial sub-process 6 is left after the sub-process 5 of the service node, the sub-process 6 is assigned as 3-3-2-0-3.
Fourth, the fourth step: whether forwarding is defaulted to be 0 or not, if the flow change functions such as forwarding, assisting, signing and the like are implemented, the flow change function is added by 1 once, and if not, the sub-flow is added with a parallel sub-flow; a value of 0 indicates that the flow modification function has not been performed.
The fifth position: and the number of the plurality of parallel sub-processes needs to be completed, and the sub-processes generating the current service node are finished after the number is completed. The fifth bit calculation method is as follows: ceil (y × p), where y is the number of sub-flows of the service node, and p is the completion ratio of the sub-flows of the service node in the rule definition. In the above example, the sub-process 3, the sub-process 4, and the sub-process 5 are processed in parallel, the completion ratio of the sub-process of the service node in the rule definition is 0.6, x ═ math.ceil (3 × 0.6) ≈ 2, the 5 th bit is 2, the service process can be ended when two of the sub-processes are completed, and the sub-process 3 is assigned as 3-1-1-0-2; the sub-process 4 is assigned a value of 3-2-1-0-2; the sub-scheme 5 is assigned a value of 3-3-1-0-2.
In addition, when the flow change function is performed once, 4 parallel sub-flows are generated. Then L (number of sub-process to be completed) ═ math.ceil (M × N +1) × P), P represents the completion ratio of the parallel sub-processes including the sub-processes of assistance, forwarding, etc., M (number of sub-process parallel) ═ tasksequence.get (2), generated from the 2 nd bit of taskSequence, is 4; n (the number of sub-flows implemented by the flow change function) is "tasksequence.get (4), and is generated from the 4 th bit of the taskSequence, and is 1. Then in the above example, 3 people examined and approved in parallel, and one transfer occurred (4 parallel sub-flows, which are the sub-flow added to the atomic flow once transferred), and P is 50%. Then L is 3 × 2 × 0.5 × 3, and 3 sub-processes are completed. Namely: the atomic process 3, the sub-process 4, the sub-process 5 and 1 transfer sub-process need 3 sub-processes to complete. For example, when 1 sub-process initiating transfer is completed, two atomic sub-processes are actually needed to complete the service node, that is: nrOfCompletedInsources +1> -nrOfneedleedInstants. Thus, the assignment rule may be an implementation manner for determining an execution basis according to the rule definition and the serial and/or parallel execution relationship of each sub-process, and is not particularly limited.
The embodiment of the application provides a rule definition, wherein the rule definition also comprises a completion proportion of a service node and whether each sub-process has a process change function; the completion proportion of the service node is used for indicating that when the completion proportion of the service node is met by each sub-process with parallel execution relation, the task of the service node is ended; the flow change function is used for indicating whether the sub-flow initiates the sub-flow again.
Here, the rule definition also includes a completion ratio of the service node and whether each sub-process has a process change function. Therefore, when a certain service node in the service processing rule comprises a plurality of parallel sub-processes, only part of the sub-processes need to be completed, and the completion of the processing of the service node can be determined, the completion proportion is correspondingly set or changed in the rule definition, and the method can be realized. If a certain business sub-process in the business processing rule needs process change, the sub-process can be initiated again by calling the process change function in the rule definition. The process change function may include assistance, transfer, conference, and sign, and the process change function is not limited in particular.
The embodiment of the application provides a service flow definition configuration method, further comprising: receiving a configuration instruction; and updating the service flow definition according to the configuration instruction.
Here, the service flow definition may include a flow node definition, a flow direction definition, a definition file of each sub-flow, and a rule definition. In this way, the flow node definition, the flow direction definition, the definition file of each sub-flow and the rule definition can be updated through the configuration instruction. The service processing can obtain the maximum flexibility; compared with the prior art that the process definition files are coupled, technicians do not need to face complex process files in the embodiment of the application and only need to directly configure the service processing in the service flow definition through configuration instructions, so that the workload is greatly reduced, and the service processing updating period is shortened; and the reusability of the flow definition files of the sub-flows is increased.
Based on the above flow, an embodiment of the present application provides a flow of a service processing method, as shown in fig. 7, including:
step 701, receiving service information.
Step 702, according to the service type in the service information, determining a service node from the flow node definition in the service flow definition.
And 703, determining the execution relation of each service node and each sub-process of each service node from the process flow direction definition in the service flow definition according to the service parameters and each service node in the service information.
Step 704, determining an execution basis according to the rule definition in the service flow definition and the execution relation of each service node and each sub-process of each service node.
Step 705, determining the sub-process to be executed currently according to the execution basis, and executing the sub-process.
Step 706, judging whether the sub-processes are not executed, if yes, returning to step 705; if not, go to step 707.
And step 707, the service processing flow is finished.
Based on the same concept, an embodiment of the present application provides a service processing apparatus, and fig. 8 is a service processing schematic diagram provided in the embodiment of the present application, as shown in fig. 8, including:
a transceiver module 801, configured to receive service information, where the service information is used to trigger a service process;
a processing module 802, configured to determine, according to the service information, an execution relationship between each service node that processes the service flow and each sub-flow corresponding to each service node from a service flow definition configured in advance;
the processing module 802 is further configured to execute the respective sub-process by the service nodes according to the execution relationship between the sub-processes, so as to complete the service process.
In one possible design, the processing module 802 is specifically configured to:
determining each service node in the service flow from a preset flow node definition according to the service type in the service information; and determining the execution relation between the sub-processes corresponding to the service nodes from the pre-configured process flow direction definition according to the service parameters in the service information and the service nodes.
In one possible design, the processing module 802 is specifically configured to: monitoring the execution condition of each sub-process; determining the next sub-process according to the execution condition of each sub-process; or, when the execution condition of each sub-process is determined to meet the completion condition, ending the business process.
In one possible design, the processing module 802 is specifically configured to: calling a flow definition file of a sub-flow of the service node aiming at any service node, and executing the sub-flow based on a flow engine and the flow definition file; the flow definition file is provided with a task front, and the task front is used for determining whether a sub-flow of transfer needs to be executed.
In one possible design, the processing module 802 is specifically configured to:
generating an execution basis of each sub-process according to the rule definition and the execution relation between each sub-process; the execution is carried out according to the sequence among the nodes of the nodes where the sub-processes are located, the serial-parallel relation among the sub-processes located in the same node and the serial-parallel quantity; and the service nodes execute respective sub-processes according to the execution basis of the respective sub-processes. In one possible design, the processing module 802 is specifically configured to: the rule definition also comprises the completion proportion of the service nodes and whether each sub-process has a process change function; the completion proportion of the service node is used for indicating that when the completion proportion of the service node is met by each sub-process with parallel execution relation, the task of the service node is ended; the flow change function is used for indicating whether the sub-flow initiates the sub-flow again.
In one possible design, the transceiver module 801 is further configured to: receiving a configuration instruction; and updating the service flow definition according to the configuration instruction.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims (10)

1. A method for processing a service, comprising:
receiving service information, wherein the service information is used for triggering a service process;
determining each service node for processing the service flow and the execution relation among each sub-flow corresponding to each service node from a service flow definition configured in advance according to the service information;
and executing the respective sub-processes through the service nodes according to the execution relation among the sub-processes, thereby completing the service processes.
2. The method of claim 1, wherein determining, according to the service information, an execution relationship between each service node and each sub-process corresponding to each service node for processing the service process from a pre-configured service flow definition comprises:
determining each service node in the service flow from a preset flow node definition according to the service type in the service information;
and determining the execution relation between the sub-processes corresponding to the service nodes from the pre-configured process flow direction definition according to the service parameters in the service information and the service nodes.
3. The method of claim 1, wherein the service flow definition further includes a completion condition of the service flow; executing respective sub-processes by the service nodes, including:
monitoring the execution condition of each sub-process;
determining the next sub-process according to the execution condition of each sub-process; or, when the execution condition of each sub-process is determined to meet the completion condition, ending the business process.
4. The method of claim 1, wherein the service flow definition further comprises a flow definition file of a sub-flow;
executing respective sub-processes by the service nodes, including:
calling a flow definition file of a sub-flow of the service node aiming at any service node, and executing the sub-flow based on a flow engine and the flow definition file; the flow definition file is provided with a task front, and the task front is used for determining whether a sub-flow of transfer needs to be executed.
5. The method of claim 1, wherein a rule definition is further included in the traffic flow definition;
executing respective sub-processes through the service nodes according to the execution relation among the sub-processes, wherein the execution relation comprises the following steps:
generating an execution basis of each sub-process according to the rule definition and the execution relation between each sub-process; the execution is carried out according to the sequence among the nodes of the nodes where the sub-processes are located, the serial-parallel relation among the sub-processes located in the same node and the serial-parallel quantity;
and the service nodes execute respective sub-processes according to the execution basis of the respective sub-processes.
6. The method of claim 5, comprising: the rule definition also comprises the completion proportion of the service nodes and whether each sub-process has a process change function;
the completion proportion of the service node is used for indicating that when the completion proportion of the service node is met by each sub-process with parallel execution relation, the task of the service node is ended;
the flow change function is used for indicating whether the sub-flow initiates the sub-flow again.
7. The method of any of claims 1 to 6, further comprising:
receiving a configuration instruction;
and updating the service flow definition according to the configuration instruction.
8. A traffic processing apparatus, characterized in that the apparatus comprises:
the receiving and sending module is used for receiving service information, and the service information is used for triggering a service process;
the processing module is used for determining execution relations among all service nodes for processing the service flow and all sub-flows corresponding to the service nodes from a service flow definition configured in advance according to the service information;
the processing module is further configured to execute the respective sub-process through each service node according to the execution relationship among the sub-processes, thereby completing the service process.
9. A computer-readable storage medium, characterized in that the storage medium stores a program which, when run on a computer, causes the computer to carry out the method of any one of claims 1 to 7.
10. A computer device, comprising:
a memory for storing a computer program;
a processor for calling a computer program stored in said memory to execute the method of any of claims 1 to 7 in accordance with the obtained program.
CN202010607775.0A 2020-06-29 2020-06-29 Service processing method and device Pending CN111754200A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010607775.0A CN111754200A (en) 2020-06-29 2020-06-29 Service processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010607775.0A CN111754200A (en) 2020-06-29 2020-06-29 Service processing method and device

Publications (1)

Publication Number Publication Date
CN111754200A true CN111754200A (en) 2020-10-09

Family

ID=72678112

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010607775.0A Pending CN111754200A (en) 2020-06-29 2020-06-29 Service processing method and device

Country Status (1)

Country Link
CN (1) CN111754200A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113064905A (en) * 2021-03-25 2021-07-02 北京京东乾石科技有限公司 Business process processing method and device, electronic equipment and computer readable medium
CN113205407A (en) * 2021-05-28 2021-08-03 中国工商银行股份有限公司 Distributed sub-transaction processing method and device
CN113435837A (en) * 2021-06-22 2021-09-24 北京致远互联软件股份有限公司 Method for forming one flow by multiple embedded sub-flows
TWI820746B (en) * 2022-03-03 2023-11-01 大陸商鼎捷軟件股份有限公司 Business behavior management system and business behavior management method

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113064905A (en) * 2021-03-25 2021-07-02 北京京东乾石科技有限公司 Business process processing method and device, electronic equipment and computer readable medium
CN113064905B (en) * 2021-03-25 2024-04-16 北京京东乾石科技有限公司 Business process processing method, device, electronic equipment and computer readable medium
CN113205407A (en) * 2021-05-28 2021-08-03 中国工商银行股份有限公司 Distributed sub-transaction processing method and device
CN113435837A (en) * 2021-06-22 2021-09-24 北京致远互联软件股份有限公司 Method for forming one flow by multiple embedded sub-flows
TWI820746B (en) * 2022-03-03 2023-11-01 大陸商鼎捷軟件股份有限公司 Business behavior management system and business behavior management method

Similar Documents

Publication Publication Date Title
CN111754200A (en) Service processing method and device
CN111427681A (en) Real-time task matching scheduling system and method based on resource monitoring in edge computing
CN111353754B (en) Method and device for generating flow template, electronic equipment and readable storage medium
US11947996B2 (en) Execution of services concurrently
US20100275186A1 (en) Segmentation for static analysis
CN108920183B (en) Service decision method, device and equipment
CN112748993A (en) Task execution method and device, storage medium and electronic equipment
CN107153646A (en) A kind of data processing method and equipment
CN115358401A (en) Inference service processing method and device, computer equipment and storage medium
CN106874080B (en) Data calculation method and system based on distributed server cluster
CN113869902A (en) Block chain transaction execution method and device
CN112712125B (en) Event stream pattern matching method and device, storage medium and processor
US20070169006A1 (en) Software generation method
CN111597035A (en) Simulation engine time advancing method and system based on multiple threads
CN111106953A (en) Abnormal root cause analysis method and device
JPS6126112A (en) System for diagnosing abnormality of system
CN114119202B (en) Automatic configuration method and system for credit management platform
CN113031929B (en) Service realization method and device
CN112990780B (en) Workflow construction method, device and equipment
CN110825461A (en) Data processing method and device
CN111160403A (en) Method and device for multiplexing and discovering API (application program interface)
CN111209283A (en) Data processing method and device
CN116797405B (en) Engineering data processing method and system based on data intercommunication of participating parties
CN113361775B (en) Crowd-sourced auction method for time interval coverage tasks
CN111159013B (en) Code quality assessment method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination