CN113064905B - Business process processing method, device, electronic equipment and computer readable medium - Google Patents
Business process processing method, device, electronic equipment and computer readable medium Download PDFInfo
- Publication number
- CN113064905B CN113064905B CN202110322056.9A CN202110322056A CN113064905B CN 113064905 B CN113064905 B CN 113064905B CN 202110322056 A CN202110322056 A CN 202110322056A CN 113064905 B CN113064905 B CN 113064905B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- business process
- execution
- node information
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 157
- 230000008569 process Effects 0.000 title claims abstract description 126
- 238000003672 processing method Methods 0.000 title claims abstract description 18
- 238000012545 processing Methods 0.000 claims abstract description 95
- 230000004044 response Effects 0.000 claims abstract description 42
- 230000002159 abnormal effect Effects 0.000 claims description 33
- 238000004590 computer program Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 10
- 230000000694 effects Effects 0.000 description 10
- 230000005856 abnormality Effects 0.000 description 8
- 238000012550 audit Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 7
- 230000010365 information processing Effects 0.000 description 7
- 238000012546 transfer Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 238000012795 verification Methods 0.000 description 5
- 230000009471 action Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000010998 test method Methods 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 230000000644 propagated effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000005587 bubbling Effects 0.000 description 1
- 230000001364 causal effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
- G06F16/2433—Query languages
- G06F16/2445—Data retrieval commands; View definitions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Finance (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Computational Linguistics (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Human Resources & Organizations (AREA)
- Tourism & Hospitality (AREA)
- Mathematical Physics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the disclosure discloses a business process processing method, a business process processing device, electronic equipment and a computer readable medium. One embodiment of the method comprises the following steps: acquiring a node information set, wherein the node information in the node information set comprises: node execution information; determining check information corresponding to each node information in the node information set to obtain a check information set; for each node information in the node information set, updating the node information in response to determining that the check information representation corresponding to the node information updates the node information, and updating the node execution information included in the node information; and generating business process information according to the node information set and the initial business process information. The implementation mode improves the execution efficiency of the business process.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technology, and in particular, to a business process processing method, a business process processing device, an electronic device, and a computer readable medium.
Background
With the popularity of computer technology, more and more business processes are gradually beginning to evolve toward electronics, systemization, and automation. Currently, in the business process, the following methods are generally adopted: and converting the business process into a workflow, thereby realizing the automation of the business process.
However, when the above manner is adopted, there are often the following technical problems:
in the service flow, it is often difficult to process the complex service logic in the service flow, so that the processing steps in the service flow may not be normally executed, and the execution efficiency of the service flow may be affected.
Disclosure of Invention
The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose business process processing methods, apparatuses, electronic devices, and computer readable media to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a business process processing method, the method including: acquiring a node information set, wherein the node information in the node information set comprises: node execution information; determining the check information corresponding to each node information in the node information set to obtain a check information set; for each node information in the node information set, updating the node information in response to determining that the check information representation corresponding to the node information is updated, and updating the node execution information included in the node information; and generating business process information according to the node information set and the initial business process information.
Optionally, the updating the node execution information included in the node information includes: sending node information update request information to a target terminal; and in response to receiving the update information sent by the target terminal, updating the node execution information included in the node information according to the update information.
Optionally, the business process information includes: first node information, last node information, intermediate node information sets and node connection information sets; and generating business process information according to the node information set and the initial business process information, wherein the business process information comprises the following steps: according to the initial business flow information, performing connection processing on nodes corresponding to each node information in the node information set to generate a business flow line; determining node information corresponding to a first node of the service flow line as the first node information; determining node information corresponding to a last node of the service flow line as the last node information; determining node information corresponding to each target node in the service flow line as intermediate node information to obtain the intermediate node information set, wherein the target node is a node which is not the first node and the last node in the service processing flow; and determining the connection information corresponding to each two adjacent nodes in the service flow line as node connection information to obtain the node connection information set.
Optionally, the method further comprises: generating candidate task information according to the first node information included in the business process information; according to the candidate task information, the following processing steps are executed: determining node types of nodes corresponding to the candidate task information; responding to the determination that the node type is a first node type or a second node type, and executing business logic corresponding to target node execution information, wherein the target node execution information is node execution information included in node information corresponding to a candidate task; and ending the processing step in response to the fact that the business logic is completely executed and the candidate task information is the task information corresponding to the end node information.
Optionally, the method further comprises: and in response to the fact that the service logic is executed, and the node type is the first node type, the candidate task information is determined again according to the return value of the service logic and the connection information corresponding to the candidate task information, and the processing steps are executed again.
Optionally, before the executing the service logic corresponding to the target node execution information in response to determining that the node type is the first node type or the second node type, the method further includes: and responding to the determination that the node type is the third node type and receiving a task trigger signal, and executing service logic corresponding to the execution information of the target node.
Optionally, the method further comprises: and in response to determining that the service logic is executed, and the node type is the second node type or the third node type, re-determining candidate task information according to the connection information corresponding to the candidate task information, and executing the processing steps again.
In a second aspect, some embodiments of the present disclosure provide a business process processing apparatus, the apparatus including: an obtaining unit configured to obtain a node information set, where node information in the node information set includes: node execution information; the determining unit is configured to determine the check information corresponding to each node information in the node information set to obtain a check information set; an updating unit configured to update, for each node information in the node information set, node information in response to determining that a check information token corresponding to the node information indicates updating of the node information, and update node execution information included in the node information; and the generating unit is configured to generate business flow information according to the node information set and the initial business flow information.
Optionally, the updating unit is configured to: sending node information update request information to a target terminal; and in response to receiving the update information sent by the target terminal, updating the node execution information included in the node information according to the update information.
Optionally, the business process information includes: first node information, last node information, intermediate node information sets and node connection information sets; and the generation unit is configured to: according to the initial business flow information, performing connection processing on nodes corresponding to each node information in the node information set to generate a business flow line; determining node information corresponding to a first node of the service flow line as the first node information; determining node information corresponding to a last node of the service flow line as the last node information; determining node information corresponding to each target node in the service flow line as intermediate node information to obtain the intermediate node information set, wherein the target node is a node which is not the first node and the last node in the service processing flow; and determining the connection information corresponding to each two adjacent nodes in the service flow line as node connection information to obtain the node connection information set.
Optionally, the apparatus further includes: generating candidate task information according to the first node information included in the business process information; according to the candidate task information, the following processing steps are executed: determining node types of nodes corresponding to the candidate task information; responding to the determination that the node type is a first node type or a second node type, and executing business logic corresponding to target node execution information, wherein the target node execution information is node execution information included in node information corresponding to a candidate task; and ending the processing step in response to the fact that the business logic is completely executed and the candidate task information is the task information corresponding to the end node information.
Optionally, the apparatus further includes: and in response to the fact that the service logic is executed, and the node type is the first node type, the candidate task information is determined again according to the return value of the service logic and the connection information corresponding to the candidate task information, and the processing steps are executed again.
Optionally, before the executing the service logic corresponding to the target node execution information in response to determining that the node type is the first node type or the second node type, the apparatus further includes: and responding to the determination that the node type is the third node type and receiving a task trigger signal, and executing service logic corresponding to the execution information of the target node.
Optionally, the apparatus further includes: and in response to determining that the service logic is executed, and the node type is the second node type or the third node type, re-determining candidate task information according to the connection information corresponding to the candidate task information, and executing the processing steps again.
In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors causes the one or more processors to implement the method described in any of the implementations of the first aspect above.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect above.
The above embodiments of the present disclosure have the following advantages: the business process processing method of some embodiments of the present disclosure improves the execution efficiency of the business process. Specifically, the reason why the execution efficiency of the business process is low is that: in a service flow, it is often difficult to handle more complex service logic in the service flow. Based on this, the business process processing method of some embodiments of the present disclosure first obtains a node information set. In practical applications, the business process often includes at least one processing node, and the processing nodes in the at least one processing node often have at least one processing step corresponding to the processing nodes. Thus, by acquiring a set of node information related to a business process. And providing data support for subsequent business process information generation. In addition, determining the check information corresponding to each node information in the node information set to obtain a check information set. Further, for each node information in the node information set, updating the node information in response to determining that the check information token corresponding to the node information is updated, and updating the node execution information included in the node information. In practice, there may be anomalies in the business logic corresponding to the processing steps (e.g., output anomalies of the code segments). Therefore, it is necessary to verify the node information corresponding to the processing node. When the business logic corresponding to the processing node is abnormal, the node execution information included in the node information needs to be updated in time, so that the processing logic corresponding to each processing node included in the subsequently generated business process can be normally executed. And finally, generating business process information according to the node information set and the initial business process information. In practical situations, the execution sequence of the processing nodes corresponding to the node information in the node information set often has a sequence, and the processing nodes corresponding to the node information in the node information set are connected through the initial business process information so as to generate the business process information corresponding to the business process. The method and the device enable more complex business logic to be processed by adding the execution logic corresponding to each processing node in the business flow. In addition, the normal execution of the business process is ensured by checking the node information corresponding to each processing node. Furthermore, the execution efficiency of the business process is improved.
Drawings
The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
FIG. 1 is a schematic diagram of one application scenario of a business process processing method of some embodiments of the present disclosure;
FIG. 2 is a flow chart of some embodiments of business process methods according to the present disclosure;
FIG. 3 is a schematic diagram of a business process line;
FIG. 4 is a flow chart of other embodiments of business process methods according to the present disclosure;
FIG. 5 is a schematic diagram of the architecture of some embodiments of a business process processing device according to the present disclosure;
fig. 6 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic diagram of an application scenario of a business process processing method according to some embodiments of the present disclosure.
In the application scenario of fig. 1, first, the computing device 101 may acquire a node information set, where node information in the node information set includes: node execution information; next, the computing device 101 may determine the check information (e.g., [ anomaly flag value: "0", anomaly type: "NULL", anomaly location: "NULL") corresponding to each node information in the above-described node information set, resulting in a check information set; further, the computing device 101 may update, for each node information in the node information set, the node information in response to determining that the check information token corresponding to the node information is updated, and update the node execution information included in the node information; finally, computing device 101 may generate business process information from the set of node information and the initial business process information.
The computing device 101 may be hardware or software. When the computing device is hardware, the computing device may be implemented as a distributed cluster formed by a plurality of servers or terminal devices, or may be implemented as a single server or a single terminal device. When the computing device is embodied as software, it may be installed in the hardware devices listed above. It may be implemented as a plurality of software or software modules, for example, for providing distributed services, or as a single software or software module. The present invention is not particularly limited herein.
It should be understood that the number of computing devices in fig. 1 is merely illustrative. There may be any number of computing devices, as desired for an implementation.
With continued reference to fig. 2, a flow 200 of some embodiments of business process processing methods according to the present disclosure is shown. The business process processing method comprises the following steps:
step 201, a node information set is acquired.
In some embodiments, the execution body of the business process processing method (such as the computing device 101 shown in fig. 1) may obtain the node information set by using a wired connection or a wireless connection. The node information in the node information set may include: the node performs the information. The node information in the node information set corresponds to the processing nodes in at least one processing node contained in the target business process one by one. The node execution information may represent node execution logic of a processing node corresponding to the node information. The target business process may be a workflow corresponding to a target business scenario. The target business process may include at least one processing node. The processing node of the at least one processing node may characterize a processing event in the business process. The processing event may include at least one processing step.
As an example, the node execution logic may be logic code corresponding to at least one processing step included in the processing event corresponding to the processing node.
As yet another example, the business scenario described above may be a "user order" scenario. The "user order" scenario described above may include: an "order information acquisition node", an "order verification node" and a "warehouse deployment node". Wherein. The "order information acquisition node" may include: and acquiring order information. The "order check node" may include: and checking order validity. The "warehouse deployment node" may include: and allocating the order corresponding item from the warehouse in response to the order being legal.
Optionally, the node information in the node information set further includes: node name, node action description information, node type and node parameters. The node action description information is used for describing node actions. The node parameter may be a parameter for transfer in node execution logic corresponding to node execution information included in the node information.
Step 202, determining check information corresponding to each node information in the node information set to obtain the check information set.
In some embodiments, the executing body may determine the check information corresponding to each node information in the node information set, to obtain the check information set. The check information in the check information set may represent whether the node execution logic corresponding to the node execution information included in the node information is abnormal. The execution body can test the node execution logic corresponding to the node execution information included in the node information through the target test method so as to generate the check information. The target test method may be, but is not limited to, any one of the following: equivalence class division, boundary value analysis, misspeculation and causal mapping. The verification information may include: an anomaly identification value, an anomaly type, and an anomaly location. The abnormal identification value can represent whether the node execution logic corresponding to the node execution information is abnormal or not. The anomaly type may characterize the type of anomaly. The abnormal position may represent a position where the node execution logic is abnormal.
As an example, the above-described check information may be [ anomaly flag value: "1", anomaly type: "type 1", abnormal position: "322 lines" ]. The 1 can represent that the node execution logic corresponding to the node execution information is abnormal and needs to be updated.
As yet another example, the above-described verification information may be [ anomaly flag value: "0", anomaly type: "NULL", abnormal position: "NULL" ]. Wherein, a "0" may indicate that the node execution logic corresponding to the node execution information is not abnormal, and does not need to be updated. When the anomaly identification value is "0", the anomaly type and anomaly location included in the check information may be NULL values, which may be indicated by "NULL".
Step 203, for each node information in the node information set, updating the node information in response to determining that the check information token corresponding to the node information updates the node execution information included in the node information.
In some embodiments, for each node information in the node information set, the executing body may update the node information in response to determining that the check information token corresponding to the node information updates the node information, and update the node execution information included in the node information, and may include the following steps:
first, determining an abnormal level corresponding to the target node information.
The target node information may be node information that needs to be updated. The execution body may obtain the abnormal level by querying an abnormal level comparison data table according to the abnormal type included in the verification information corresponding to the target node information. The above-described abnormality level comparison data table may be a data table for storing abnormality types and corresponding abnormality levels. The execution body may acquire the exception rank corresponding to the target node information from the exception rank reference data table through an SQL (Structured Query Language ) statement.
As an example, the execution body may obtain the abnormal level corresponding to the target node information from the abnormal level comparison data table by using the following SQL statement:
SELECT anomaly level FROM anomaly level control data table WHERE error type= "anomaly type".
And a second step of adding the target node information as the abnormality information to an abnormality information processing queue according to the abnormality level corresponding to the target node information.
The executing body may first sort the abnormal information in the abnormal information processing queue according to the abnormal level corresponding to the abnormal information in the abnormal information processing queue by using a target sorting algorithm according to the target order, so as to generate a sorted abnormal information processing queue. And secondly, inserting the target node information into the target position in the ordered abnormal information processing queue as abnormal information. Wherein, the above-mentioned goal ordering algorithm can be, but is not limited to, any one of the following: bubbling ordering algorithm, hill ordering algorithm, fast ordering algorithm and insert ordering algorithm. The target order may be a large to small order. The target order may be a small to large order. The target position may be a position in the ordered exception information processing queue, where an exception level corresponding to the former exception information is less than or equal to an exception level corresponding to the target node information, and an exception level corresponding to the latter exception information is greater than an exception level corresponding to the target node information.
And thirdly, acquiring the latest version of node execution information corresponding to each piece of abnormal information in the updated abnormal information processing queue from the version information base.
The version information base may be a database for storing node execution information of each version corresponding to the abnormality information.
And fourthly, executing information on the latest version of nodes by the target test method to test.
And fifthly, determining the latest version of node execution information as node execution information included in the node information corresponding to the abnormal information in response to the latest version of node execution information passing the test, so as to update the node execution information to be updated.
The node execution information to be updated may be node execution information included in the node information updated by the corresponding verification information representation.
In some optional implementations of some embodiments, for each node information in the node information set, the executing body may update the node information in response to determining that the check information token corresponding to the node information updates the node information, and update the node execution information included in the node information, where the step may include:
First, node information update request information is sent to a target terminal.
The execution body may send the node information update request information to the target terminal by means of wired connection or wireless connection. The target terminal may be a terminal for performing obstacle avoidance processing on node information that needs to be updated by an obstacle avoidance person. The node information update request information may include: the abnormal marking value, the abnormal type, the abnormal position and the node execution information included in the node information.
And a second step of updating the node execution information included in the node information according to the update information in response to receiving the update information sent by the target terminal.
The update information may represent new node execution information after abnormality is eliminated for the node execution information. The execution body may determine the update information as node execution information included in the node information, so as to update the node execution information included in the node information.
Step 204, generating business process information according to the node information set and the initial business process information.
In some embodiments, the executing entity may generate the business process information according to the node information set and the initial business process information. The initial business process information may represent an execution sequence relationship between each processing node in the target business process. The execution body may sequentially combine the node information sets according to the initial business process information to generate the business process information.
Optionally, the business process information may include: first node information, last node information, intermediate node information sets and node connection information sets. The first node information may be node information corresponding to a first node of the business process corresponding to the business process information. The end node information may be node information corresponding to an end node of the business process corresponding to the business process information. The intermediate node information in the intermediate node information set may be node information corresponding to a node of a non-first node and a node of a non-last node of the business process corresponding to the business process information. The node connection information in the node connection information set may represent a connection relationship between two adjacent nodes.
By way of example, the initial business process information may be [ node A-node B, node B-node C, node C-node D ]. The node information set may be [ node information corresponding to node C, node information corresponding to node B, node information corresponding to node D, node information corresponding to node a ]. The business process information may be [ node information corresponding to node a, node information corresponding to node B, node information corresponding to node C, node information corresponding to node D ].
Optionally, the executing body generates the business process information according to the node information set and the initial business process information, and may include the following steps:
and the first step, according to the initial business process information, carrying out connection processing on the nodes corresponding to each node information in the node information set so as to generate a business process line.
As an example, the above-described business scenario may be a "supply chain" scenario. As shown in fig. 3. The service flow line corresponding to the "supply chain" scene can be provided. The "supply chain" scenario described above may be when a user order is received, the closest warehouse shipment is selected based on the receiving address. When the nearest warehouse is not in sufficient inventory, the warehouse is selected to be filled with goods from other warehouses or purchased from suppliers. The "supply chain" scenario described above may include: an "accept order activity node 301", "audit event node 302", "inventory gateway node 303", "dial activity node 304", "dial completion event node 307", "warehouse shipping node 305", "purchase activity node 306", and "purchase completion event node 308". The "audit event node 302" described above may be used to audit accepted orders. The "stock gateway node 303" is used to determine the stock state. For example, when the inventory of the closest warehouse can meet the order requirements, the "warehouse shipping node 305" may continue to execute. When the inventory of the closest warehouse is not able to meet the order requirements, but the other warehouses have items for the order requirements, the "allocate active node 304" may continue to be executed. When all of the warehouses do not contain items needed for the order, the "procurement activity node 306" may continue to be executed.
And secondly, determining node information corresponding to the first node of the service flow line as the first node information.
As an example, the executing entity may determine node information corresponding to the "order taking active node 301" as the head node information.
And thirdly, determining node information corresponding to the last node of the service flow line as the last node information.
As an example, the execution body may determine node information corresponding to the "warehouse shipping node 305" as the last node information.
And step four, determining node information corresponding to each target node in the service flow line as intermediate node information, and obtaining the intermediate node information set.
As an example, the executing entity may determine node information corresponding to "audit event node 302", "inventory gateway node 303", "dial activity node 304", "dial completion event node 307", "purchase activity node 306" and "purchase completion event node 308" as intermediate node information, to obtain the intermediate node information set.
And fifthly, determining the connection information corresponding to each two adjacent nodes in the service flow line as node connection information, and obtaining the node connection information set.
Wherein, the connection information may include: a start node name and an end node name.
As an example, the above-described node connection information set may be [ (a receive order active node, an audit event node), (an audit event node, an inventory gateway node), (an inventory gateway node, a transfer active node), (an inventory gateway node, a warehouse shipping node), (an inventory gateway node, a purchase active node), (a transfer active node, a transfer completion event node), (a transfer completion event node, a warehouse shipping node), (a purchase active node, a purchase completion event node) ].
Optionally, a flow instance parameter is set.
In some embodiments, the execution body may set a flow instance parameter. The flow instance parameter may be used to transfer in a service logic corresponding to node execution information included in the target node information, where the target node information may be node information corresponding to a node included in the target service flow, and the target service flow may be a service flow corresponding to the service flow information.
The above embodiments of the present disclosure have the following advantages: the business process processing method of some embodiments of the present disclosure improves the execution efficiency of the business process. Specifically, the reason why the execution efficiency of the business process is low is that: in a service flow, it is often difficult to handle more complex service logic in the service flow. Based on this, the business process processing method of some embodiments of the present disclosure first obtains a node information set. In practical applications, the business process often includes at least one processing node, and the processing nodes in the at least one processing node often have at least one processing step corresponding to the processing nodes. Thus, by acquiring a set of node information related to a business process. And providing data support for subsequent business process information generation. In addition, determining the check information corresponding to each node information in the node information set to obtain a check information set. Further, for each node information in the node information set, updating the node information in response to determining that the check information token corresponding to the node information is updated, and updating the node execution information included in the node information. In practice, there may be anomalies in the business logic corresponding to the processing steps (e.g., output anomalies of the code segments). Therefore, it is necessary to verify the node information corresponding to the processing node. When the business logic corresponding to the processing node is abnormal, the node execution information included in the node information needs to be updated in time, so that the processing logic corresponding to each processing node included in the subsequently generated business process can be normally executed. And finally, generating business process information according to the node information set and the initial business process information. In practical situations, the execution sequence of the processing nodes corresponding to the node information in the node information set often has a sequence, and the processing nodes corresponding to the node information in the node information set are connected through the initial business process information so as to generate the business process information corresponding to the business process. The method and the device enable more complex business logic to be processed by adding the execution logic corresponding to each processing node in the business flow. In addition, the normal execution of the business process is ensured by checking the node information corresponding to each processing node. Furthermore, the execution efficiency of the business process is improved.
With further reference to fig. 4, a flow 400 of further embodiments of business process processing methods is shown. The process 400 of the business process processing method includes the steps of:
step 401, acquiring a node information set.
Step 402, determining the check information corresponding to each node information in the node information set, and obtaining the check information set.
Step 403, for each node information in the node information set, updating the node information in response to determining that the check information token corresponding to the node information updates the node execution information included in the node information.
In some embodiments, the specific implementation of the steps 401 to 403 and the technical effects thereof may refer to the steps 201 to 203 in those embodiments corresponding to fig. 2, which are not described herein.
And step 404, generating candidate task information according to the first node information included in the business process information.
In some embodiments, the execution body may determine the head node information as the candidate task information.
Step 405, according to the candidate task information, executing the following processing steps:
step 4051, determining the node type of the node corresponding to the candidate task information.
In some embodiments, the executing entity may determine a node type of the node corresponding to the candidate task information. The node types may include: a first node type, a second node type, and a third node type. The first node type may be a gateway node type. The second node type may be an active node type. The third node type may be an event node type. The event node type, the gateway node type and the active node type may correspond to three node types of events, activities and gateways contained in a flow object in a BPMN (Business Process Model and Notation, a business process model and a notation), respectively.
As an example, the node name of the node corresponding to the candidate task information may be "dial active node", and the node type corresponding to the candidate task information may be "second node type".
In step 4052, in response to determining that the node type is the third node type and receiving the task trigger signal, executing the service logic corresponding to the execution information of the target node.
Wherein, the task trigger signal can be sent by the target user. The target user may be a person associated with a business process corresponding to the business process information.
As an example, as shown in fig. 3. For "receive order active node 301", the task trigger signal may be a request for ordering sent by an ordering user.
In step 4053, in response to determining that the node type is the first node type or the second node type, executing service logic corresponding to the execution information of the target node.
The target node execution information may be node execution information included in the node information corresponding to the candidate task. The execution body can execute the code corresponding to the service logic to realize the service logic corresponding to the execution information of the execution target node.
Step 4054, in response to determining that the business logic is completed and the candidate task information is the task information corresponding to the end node information, the processing step is ended.
The execution main body can establish thread monitoring, and can determine that the service logic is executed when the thread corresponding to the service logic is eliminated.
As an example, as shown in fig. 3. The end node of the business process corresponding to the "supply chain" scenario may be the "warehouse shipping node 305". The candidate task information may be task information corresponding to "warehouse shipping node 305". When the business logic of the "warehouse shipping node 305" is completed, the processing steps may be ended.
Step 4055, in response to determining that the service logic is executed, and the node type is the first node type, the candidate task information is redetermined according to the return value of the service logic and the connection information corresponding to the candidate task information, and the processing step is executed again.
As an example, as shown in fig. 3, the "inventory gateway node 303" has a wired relationship with the "reconciliation activity node 304", "warehouse shipping node 305", and "procurement activity node 306", respectively. When the return value of the service logic corresponding to the "stock gateway node 303" is "1", the node information corresponding to the "dial active node 304" may be determined as candidate task information. When the return value of the business logic corresponding to the "stock gateway node 303" is "2", the node information corresponding to the "warehouse shipping node 305" may be determined as candidate task information. When the return value of the business logic corresponding to the "stock gateway node 303" is "3", the node information corresponding to the "purchase active node 306" may be determined as candidate task information.
Step 4056, in response to determining that the service logic is executed, and the node type is the second node type or the third node type, the candidate task information is redetermined according to the connection information corresponding to the candidate task information, and the processing step is executed again.
As an example, as shown in fig. 3. After the business logic corresponding to the audit event node 302 is executed, the node information corresponding to the inventory gateway node 303 may be determined as candidate task information.
As yet another example, as shown in fig. 3. After the service logic corresponding to the "dial active node 304" is executed, the node information corresponding to the "dial completion event node 307" may be determined as candidate task information. "
As can be seen from fig. 4, the present disclosure increases the execution method of the business process corresponding to the business process information, compared to the description of some embodiments corresponding to fig. 2. In practical situations, one business process often includes more processing nodes, and the node types of different processing nodes are different, and the execution modes are also different. For example, when the node type of the processing node is the first node type, in practical situations, the processing node of the first node type is often connected to at least one processing node, so that the next node to be executed needs to be determined according to the return value of the service logic and the node connection information. In addition, when the node type of the processing node is the third node type, the processing node of this type often needs to be triggered before the corresponding service logic can be executed. Therefore, when the task trigger signal is received, the service logic corresponding to the processing node of the third node type is executed. In this way, a normal and stable execution of the business process is ensured. The execution efficiency of the business process is ensured.
With further reference to fig. 5, as an implementation of the method shown in the foregoing figures, the present disclosure provides some embodiments of a business process processing apparatus, which correspond to those method embodiments shown in fig. 2, and which are particularly applicable to various electronic devices.
As shown in fig. 5, business process processing device 500 of some embodiments includes: an acquisition unit 501, a determination unit 502, an update unit 503, and a generation unit 504. Wherein, the acquiring unit 501 is configured to acquire a node information set, where node information in the node information set includes: node execution information; a determining unit 502 configured to determine the check information corresponding to each node information in the node information set, to obtain a check information set; an updating unit 503 configured to update, for each node information in the node information set, node information in response to determining that the check information token corresponding to the node information indicates updating of the node information, and update node execution information included in the node information; a generating unit 504 configured to generate business process information according to the node information set and the initial business process information.
In some optional implementations of some embodiments, the updating unit 503 is configured to: sending node information update request information to a target terminal; and in response to receiving the update information sent by the target terminal, updating the node execution information included in the node information according to the update information.
Optionally, the business process information includes: first node information, last node information, intermediate node information sets and node connection information sets; and the generation unit 504 is configured to: according to the initial business flow information, performing connection processing on nodes corresponding to each node information in the node information set to generate a business flow line; determining node information corresponding to a first node of the service flow line as the first node information; determining node information corresponding to a last node of the service flow line as the last node information; determining node information corresponding to each target node in the service flow line as intermediate node information to obtain the intermediate node information set, wherein the target node is a node which is not the first node and the last node in the service processing flow; and determining the connection information corresponding to each two adjacent nodes in the service flow line as node connection information to obtain the node connection information set.
Optionally, the apparatus 500 further includes: generating candidate task information according to the first node information included in the business process information; according to the candidate task information, the following processing steps are executed: determining node types of nodes corresponding to the candidate task information; responding to the determination that the node type is a first node type or a second node type, and executing business logic corresponding to target node execution information, wherein the target node execution information is node execution information included in node information corresponding to a candidate task; and ending the processing step in response to the fact that the business logic is completely executed and the candidate task information is the task information corresponding to the end node information.
Optionally, the apparatus further includes: and in response to the fact that the service logic is executed, and the node type is the first node type, the candidate task information is determined again according to the return value of the service logic and the connection information corresponding to the candidate task information, and the processing steps are executed again.
Optionally, before executing the service logic corresponding to the target node execution information in response to determining that the node type is the first node type or the second node type, the apparatus 500 further includes: and responding to the determination that the node type is the third node type and receiving a task trigger signal, and executing service logic corresponding to the execution information of the target node.
Optionally, the apparatus 500 further includes: and in response to determining that the service logic is executed, and the node type is the second node type or the third node type, re-determining candidate task information according to the connection information corresponding to the candidate task information, and executing the processing steps again.
Referring now to FIG. 6, a schematic diagram of an electronic device 600 (e.g., computing device 101 shown in FIG. 1) suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device shown in fig. 6 is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.
As shown in fig. 6, the electronic device 600 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 601, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data required for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM603 are connected to each other through a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
In general, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, magnetic tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 shows an electronic device 600 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 6 may represent one device or a plurality of devices as needed.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communications device 609, or from storage device 608, or from ROM 602. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing device 601.
It should be noted that, the computer readable medium described in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring a node information set, wherein the node information in the node information set comprises: node execution information; determining the check information corresponding to each node information in the node information set to obtain a check information set; for each node information in the node information set, updating the node information in response to determining that the check information representation corresponding to the node information is updated, and updating the node execution information included in the node information; and generating business process information according to the node information set and the initial business process information.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor includes an acquisition unit, a determination unit, an update unit, and a generation unit. The names of these units do not constitute a limitation on the unit itself in some cases, and for example, the acquisition unit may also be described as "a unit that acquires a node information set".
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.
Claims (10)
1. A business process processing method, comprising:
acquiring a node information set, wherein the node information in the node information set comprises: node execution information;
determining check information corresponding to each node information in the node information set to obtain a check information set, wherein the check information characterizes whether node execution logic corresponding to node execution information included in the node information is abnormal or not;
for each node information in the node information set, updating the node information in response to determining that the check information representation corresponding to the node information updates the node information, and updating the node execution information included in the node information;
and according to the initial business process information, at least one processing node corresponding to the node information set is combined in order to generate business process information.
2. The method of claim 1, wherein the updating the node execution information included in the node information comprises:
sending node information update request information to a target terminal;
and in response to receiving the update information sent by the target terminal, updating the node execution information included in the node information according to the update information.
3. The method of claim 1, wherein the business process information comprises: first node information, last node information, intermediate node information sets and node connection information sets; and
the step of sequentially combining at least one processing node corresponding to the node information set according to the initial business process information to generate business process information includes:
according to the initial business flow information, performing connection processing on nodes corresponding to each node information in the node information set to generate a business flow line;
determining node information corresponding to a first node of the service flow line as the first node information;
determining node information corresponding to a last node of the business flow line as the last node information;
determining node information corresponding to each target node in the service flow line as intermediate node information to obtain the intermediate node information set, wherein the target nodes are nodes which are not the first node and the last node in the service processing flow;
and determining the connection information corresponding to each two adjacent nodes in the service flow line as node connection information, and obtaining the node connection information set.
4. A method according to claim 3, wherein the method further comprises:
generating candidate task information according to the first node information included in the business process information;
according to the candidate task information, the following processing steps are executed:
determining node types of nodes corresponding to the candidate task information;
responding to the determination that the node type is a first node type or a second node type, and executing business logic corresponding to target node execution information, wherein the target node execution information is node execution information included in node information corresponding to a candidate task;
and ending the processing step in response to the fact that the business logic is completely executed and the candidate task information is the task information corresponding to the end node information.
5. The method of claim 4, wherein the method further comprises:
and in response to the fact that the service logic is completely executed and the node type is the first node type, the candidate task information is redetermined according to the return value of the service logic and the connection information corresponding to the candidate task information, and the processing step is executed again.
6. The method of claim 4, wherein prior to the executing the business logic corresponding to the target node execution information in response to determining the node type is either a first node type or a second node type, the method further comprises:
And responding to the determination that the node type is the third node type and receiving a task trigger signal, and executing service logic corresponding to the execution information of the target node.
7. The method of claim 5, wherein the method further comprises:
and in response to determining that the service logic is executed, and the node type is the second node type or the third node type, re-determining candidate task information according to the connection information corresponding to the candidate task information, and executing the processing step again.
8. A business process processing apparatus comprising:
an acquisition unit configured to acquire a set of node information, wherein node information in the set of node information includes: node execution information;
the determining unit is configured to determine the check information corresponding to each node information in the node information set to obtain the check information set, wherein the check information characterizes whether the node execution logic corresponding to the node execution information included in the node information is abnormal or not;
an updating unit configured to update, for each node information in the node information set, node information in response to determining that a check information token corresponding to the node information is updated, node execution information included in the node information;
And the generating unit is configured to sequentially combine at least one processing node corresponding to the node information set according to the initial business process information to generate business process information.
9. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-7.
10. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110322056.9A CN113064905B (en) | 2021-03-25 | 2021-03-25 | Business process processing method, device, electronic equipment and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110322056.9A CN113064905B (en) | 2021-03-25 | 2021-03-25 | Business process processing method, device, electronic equipment and computer readable medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113064905A CN113064905A (en) | 2021-07-02 |
| CN113064905B true CN113064905B (en) | 2024-04-16 |
Family
ID=76563731
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110322056.9A Active CN113064905B (en) | 2021-03-25 | 2021-03-25 | Business process processing method, device, electronic equipment and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113064905B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117132245B (en) * | 2023-10-27 | 2024-02-06 | 北京国电通网络技术有限公司 | Method, device, equipment and readable medium for reorganizing online article acquisition business process |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110750267A (en) * | 2019-09-26 | 2020-02-04 | 浙江大搜车软件技术有限公司 | Service information updating method and device, computer equipment and storage medium |
| KR20200014968A (en) * | 2018-08-02 | 2020-02-12 | 주식회사 케이티 | Method and apparatus for detecting anomalous traffic |
| CN110830549A (en) * | 2019-09-24 | 2020-02-21 | 北京海益同展信息科技有限公司 | Method and device for acquiring service information, electronic equipment and storage medium |
| CN110908869A (en) * | 2019-11-27 | 2020-03-24 | 北京博睿宏远数据科技股份有限公司 | Application program data monitoring method, device, equipment and storage medium |
| CN111367583A (en) * | 2020-03-10 | 2020-07-03 | 中国工商银行股份有限公司 | Service loading method and device, electronic equipment and medium |
| CN111444077A (en) * | 2019-01-16 | 2020-07-24 | 北京京东尚科信息技术有限公司 | Method and device for generating flow node test data |
| CN111507636A (en) * | 2020-04-22 | 2020-08-07 | 时时同云科技(成都)有限责任公司 | Business process running state analysis method and system |
| CN111754200A (en) * | 2020-06-29 | 2020-10-09 | 深圳前海微众银行股份有限公司 | Service processing method and device |
| CN112101803A (en) * | 2020-09-21 | 2020-12-18 | 腾讯科技（深圳）有限公司 | Business process monitoring method, device, system, equipment and medium |
-
2021
- 2021-03-25 CN CN202110322056.9A patent/CN113064905B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20200014968A (en) * | 2018-08-02 | 2020-02-12 | 주식회사 케이티 | Method and apparatus for detecting anomalous traffic |
| CN111444077A (en) * | 2019-01-16 | 2020-07-24 | 北京京东尚科信息技术有限公司 | Method and device for generating flow node test data |
| CN110830549A (en) * | 2019-09-24 | 2020-02-21 | 北京海益同展信息科技有限公司 | Method and device for acquiring service information, electronic equipment and storage medium |
| CN110750267A (en) * | 2019-09-26 | 2020-02-04 | 浙江大搜车软件技术有限公司 | Service information updating method and device, computer equipment and storage medium |
| CN110908869A (en) * | 2019-11-27 | 2020-03-24 | 北京博睿宏远数据科技股份有限公司 | Application program data monitoring method, device, equipment and storage medium |
| CN111367583A (en) * | 2020-03-10 | 2020-07-03 | 中国工商银行股份有限公司 | Service loading method and device, electronic equipment and medium |
| CN111507636A (en) * | 2020-04-22 | 2020-08-07 | 时时同云科技(成都)有限责任公司 | Business process running state analysis method and system |
| CN111754200A (en) * | 2020-06-29 | 2020-10-09 | 深圳前海微众银行股份有限公司 | Service processing method and device |
| CN112101803A (en) * | 2020-09-21 | 2020-12-18 | 腾讯科技（深圳）有限公司 | Business process monitoring method, device, system, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113064905A (en) | 2021-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9092244B2 (en) | System for developing custom data transformations for system integration application programs | |
| CN111291103B (en) | Interface data analysis method and device, electronic equipment and storage medium | |
| CN111177433B (en) | Method and apparatus for parallel processing of information | |
| CN110908967B (en) | Method, device, equipment and computer readable medium for storing log | |
| WO2022063300A1 (en) | Allocation information generation method, item allocation method and apparatus, device and medium | |
| CN111784222A (en) | Method and device for processing orders | |
| CN110737655B (en) | Method and device for reporting data | |
| CN112288545A (en) | Information processing method, information transmitting method, information updating method, information processing apparatus, information updating apparatus, and information updating medium | |
| CN113064905B (en) | Business process processing method, device, electronic equipment and computer readable medium | |
| CN115660244B (en) | Route information generation method, device, equipment and medium | |
| CN110730109A (en) | Method and apparatus for generating information | |
| CN111626802A (en) | Method and apparatus for processing information | |
| CN115526587A (en) | Method and device for generating customs message | |
| CN112507676B (en) | Method and device for generating energy report, electronic equipment and computer readable medium | |
| CN113986959A (en) | Logistics information acquisition method and device, electronic equipment and computer readable medium | |
| CN113723892A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN113112202A (en) | Item information sending method, item information sending device, electronic equipment and computer readable medium | |
| CN113159659A (en) | Method, device, equipment and computer readable medium for updating manifest aging | |
| CN114969059B (en) | Method and device for generating order information, electronic equipment and storage medium | |
| CN113627662B (en) | Inventory data prediction method, apparatus, device and storage medium | |
| WO2023155425A1 (en) | Goods transfer method and apparatus, electronic device, and computer-readable medium | |
| CN112650528B (en) | Personalized algorithm generation method, device, electronic equipment and computer readable medium | |
| CN113962782A (en) | Order information processing method and device, electronic equipment and computer readable medium | |
| CN113554385B (en) | Distribution robot control method, distribution robot control device, electronic equipment and computer readable medium | |
| CN113743807B (en) | Scheduling information generation method, device, electronic equipment and computer readable medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |