CN113064905A - Business process processing method and device, electronic equipment and computer readable medium - Google Patents
Business process processing method and device, electronic equipment and computer readable medium Download PDFInfo
- Publication number
- CN113064905A CN113064905A CN202110322056.9A CN202110322056A CN113064905A CN 113064905 A CN113064905 A CN 113064905A CN 202110322056 A CN202110322056 A CN 202110322056A CN 113064905 A CN113064905 A CN 113064905A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- execution
- node information
- business process
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 164
- 230000008569 process Effects 0.000 title claims abstract description 130
- 238000003672 processing method Methods 0.000 title claims abstract description 19
- 238000012545 processing Methods 0.000 claims abstract description 86
- 230000004044 response Effects 0.000 claims abstract description 44
- 238000004590 computer program Methods 0.000 claims description 9
- 230000002159 abnormal effect Effects 0.000 description 33
- 238000010586 diagram Methods 0.000 description 11
- 230000000694 effects Effects 0.000 description 11
- 238000012546 transfer Methods 0.000 description 11
- 230000006870 function Effects 0.000 description 8
- 238000012550 audit Methods 0.000 description 7
- 230000010365 information processing Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000005856 abnormality Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000010998 test method Methods 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 239000003795 chemical substances by application Substances 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000013024 troubleshooting Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000001364 causal effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 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
Images
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: 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 represents the node information, and updating the node execution information included in the node information; and generating the service flow information according to the node information set and the initial service flow information. The implementation mode improves the execution efficiency of the business process.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to a business process processing method, a business process processing device, electronic equipment and a computer readable medium.
Background
With the popularization of computer technology, more and more business processes gradually begin to develop towards the direction of electronization, systemization and automation. At present, in the process of business process, the following methods are generally adopted: and converting the business process into the workflow, thereby realizing the automation of the business process.
However, when the above-described manner is adopted, there are often technical problems as follows:
in the service flow, it is often difficult to process a more complex service logic in the service flow, and thus, processing steps in the service flow may not be normally executed, which affects execution efficiency of the service flow.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary 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 a business process handling method, apparatus, electronic device and computer readable medium 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, including: acquiring a node information set, wherein 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 is updated, and updating node execution information included in the node information; and generating the service flow information according to the node information set and the initial service flow information.
Optionally, the updating the node execution information included in the node information includes: sending node information updating 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 service flow information includes: the method comprises the steps that first node information, last node information, a middle node information set and a node connection information set are obtained; and generating the service flow information according to the node information set and the initial service flow information, including: according to the initial business process information, connecting nodes corresponding to each node information in the node information set to generate a business process line; determining node information corresponding to a first node of the business process line as the first node information; determining node information corresponding to a final node of the business process line as the final node information; determining node information corresponding to each target node in the business process 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 business processing process; and determining the connection information corresponding to every two adjacent nodes in the business process line as node connection information to obtain the node connection information set.
Optionally, the method further includes: generating candidate task information according to the first node information included in the business process information; according to the candidate task information, executing the following processing steps: determining the node type of a node corresponding to the candidate task information; in response to determining that the node type is a first node type or a second node type, executing a service 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 responding to the fact that the execution of the business logic is finished and the candidate task information is the task information corresponding to the end node information, and finishing the processing steps.
Optionally, the method further includes: and in response to the fact that the execution of the service logic is finished and the node type is the first node type, re-determining the candidate task information according to the return value of the service logic and the connection information corresponding to the candidate task information, and executing the processing step 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 executing the service logic corresponding to the target node execution information in response to the fact that the node type is determined to be the third node type and the task trigger signal is received.
Optionally, the method further includes: and in response to determining that the service logic is completely executed and the node type is the second node type or the third node type, re-determining the candidate task information according to the connection information corresponding to the candidate task information, and executing the processing step again.
In a second aspect, some embodiments of the present disclosure provide an apparatus for processing a business process, the apparatus including: an obtaining unit configured to obtain a node information set, wherein node information in the node information set includes: node execution information; the determining unit is configured to determine 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 representation corresponding to the node information indicates to update the node information, and update node execution information included in the node information; and the generating unit is configured to generate the business process information according to the node information set and the initial business process information.
Optionally, the update unit is configured to: sending node information updating 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 service flow information includes: the method comprises the steps that first node information, last node information, a middle node information set and a node connection information set are obtained; and the generating unit is configured to: according to the initial business process information, connecting nodes corresponding to each node information in the node information set to generate a business process line; determining node information corresponding to a first node of the business process line as the first node information; determining node information corresponding to a final node of the business process line as the final node information; determining node information corresponding to each target node in the business process 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 business processing process; and determining the connection information corresponding to every two adjacent nodes in the business process line as node connection information to obtain the node connection information set.
Optionally, the apparatus further comprises: generating candidate task information according to the first node information included in the business process information; according to the candidate task information, executing the following processing steps: determining the node type of a node corresponding to the candidate task information; in response to determining that the node type is a first node type or a second node type, executing a service 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 responding to the fact that the execution of the business logic is finished and the candidate task information is the task information corresponding to the end node information, and finishing the processing steps.
Optionally, the apparatus further comprises: and in response to the fact that the execution of the service logic is finished and the node type is the first node type, re-determining the candidate task information according to the return value of the service logic and the connection information corresponding to the candidate task information, and executing the processing step 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 executing the service logic corresponding to the target node execution information in response to the fact that the node type is determined to be the third node type and the task trigger signal is received.
Optionally, the apparatus further comprises: and in response to determining that the service logic is completely executed and the node type is the second node type or the third node type, re-determining the candidate task information according to the connection information corresponding to the candidate task information, and executing the processing step 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, cause the one or more processors to implement the method described in any of the implementations of the first aspect.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium on which a computer program is stored, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first aspect.
The above embodiments of the present disclosure have the following beneficial effects: 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 the service flow, it is often difficult to process the more complex service logic in the service flow. Based on this, in the business process processing method of some embodiments of the present disclosure, first, a node information set is obtained. In practical situations, a business process often includes at least one processing node, and each processing node of the at least one processing node often corresponds to at least one processing step. Therefore, the node information set related to the business process is acquired. And providing data support for subsequent business process information generation. In addition, the check information corresponding to each node information in the node information set is determined, and a check information set is obtained. Further, for each piece of node information in the node information set, updating the node information in response to determining that the check information representation corresponding to the piece of node information corresponds to the piece of node information, and updating the node execution information included in the piece of node information. In practical situations, there may be an exception (e.g., an output exception of a code segment) in the business logic corresponding to a processing step. Therefore, it is necessary to check node information corresponding to the processing node. When the service 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 service flow can be normally executed. And finally, generating the service flow information according to the node information set and the initial service flow information. In an actual situation, the execution sequence of the processing nodes corresponding to the node information in the node information set often has a precedence order, and the processing nodes corresponding to the node information in the node information set are connected through the initial service flow information to generate the service flow information corresponding to the service flow. According to the method and the device, the execution logic corresponding to each processing node is added into the business process, so that more complex business logic can be processed. 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 various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and elements are not necessarily drawn to scale.
FIG. 1 is a schematic illustration of an application scenario of a business process processing method of some embodiments of the present disclosure;
FIG. 2 is a flow diagram of some embodiments of a business process processing method according to the present disclosure;
FIG. 3 is a schematic illustration of a business process line;
FIG. 4 is a flow diagram of further embodiments of a business process processing method according to the present disclosure;
FIG. 5 is a schematic block diagram of some embodiments of a business process processing apparatus 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 is to be understood that the 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 for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the 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 of some embodiments of the present disclosure.
In the application scenario of fig. 1, first, the computing device 101 may obtain a node information set, where node information in the node information set includes: node execution information; secondly, the computing device 101 may determine check information (e.g., [ abnormal indication value: "0", abnormal type: "NULL", abnormal position: "NULL") corresponding to each node information in the node information set, to obtain 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 representation corresponding to the node information indicates that the node information is updated, and update the node execution information included in the node information; finally, the computing device 101 may generate business process information based on 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, it may be implemented as a distributed cluster composed of multiple 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 enumerated above. It may be implemented, for example, as multiple software or software modules to provide distributed services, or as a single software or software module. And 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 implementation needs dictate.
With continued reference to fig. 2, a flow 200 of some embodiments of a business process processing method according to the present disclosure is shown. The business process processing method comprises the following steps:
In some embodiments, an executing entity (e.g., the computing device 101 shown in fig. 1) of the business process processing method may obtain the node information set by means of wired connection or wireless connection. The node information in the node information set may include: the node executes the information. And 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 characterize the node execution logic of the 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. A 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 above-described business scenario may be a "user order" scenario. The "user order" scenario may include: the order information acquisition node, the order verification node and the warehouse allocation node. Wherein. The "order information acquisition node" may include: and acquiring order information. The "order check node" may include: and checking the order validity. The "warehouse deployment node" may include: and allocating the corresponding article from the warehouse in response to the order being legal.
Optionally, the node information in the node information set further includes: node name, node role description information, node type and node parameters. Wherein the node role description information is used for describing the node role. The node parameter may be a parameter for passing in a node execution logic corresponding to the node execution information included in the node information.
In some embodiments, the execution subject may determine check information corresponding to each node information in the node information set, to obtain a 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 main body may test a node execution logic corresponding to the node execution information included in the node information by using a target test method, so as to generate the verification information. The target test method may be, but is not limited to, any one of the following: equivalence class classification, boundary value analysis, error inference and causal graph. The verification information may include: an exception identification value, an exception type, and an exception location. The abnormal identification value may represent whether the node execution logic corresponding to the node execution information has an abnormality. The above-mentioned anomaly types may characterize the type of anomaly. The exception location may characterize a location of the node execution logic where the exception occurred.
As an example, the check information may be [ abnormal flag value: "1", anomaly type: "type 1", abnormal position: "line 322" ]. The "1" can represent that the node execution logic corresponding to the node execution information has an exception and needs to be updated.
As yet another example, the check information may be [ abnormal flag value: "0", exception type: "NULL", abnormal position: "NULL" ]. The "0" can represent that the node execution logic corresponding to the node execution information has no exception and does not need to be updated. When the anomaly identification value is "0", the anomaly type and the anomaly location included in the check information may be NULL values, and the NULL values may be represented by "NULL".
In some embodiments, the executing entity updates, for each node information in the node information set, the node information in response to determining that the check information representation corresponding to the node information represents the node information, and updates the node execution information included in the node information, and may include the following steps:
firstly, determining an abnormal level corresponding to target node information.
The target node information may be node information that needs to be updated. The execution main body may obtain the exception level by querying an exception level comparison data table according to an exception type included in the check information corresponding to the target node information. The abnormality level comparison data table may be a data table for storing the abnormality type and the corresponding abnormality level. The execution body may obtain the exception level corresponding to the target node information from the exception level comparison data table through an SQL (Structured Query Language) statement.
For example, the execution body may obtain the exception level corresponding to the target node information from the exception level comparison data table through the following SQL statement:
the SELECT anomaly level FROM anomaly level comparison data table WHERE anomaly type is "anomaly type".
And secondly, adding the target node information as abnormal information to an abnormal information processing queue according to the abnormal level corresponding to the target node information.
The execution main body may first adopt a target sorting algorithm to sort the abnormal information in the abnormal information processing queue according to a target sequence and an abnormal level corresponding to the abnormal information in the abnormal information processing queue, so as to generate a sorted abnormal information processing queue. And secondly, inserting the target node information as abnormal information into a target position in the sorted abnormal information processing queue. The target sorting algorithm may be, but is not limited to, any one of the following: bubble sort algorithm, hill sort algorithm, quick sort algorithm, and insert sort algorithm. The target order may be in a descending order. The target sequence may be from small to large. The target position may be a position in the sorted abnormal information processing queue where an abnormal level corresponding to a previous abnormal information is equal to or less than an abnormal level corresponding to the target node information, and an abnormal level corresponding to a next abnormal information is greater than the abnormal level corresponding to the target node information.
And thirdly, acquiring node execution information of the latest version corresponding to each abnormal information in the updated abnormal information processing queue from a version information base.
The version information base may be a database for storing node execution information of each version corresponding to the exception information.
And fourthly, testing the node execution information of the latest version by the target test method.
And fifthly, responding to the passing test of the node execution information of the latest version, and determining the node execution information of the latest version as the node execution information included in the node information corresponding to the abnormal information so as to update the node execution information to be updated.
The node information to be updated may be the node information included in the node information that is represented by the corresponding check information and updated by the node information.
In some optional implementation manners of some embodiments, for each node information in the node information set, the executing body updates the node information in response to determining that the check information representation corresponding to the node information represents that the node information is updated, and updates the node execution information included in the node information, which may include the following steps:
firstly, sending node information updating request information to a target terminal.
The execution body may send the node information update request information to the target terminal through a wired connection or a wireless connection. The target terminal may be a terminal used by a troubleshooting worker for performing troubleshooting processing on node information that needs to be updated. The node information update request information may include: the exception marking value, the exception type, the exception position and the node execution information included by the node.
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 obtained by eliminating the exception from 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.
And step 204, generating service flow information according to the node information set and the initial service flow information.
In some embodiments, the execution subject may generate the business process information according to the node information set and the initial business process information. The initial service process information may represent an execution sequence relationship between processing nodes in the target service process. The execution body may combine the node information sets in order according to the initial business process information to generate the business process information.
Optionally, the service flow information may include: the method comprises the steps of first node information, end node information, a middle node information set and a node connection information set. The first node information may be node information corresponding to a first node of a service flow corresponding to the service flow information. The end node information may be node information corresponding to an end node of a service flow corresponding to the service flow information. The intermediate node information in the intermediate node information set may be node information corresponding to nodes of a non-head node and a non-tail node of the service flow corresponding to the service flow information. The node connection information in the node connection information set can represent the connection relationship between two adjacent nodes.
The initial traffic flow information may be, for example, [ a node-B node, B node-C node, C node-D node ]. The node information set may be [ node information corresponding to the C node, node information corresponding to the B node, node information corresponding to the D node, and node information corresponding to the a node ]. The service flow information may be [ node information corresponding to the node a, node information corresponding to the node B, node information corresponding to the node C, and node information corresponding to the node D ].
Optionally, the executing body generates the service flow information according to the node information set and the initial service flow information, and may include the following steps:
firstly, according to the initial business process information, connecting nodes corresponding to each node information in the node information set 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. May be a business process line corresponding to the above "supply chain" scenario. The "supply chain" scenario described above may be when a user order is received, and the most recent warehouse shipment is selected based on the ship to address. When the latest warehouse is in short stock, the warehouse is selected to be dispatched from other warehouses or purchased from suppliers. The "supply chain" scenario described above may include: "Accept order event node 301", "audit event node 302", "inventory gateway node 303", "transfer event node 304", "transfer complete event node 307", "warehouse ship node 305", "purchase event node 306", and "purchase complete event node 308". The "audit event node 302" described above may be used to audit an accepted order. The above-mentioned "inventory gateway node 303" is used to determine the inventory status. For example, the "warehouse shipping node 305" may continue to execute when the inventory of the nearest warehouse is able to meet the order requirements. The execution of "transfer activity node 304" may continue when the inventory of the nearest warehouse is not able to meet the order requirements, but other warehouses have items with order requirements. When none of the warehouses contain items required by the order, execution may continue with "purchase activity node 306".
And secondly, determining the node information corresponding to the first node of the business process line as the first node information.
As an example, the execution agent may determine node information corresponding to the "order activity receiving node 301" as the head node information.
And thirdly, determining the node information corresponding to the end node of the business process line as the end node information.
As an example, the execution subject may determine node information corresponding to "warehouse shipping node 305" as the end node information.
And fourthly, determining node information corresponding to each target node in the business process line as intermediate node information to obtain 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", "transfer activity node 304", "transfer 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 every two adjacent nodes in the business process line as node connection information to obtain the node connection information set.
Wherein, the connection information may include: a start node name and an end node name.
As an example, the node connection information set may be [ (order receiving active node, audit event node), (audit event node, inventory gateway node), (inventory gateway node, allocation active node), (inventory gateway node, warehouse shipping node), (inventory gateway node, purchase active node), (allocation active node, allocation completion event node), (allocation completion event node, warehouse shipping node), (purchase active node, purchase completion event node) ].
Optionally, the process instance parameters are set.
In some embodiments, the execution agent may set a process instance parameter. The process instance parameter may be used to be transmitted in a service logic corresponding to node execution information included in target node information, where the target node information may be node information corresponding to a node included in a target service process, and the target service process may be a service process corresponding to the service process information.
The above embodiments of the present disclosure have the following beneficial effects: 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 the service flow, it is often difficult to process the more complex service logic in the service flow. Based on this, in the business process processing method of some embodiments of the present disclosure, first, a node information set is obtained. In practical situations, a business process often includes at least one processing node, and each processing node of the at least one processing node often corresponds to at least one processing step. Therefore, the node information set related to the business process is acquired. And providing data support for subsequent business process information generation. In addition, the check information corresponding to each node information in the node information set is determined, and a check information set is obtained. Further, for each piece of node information in the node information set, updating the node information in response to determining that the check information representation corresponding to the piece of node information corresponds to the piece of node information, and updating the node execution information included in the piece of node information. In practical situations, there may be an exception (e.g., an output exception of a code segment) in the business logic corresponding to a processing step. Therefore, it is necessary to check node information corresponding to the processing node. When the service 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 service flow can be normally executed. And finally, generating the service flow information according to the node information set and the initial service flow information. In an actual situation, the execution sequence of the processing nodes corresponding to the node information in the node information set often has a precedence order, and the processing nodes corresponding to the node information in the node information set are connected through the initial service flow information to generate the service flow information corresponding to the service flow. According to the method and the device, the execution logic corresponding to each processing node is added into the business process, so that more complex business logic can be processed. 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 a business process processing method is illustrated. The process 400 of the business process processing method includes the following steps:
In some embodiments, the specific implementation of steps 401 and 403 and the technical effect thereof may refer to steps 201 and 203 in the embodiments corresponding to fig. 2, which are not described herein again.
In some embodiments, the execution subject may determine the head node information as the candidate task information.
In some embodiments, the execution subject may determine a node type of a node corresponding to the candidate task information. Wherein, 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 respectively correspond to three node types, namely an event, an activity, and a gateway, included in a stream object in a BPMN (Business Process Model and notification).
As an example, the node name of the node corresponding to the candidate task information may be "transfer active node", and the node type corresponding to the candidate task information may be "second node type".
Wherein, the task trigger signal may be sent by the target user. The target user may be a related person corresponding to a business process corresponding to the business process information.
As an example, as shown in fig. 3. For the "receive order activity node 301", the task trigger signal may be an order request sent by an order placing user.
The target node execution information may be node execution information included in node information corresponding to the candidate task. The execution main body can execute the codes corresponding to the business logic to realize that the execution target node executes the business logic corresponding to the information.
The execution main body can monitor through creating a thread, and when the thread corresponding to the service logic disappears, the execution of the service logic can be determined to be finished.
As an example, as shown in fig. 3. The end node of the business process corresponding to the "supply chain" scenario may be "warehouse shipping node 305". The candidate task information may be task information corresponding to the "warehouse shipping node 305". When the business logic of the "warehouse shipping node 305" is completed, the processing steps are terminated.
As an example, as shown in fig. 3, the "inventory gateway node 303" has a wiring relationship with the "transfer activity node 304", "warehouse shipping node 305", and "procurement activity node 306", respectively. When the return value of the service logic corresponding to the "inventory gateway node 303" is "1", the node information corresponding to the "transfer active node 304" may be determined as the candidate task information. When the return value of the business logic corresponding to the "inventory gateway node 303" is "2", the node information corresponding to the "warehouse shipping node 305" may be determined as the candidate task information. When the return value of the business logic corresponding to the "inventory gateway node 303" is "3", the node information corresponding to the "procurement activity node 306" may be determined as the candidate task information.
As an example, as shown in fig. 3. After the service 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 "transfer active node 304" is executed, the node information corresponding to the "transfer completion event node 307" may be determined as candidate task information. "
As can be seen from fig. 4, compared with the description of some embodiments corresponding to fig. 2, the present disclosure adds an execution method of the business process corresponding to the business process information. In practical situations, a business process often includes more processing nodes, and different processing nodes have different node types and different execution modes. For example, when the node type of the processing node is the first node type, in an actual situation, the processing node of the first node type is often connected to at least one processing node, and therefore, a 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 executing the corresponding service logic. Therefore, the service logic corresponding to the processing node of the third node type is executed only when the task trigger signal is received. In this way, 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 methods shown in the above-mentioned figures, the present disclosure provides some embodiments of a business process processing apparatus, which correspond to those of the method embodiments shown in fig. 2, and which may be specifically applied to various electronic devices.
As shown in fig. 5, the business process processing apparatus 500 of some embodiments includes: an acquisition unit 501, a determination unit 502, an update unit 503, and a generation unit 504. The obtaining unit 501 is configured to obtain a node information set, where node information in the node information set includes: node execution information; a determining unit 502 configured to determine check information corresponding to each node information in the node information set, so as to obtain a check information set; an updating unit 503 configured to, for each node information in the node information set, in response to determining that the check information representation corresponding to the node information updates the node information, update node execution information included in the node information; a generating unit 504 configured to generate the 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 updating 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 service flow information includes: the method comprises the steps that first node information, last node information, a middle node information set and a node connection information set are obtained; and the generating unit 504 is configured to: according to the initial business process information, connecting nodes corresponding to each node information in the node information set to generate a business process line; determining node information corresponding to a first node of the business process line as the first node information; determining node information corresponding to a final node of the business process line as the final node information; determining node information corresponding to each target node in the business process 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 business processing process; and determining the connection information corresponding to every two adjacent nodes in the business process 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, executing the following processing steps: determining the node type of a node corresponding to the candidate task information; in response to determining that the node type is a first node type or a second node type, executing a service 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 responding to the fact that the execution of the business logic is finished and the candidate task information is the task information corresponding to the end node information, and finishing the processing steps.
Optionally, the apparatus further comprises: and in response to the fact that the execution of the service logic is finished and the node type is the first node type, re-determining the candidate task information according to the return value of the service logic and the connection information corresponding to the candidate task information, and executing the processing step 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 500 further includes: and executing the service logic corresponding to the target node execution information in response to the fact that the node type is determined to be the third node type and the task trigger signal is received.
Optionally, the apparatus 500 further includes: and in response to determining that the service logic is completely executed and the node type is the second node type or the third node type, re-determining the candidate task information according to the connection information corresponding to the candidate task information, and executing the processing step again.
Referring now to FIG. 6, a block diagram of an electronic device (such as computing device 101 shown in FIG. 1)600 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with 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 necessary 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 via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, 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 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 6 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams 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 illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network through the communication device 609, or installed from the storage device 608, or installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
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. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination 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 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, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. 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, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications 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 network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled 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 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 is updated, and updating node execution information included in the node information; and generating the service flow information according to the node information set and the initial service flow information.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of 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 type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart 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 software, and may also be implemented by hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit, a determination unit, an update unit, and a generation unit. Where the names of these units do not in some cases constitute a limitation on the unit itself, for example, the acquisition unit may also be described as a "unit that acquires a set of node information".
The functions described herein above 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: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology 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-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.
Claims (10)
1. A business process processing method comprises the following steps:
acquiring a node information set, wherein 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 represents the node information, and updating the node execution information included in the node information;
and generating the service flow information according to the node information set and the initial service flow information.
2. The method of claim 1, wherein the updating node execution information included in the node information comprises:
sending node information updating request information to a target terminal;
and responding to the received update information sent by the target terminal, and 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: the method comprises the steps that first node information, last node information, a middle node information set and a node connection information set are obtained; and
generating the service flow information according to the node information set and the initial service flow information includes:
according to the initial business process information, performing connection processing on nodes corresponding to each node information in the node information set to generate a business process line;
determining node information corresponding to a first node of the business process line as the first node information;
determining node information corresponding to a tail node of the business process line as the tail node information;
determining node information corresponding to each target node in the business process line as intermediate node information to obtain an intermediate node information set, wherein the target node is a node other than the first node and the last node in the business processing process;
and determining the connection information corresponding to every two adjacent nodes in the service flow line as node connection information to obtain the node connection information set.
4. The method of 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, executing the following processing steps:
determining the node type of a node corresponding to the candidate task information;
in response to determining that the node type is a first node type or a second node type, executing a service 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 responding to the fact that the execution of the business logic is finished and the candidate task information is the task information corresponding to the end node information, and finishing the processing step.
5. The method of claim 4, wherein the method further comprises:
and in response to the fact that the execution of the service logic is finished and the node type is the first node type, re-determining the candidate task information according to the return value of the service logic and the connection information corresponding to the candidate task information, and executing the processing step again.
6. The method of claim 4, wherein prior to said executing the business 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 comprises:
and in response to the fact that the node type is determined to be the third node type and the task trigger signal is received, executing the business logic corresponding to the target node execution information.
7. The method of claim 5, wherein the method further comprises:
and in response to determining that the service logic is completely executed and the node type is the second node type or the third node type, re-determining the 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 obtaining unit configured to obtain a node information set, wherein node information in the node information set includes: node execution information;
the determining unit is configured to determine 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 representation corresponding to the node information represents updating of the node information, and update node execution information included in the node information;
and the generating unit is configured to generate the business process information according to the node information set and the initial 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, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one 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 true CN113064905A (en) | 2021-07-02 |
| CN113064905B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116523457A (en) * | 2023-04-06 | 2023-08-01 | 广东公信智能会议股份有限公司 | Workflow processing method, device, equipment and storage medium based on business process |
| CN117132245A (en) * | 2023-10-27 | 2023-11-28 | 北京国电通网络技术有限公司 | 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 |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116523457A (en) * | 2023-04-06 | 2023-08-01 | 广东公信智能会议股份有限公司 | Workflow processing method, device, equipment and storage medium based on business process |
| CN117132245A (en) * | 2023-10-27 | 2023-11-28 | 北京国电通网络技术有限公司 | Method, device, equipment and readable medium for reorganizing online article acquisition business process |
| CN117132245B (en) * | 2023-10-27 | 2024-02-06 | 北京国电通网络技术有限公司 | Method, device, equipment and readable medium for reorganizing online article acquisition business process |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113064905B (en) | 2024-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113268336B (en) | Service acquisition method, device, equipment and readable medium | |
| CN111291103A (en) | Interface data analysis method and device, electronic equipment and storage medium | |
| CN108933695B (en) | Method and apparatus for processing information | |
| CN113064905A (en) | Business process processing method and device, electronic equipment and computer readable medium | |
| CN112035344A (en) | Multi-scenario test method, device, equipment and computer readable storage medium | |
| CN110650209A (en) | Method and device for realizing load balance | |
| CN110737655B (en) | Method and device for reporting data | |
| CN112258104A (en) | Transfer information generation method, article transfer method, apparatus, device and medium | |
| CN113190517B (en) | Data integration method and device, electronic equipment and computer readable medium | |
| CN113014618B (en) | Message processing method and system and electronic equipment | |
| CN110389976B (en) | Multi-interface data scheduling method and device | |
| CN113791891A (en) | Continuous integration task construction method, device, equipment and computer readable medium | |
| CN110730109A (en) | Method and apparatus for generating information | |
| CN111626802A (en) | Method and apparatus for processing information | |
| CN113986959A (en) | Logistics information acquisition method and device, electronic equipment and computer readable medium | |
| CN114418482A (en) | Order information processing method and device, electronic equipment and computer readable medium | |
| CN114218313A (en) | Data management method, device, electronic equipment, storage medium and product | |
| CN110780937B (en) | Task issuing method, device, computer readable storage medium and equipment | |
| CN113762876A (en) | Information generation method and device, electronic equipment and computer readable medium | |
| CN113961330A (en) | Distributed timing task execution method, device, equipment and computer readable medium | |
| CN113393288A (en) | Order processing information generation method, device, equipment and computer readable medium | |
| CN113112202A (en) | Item information sending method, item information sending device, electronic equipment and computer readable medium | |
| CN111930704B (en) | Service alarm equipment control method, device, equipment and computer readable medium | |
| CN110221869B (en) | Method and device for configuring data center operating environment | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function |
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 |