CN114489855A - Process node control method and device and computer equipment - Google Patents
Process node control method and device and computer equipment Download PDFInfo
- Publication number
- CN114489855A CN114489855A CN202210102538.8A CN202210102538A CN114489855A CN 114489855 A CN114489855 A CN 114489855A CN 202210102538 A CN202210102538 A CN 202210102538A CN 114489855 A CN114489855 A CN 114489855A
- Authority
- CN
- China
- Prior art keywords
- node
- active
- active node
- area
- currently executed
- 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 123
- 230000008569 process Effects 0.000 title claims abstract description 87
- 238000004590 computer program Methods 0.000 claims description 13
- 238000010586 diagram Methods 0.000 description 7
- 230000000694 effects Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 238000004886 process control Methods 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000011144 upstream manufacturing Methods 0.000 description 2
- 230000004069 differentiation Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
- G06F9/4482—Procedural
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a process node control method, a device and computer equipment, relates to the technical field of network security, and is used for meeting the execution requirement of active nodes in a parallel iteration process. The method mainly comprises the following steps: acquiring the positions corresponding to an active node and a logic node in a target service process respectively; dividing the active node into a plurality of active node areas according to the position of the logic node, wherein each active node area corresponds to position identification information; determining a currently executed active node area according to the position of a currently executed active node in a target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state; determining a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area; and setting the active nodes in the next active node area to be in an execution state.
Description
Technical Field
The present application relates to the field of process control technologies, and in particular, to a method and an apparatus for controlling a process node, a computer device, and a storage medium.
Background
With the increase of service complexity, the differentiation and individuation requirements of the client are continuously enhanced, and the related process control nodes and process control complexity are also continuously improved. The traditional flow has two control modes: one is the control flow is started integrally, and the control flow is driven integrally, once the flow is driven, all active nodes under the flow enter an execution state; one is control flow step-by-step driving, which is a control flow step-by-step driving mode, after the flow is started, only the next active node enters an execution state, and other active nodes are in a waiting state.
However, in the actual process execution process, part of the branch active nodes are not executed, so that the whole process start cannot meet the requirement of starting the active nodes with pertinence; part of serial activities need to be started in advance to perform parallel iteration, and the requirement of the start in advance cannot be met for the flow step-by-step start.
Disclosure of Invention
The embodiment of the application provides a process node control method, a process node control device, computer equipment and a storage medium, which are used for meeting the execution requirements of active nodes in a parallel iteration process.
The embodiment of the invention provides a process node control method, which comprises the following steps:
acquiring the positions corresponding to an active node and a logic node in a target service process respectively;
dividing the active node into a plurality of active node areas according to the position of the logic node, wherein each active node area corresponds to position identification information and at least one active node is included in each active node area;
determining a currently executed active node area according to the position of the currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
determining a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area;
and setting the active nodes in the next active node area to be in an execution state.
An embodiment of the present invention provides a flow node control apparatus, including:
the acquisition module is used for acquiring the positions corresponding to the active node and the logic node in the target business process respectively;
the dividing module is used for dividing the active node into a plurality of active node areas according to the position of the logic node, each active node area corresponds to position identification information, and each active node area at least comprises one active node;
a determining module, configured to determine a currently executed active node area according to a position of a currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
the determining module is further configured to determine a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the last logical node, and the location identification information of the currently executed active node area;
a setting module, configured to set the active node in the next active node area to an execution state.
A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the above flow node control method when executing the computer program.
A computer-readable storage medium storing a computer program which, when executed by a processor, implements the above-described flow node control method.
The application provides a process node control method, a device, a computer device and a storage medium, firstly, the corresponding positions of an active node and a logic node in a target service process are obtained, then the active node is divided into a plurality of active node areas according to the positions of the logic nodes, each active node area corresponds to position identification information, each active node area at least comprises one active node, the currently executed active node area is determined according to the position of the currently executed active node in the target service process, and the next active node area is determined according to the execution state of the active node in the currently executed active node area, the content information of the last logic node and the position identification information of the currently executed active node area; and setting the active nodes in the next active node area to be in an execution state. Compared with the existing integral flow starting and step-by-step flow driving mode, the method and the device have the advantages that the active nodes in the active node area are set to be in the execution state in a targeted manner according to the execution process of the flow, so that the active nodes in the targeted execution flow can be met, and the execution requirements of the active nodes in the parallel iteration flow can be met.
Drawings
Fig. 1 is a flowchart of a flow node control method provided in the present application;
FIG. 1a is a schematic view of a target business process provided by the present application;
FIG. 2 is a flow chart of another flow node control method provided by the present application;
fig. 3 is a schematic structural diagram of a flow node control apparatus provided in the present application;
fig. 4 is a schematic diagram of a computer device provided in the present application.
Detailed Description
In order to better understand the technical solutions described above, the technical solutions of the embodiments of the present application are described in detail below with reference to the drawings and the specific embodiments, and it should be understood that the specific features of the embodiments and the embodiments of the present application are detailed descriptions of the technical solutions of the embodiments of the present application, and are not limitations of the technical solutions of the present application, and the technical features of the embodiments and the embodiments of the present application may be combined with each other without conflict.
Referring to fig. 1, a method for controlling a process node according to an embodiment of the present invention includes steps S101 to S105:
step S101, acquiring the corresponding positions of the active node and the logic node in the target service process.
The active nodes are nodes which need to execute actions, and the active nodes need participation of people. Whether the active node performs in this embodiment is not determined by the upstream active node, but is determined by the active node area to which the active node corresponds. The logic nodes comprise AND, OR AND judgment nodes, do not need human participation, AND are driven by the upstream nodes OR not; the logic node drives the downstream node after finishing.
In this embodiment, each node corresponds to a node type, the type to which each node in the service flow belongs can be determined by the node type, and if the node type is an active node, it is determined that the corresponding node is an active node; if the node type is a logical node, it indicates that the corresponding node is a logical node.
And step S102, dividing the active nodes into a plurality of active node areas according to the positions of the logic nodes.
And each active node area corresponds to position identification information and at least comprises one active node. The location identification information is used to identify an arrangement order corresponding to the active node area, and the location identification information may be specifically represented by 1-N.
In an optional embodiment provided by the present application, the dividing the active node into a plurality of active node areas according to the location of the logical node includes:
s1021, determining all active nodes before the 1 st logical node as nodes in the 1 st active node area, wherein the position identification information of the first active node area is 1;
s1022, determining all active nodes between the Nth logical node and the (N + 1) th logical node as an (N + 1) th active node area; the position identification information of the Nth active node area is N; the N is more than or equal to 1;
s1023, all active nodes after the last 1 logic node are determined as nodes in an Mth active node area, the position identification information of the Mth active node area is M, and M is larger than the N + 1.
For example, if the target service flow includes 3 logical nodes, all active nodes before the 1 st logical node are determined as nodes in the 1 st active node area, the location identification information of the first active node area is 1, all active nodes between the 1 st logical node and the 2 nd logical node are determined as the 2 nd active node area, the location identification information of the second active node area is 2, all active nodes after the 3 rd logical node are determined as the 3 rd active node area, and the location identification information of the 3 rd active node area is 3.
Step S103, determining the currently executed active node area according to the position of the currently executed active node in the target business process.
All active nodes in the currently executed active node area are in an execution state, and nodes except the active nodes in the currently executed active node area are in a waiting state. A waiting state: including but not limited to inactive, unpublished, and undelivered execution states: the execution state includes, but is not limited to, not accepted, issued, and in progress, which is not specifically limited in this embodiment.
It should be noted that, in the embodiment, nodes in the target service flow all correspond to a sequential execution order, so that according to a position of a currently executed active node, a currently executed active node area may be determined. If the current execution activity node is an activity node, determining a corresponding current execution activity node area according to the position of the current execution activity node. For example, the 1 st active node area in the target business process includes 3 active nodes, and if the currently executed active node is the 1 st active node, it is determined that the currently executed active node area is the 1 st active node area.
Step S104, determining the next active node area according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area.
In an optional embodiment provided by the present application, the determining a next active node area according to the execution state of the active node in the currently executed active node area, the logic information of the end logic node, and the location identification information of the currently executed active node area includes:
1041. if the logic information is in an and relationship, after the execution of all the active nodes in the currently executed active node area is determined to be completed, the next active node area is determined according to the position identification information of the currently executed active node area.
As shown in the schematic diagram of the target service flow shown in fig. 1a, if the logical node in the diagram is an AND the location identification information of the currently executed active node area is 1, after it is determined that all of the active nodes 1 to 4 in the currently executed active node area are executed, the location identification information of the next active node area is determined to be 2.
1042. If the logic information is an OR relationship, after determining that the execution of any node in a plurality of parallel active nodes in the currently executed active node area is completed, determining the next active node area according to the position identification information of the currently executed active node area.
As shown in the schematic target service flow diagram of fig. 1a, if the logical node in the diagram is an OR and the location identification information of the currently executed active node area is 1, after the execution of the active node 1, the active node 2, and the active node 3 in the currently executed active node area is determined to be completed, OR after the execution of the active node 1, the active node 2, and the active node 4 is completed, the location identification information of the next active node area is determined to be 2.
1043. If the logic information is the preset judgment content, after determining that the active node in the currently executed active node area meets the preset judgment content, determining the next active node area according to the position identification information of the currently executed active node area.
As shown in the schematic diagram of the target service flow shown in fig. 1a, if the corresponding judgment content of the logical node is that the results obtained by the active node 3 and the active node 4 are the same, after it is determined that all the active nodes 1 to 4 in the currently executed active node area are executed, and the results obtained by the active node 3 and the active node 4 are the same, it is determined that the identification information of the next active node area is 2.
Step S105 sets the active node in the next active node area to the execution state.
The application provides a process node control method, firstly, the corresponding positions of an active node and a logic node in a target service process are obtained, then the active node is divided into a plurality of active node areas according to the positions of the logic nodes, each active node area corresponds to position identification information, each active node area at least comprises one active node, the currently executed active node area is determined according to the position of the currently executed active node in the target service process, and the next active node area is determined according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area; and setting the active nodes in the next active node area to be in an execution state. Compared with the existing integral flow starting and step-by-step flow driving mode, the method and the device have the advantages that the active nodes in the active node area are set to be in the execution state in a targeted manner according to the execution process of the flow, so that the active nodes in the targeted execution flow can be met, and the execution requirements of the active nodes in the parallel iteration flow can also be met.
Referring to fig. 2, another method for controlling a process node according to an embodiment of the present invention includes steps S201 to S206:
step S201, determine whether the target business process corresponds to a parent node.
The parent node of the target service flow is an upper node of the target service flow, and the specific embodiment may determine whether there is a parent node through the node hierarchy identifier, where if the node hierarchy identifier corresponding to the target service flow corresponds to 1, it indicates that the target service flow corresponds to the parent node, and the corresponding parent node is 1. For example, the target business process includes active node 11, active node 12, and active node 13, and the parent node corresponding to the target business process is active node 1.
Step S202, if not, the corresponding positions of the active node and the logical node in the target business process are obtained.
In this embodiment, if the target business process has no corresponding parent node, directly obtaining whether the target business process corresponds to the parent node.
In step S202B, if yes, the status information of the parent node is obtained, and it is determined whether the status information is in an execution status.
Step S202 and step S202B are parallel steps, and if the target business process has a corresponding parent node, state information of the parent node is obtained, where the state information is used to indicate a state of the parent node, and specifically includes an execution state, a waiting state, and an editing state.
After acquiring the state information of the parent node, the present embodiment determines whether the state information is an execution state, and if the state information is the execution state, the present embodiment jumps to step S202 to continue execution.
Step S202, if yes, the corresponding positions of the active node and the logical node in the target business process are obtained.
Further, if the state information of the parent node is in a waiting state, the waiting state of all nodes in the target business process is maintained. And if the state information of the father node is in an editing state, determining that the target business process cannot be driven.
Step S203, dividing the active nodes into a plurality of active node areas according to the positions of the logic nodes.
And each active node area corresponds to position identification information and at least comprises one active node.
Step S204, according to the position of the currently executed active node in the target business process, determining the currently executed active node area.
Wherein all nodes except the active node in the currently executed active node area are in a waiting state.
Further, since there may be a new active node inserted into the currently executed active node area or a certain active node in the currently executed active node area is restarted, in this embodiment, after determining the currently executed active node area according to the position of the currently executed active node in the target business process, the method further includes: determining whether active nodes in the currently executed active node area are all set to be in an execution state; if not, setting the active node which is not set with the execution state in the currently executed active node area as the execution state.
Step S205 determines the next active node area according to the execution state of the active node in the currently executed active node area, the content information of the last logical node, and the location identification information of the currently executed active node area.
Step S206, sets the active node in the next active node area to the execution state.
It should be noted that steps S202 to S206 in this embodiment are the same as the description of the corresponding steps in fig. 1, and this embodiment is not repeated herein.
The method carries out targeted setting of the active nodes in the active node area to be in an execution state according to whether a corresponding father node exists in a target business process, the state information of the father node and the execution process of the target business process, so that the active nodes in the targeted execution process can be met, and the execution requirements of the active nodes in a parallel iteration process can be met.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by functions and internal logic of the process, and should not limit the implementation process of the embodiments of the present invention in any way.
In an embodiment, a process node control apparatus is provided, where the process node control apparatus corresponds to the process node control methods in the above embodiments one to one. As shown in fig. 3, the functional modules of the flow node control device are explained in detail as follows:
an obtaining module 31, configured to obtain respective corresponding positions of an active node and a logical node in a target service flow;
a dividing module 32, configured to divide the active node into multiple active node areas according to the location of the logical node, where each active node area corresponds to location identification information, and each active node area at least includes one active node;
a determining module 33, configured to determine a currently executed active node area according to a position of a currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
the determining module 33 is further configured to determine a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the last logical node, and the location identification information of the currently executed active node area;
a setting module 34, configured to set the active nodes in the next active node area to an execution state.
In an optional embodiment, the determining module 33 is further configured to determine whether the target business process corresponds to a parent node;
the obtaining module 31 is specifically configured to, if the target business process has no parent node, obtain respective corresponding positions of an active node and a logical node in the target business process.
In an optional embodiment, the obtaining module 31 is specifically configured to:
if the target business process corresponds to a father node, acquiring the state information of the father node;
if the state information of the father node is an execution state, acquiring the positions corresponding to the active node and the logic node in the target business process respectively;
and if the state information of the father node is in a waiting state, keeping the waiting states of all the nodes in the target business process.
In an optional embodiment, the determining module 33 is further configured to determine that the target business process cannot be driven if the state information of the parent node is an editing state.
In an optional embodiment, the dividing module 32 is specifically configured to:
determining all active nodes before the 1 st logical node as nodes in the 1 st active node area, wherein the position identification information of the first active node area is 1;
determining all active nodes between the Nth logical node and the (N + 1) th logical node as an (N + 1) th active node area; the position identification information of the Nth active node area is N; the N is more than or equal to 1;
and determining all active nodes after the last 1 logical node as nodes in an Mth active node area, wherein the position identification information of the Mth active node area is M, and M is greater than the N + 1.
In an optional embodiment, the determining module 33 is specifically configured to:
if the logic information is in an and relationship, after the execution of all the active nodes in the currently executed active node area is determined to be finished, determining the next active node area according to the position identification information of the currently executed active node area;
if the logic information is an OR relationship, determining a next active node area according to the position identification information of the currently executed active node area after determining that the execution of any node in a plurality of parallel active nodes in the currently executed active node area is finished;
if the logic information is preset judgment content, determining the next active node area according to the position identification information of the currently executed active node area after determining that the active nodes in the currently executed active node area meet the preset judgment content.
In an optional embodiment, the determining module 33 is specifically configured to determine whether all active nodes in the currently executed active node area are set to an execution state; if not, setting the active node which is not set with the execution state in the currently executed active node area as the execution state.
For the specific limitations of the flow node control device, reference may be made to the above limitations of the flow node control method, which is not described herein again. The various modules in the above-described apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a process node control method.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
acquiring the positions corresponding to an active node and a logic node in a target service process respectively;
dividing the active node into a plurality of active node areas according to the position of the logic node, wherein each active node area corresponds to position identification information and at least one active node is included in each active node area;
determining a currently executed active node area according to the position of the currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
determining a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area;
and setting the active nodes in the next active node area to be in an execution state.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
acquiring the positions corresponding to an active node and a logic node in a target service process respectively;
dividing the active node into a plurality of active node areas according to the position of the logic node, wherein each active node area corresponds to position identification information and at least one active node is included in each active node area;
determining a currently executed active node area according to the position of the currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
determining a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area;
and setting the active nodes in the next active node area to be in an execution state.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (10)
1. A method for controlling a process node, the method comprising:
acquiring the positions corresponding to an active node and a logic node in a target service process respectively;
dividing the active node into a plurality of active node areas according to the position of the logic node, wherein each active node area corresponds to position identification information and at least one active node is included in each active node area;
determining a currently executed active node area according to the position of the currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
determining a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the tail logic node and the position identification information of the currently executed active node area;
and setting the active nodes in the next active node area to be in an execution state.
2. The method of claim 1, wherein before obtaining the respective corresponding locations of the active node and the logical node in the target business process, the method further comprises:
determining whether the target business process corresponds to a father node;
the acquiring the positions corresponding to the active node and the logical node in the target service process respectively includes:
and if the target business process has no father node, acquiring the positions corresponding to the active node and the logic node in the target business process respectively.
3. The method of claim 2, further comprising:
if the target business process corresponds to a father node, acquiring the state information of the father node;
if the state information of the father node is an execution state, acquiring the positions corresponding to the active node and the logic node in the target business process respectively;
and if the state information of the father node is in a waiting state, keeping the waiting states of all the nodes in the target business process.
4. The method of claim 3, further comprising:
and if the state information of the father node is an editing state, determining that the target business process cannot be driven.
5. The method according to any of claims 1-4, wherein said dividing said active nodes into a plurality of active node zones according to the location of said logical node comprises:
determining all active nodes before the 1 st logical node as nodes in the 1 st active node area, wherein the position identification information of the first active node area is 1;
determining all active nodes between the Nth logical node and the (N + 1) th logical node as an (N + 1) th active node area; the position identification information of the Nth active node area is N; the N is more than or equal to 1;
and determining all active nodes after the last 1 logical node as nodes in an Mth active node area, wherein the position identification information of the Mth active node area is M, and M is greater than the N + 1.
6. The method according to claim 5, wherein the determining a next active node area according to the execution status of the active node in the currently executed active node area and the logic information of the end logic node, and the location identification information of the currently executed active node area comprises:
if the logic information is in an and relationship, after the execution of all the active nodes in the currently executed active node area is determined to be finished, determining the next active node area according to the position identification information of the currently executed active node area;
if the logic information is an OR relationship, determining a next active node area according to the position identification information of the currently executed active node area after determining that the execution of any node in a plurality of parallel active nodes in the currently executed active node area is finished;
if the logic information is preset judgment content, determining the next active node area according to the position identification information of the currently executed active node area after determining that the active nodes in the currently executed active node area meet the preset judgment content.
7. The method of claim 6, wherein after determining the currently executing active node area according to the location of the currently executing active node in the target business process, the method further comprises:
determining whether active nodes in the currently executed active node area are all set to be in an execution state;
if not, setting the active node which is not set with the execution state in the currently executed active node area as the execution state.
8. A process node control apparatus, the apparatus comprising:
the acquisition module is used for acquiring the positions corresponding to the active node and the logic node in the target business process respectively;
the dividing module is used for dividing the active node into a plurality of active node areas according to the position of the logic node, each active node area corresponds to position identification information, and each active node area at least comprises one active node;
a determining module, configured to determine a currently executed active node area according to a position of a currently executed active node in the target business process; wherein, the nodes except the active nodes in the currently executed active node area are all in a waiting state;
the determining module is further configured to determine a next active node area according to the execution state of the active node in the currently executed active node area, the content information of the last logical node, and the location identification information of the currently executed active node area;
a setting module, configured to set the active node in the next active node area to an execution state.
9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the process node control method according to any one of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, implements the flow node control method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210102538.8A CN114489855B (en) | 2022-01-27 | Flow node control method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210102538.8A CN114489855B (en) | 2022-01-27 | Flow node control method and device and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114489855A true CN114489855A (en) | 2022-05-13 |
| CN114489855B CN114489855B (en) | 2024-06-21 |
Family
ID=
Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000315234A (en) * | 1999-03-03 | 2000-11-14 | Hitachi Ltd | Work flow server and work flow system control method |
| US20040153350A1 (en) * | 2003-01-31 | 2004-08-05 | Handysoft Corporation | System and method of executing and controlling workflow processes |
| CN101242309A (en) * | 2008-03-19 | 2008-08-13 | 中兴通讯股份有限公司 | A failure form processing method |
| CN101610510A (en) * | 2009-06-10 | 2009-12-23 | 南京邮电大学 | Node legitimacy multiple-authentication method in the layer cluster type wireless self-organization network |
| CN102695249A (en) * | 2011-03-23 | 2012-09-26 | 北京天地互连信息技术有限公司 | Energy saving method for IPv6 wireless sensor network |
| CN103307447A (en) * | 2013-06-03 | 2013-09-18 | 清华大学 | Technical failure information monitoring and early warning system for urban gas pipe network |
| CN104378812A (en) * | 2014-11-28 | 2015-02-25 | 北京农业信息技术研究中心 | Differentiated topology control method of renewable energy source nodes of farmland self-organizing network |
| CN106021247A (en) * | 2015-07-14 | 2016-10-12 | 陈兆福 | Method for transmitting information in Internet |
| WO2017045473A1 (en) * | 2015-09-15 | 2017-03-23 | 华为技术有限公司 | Business process operation method and apparatus |
| US20180329752A1 (en) * | 2017-05-12 | 2018-11-15 | Fujitsu Limited | Parallel processing apparatus, job management method, and recording medium recording job management program |
| CN109471691A (en) * | 2018-10-16 | 2019-03-15 | 平安普惠企业管理有限公司 | Flow nodes processing method, device, computer equipment and storage medium |
| US20190104176A1 (en) * | 2017-09-29 | 2019-04-04 | Tektronix, Inc. | Mirroring Flow Configurations for Internet Protocol Receivers |
| WO2020024390A1 (en) * | 2018-08-01 | 2020-02-06 | 平安科技（深圳）有限公司 | Micro-expression-based node information processing method and apparatus, computer device, and storage medium |
| CN111897815A (en) * | 2020-07-15 | 2020-11-06 | 中国建设银行股份有限公司 | Service processing method and device |
| CN112667236A (en) * | 2020-12-28 | 2021-04-16 | 珠海新华通软件股份有限公司 | Method, system and medium for implementing workflow of gridding layout |
| CN112699094A (en) * | 2021-03-23 | 2021-04-23 | 中国信息通信研究院 | File storage method, data retrieval method, corresponding device and system |
| CN113778799A (en) * | 2021-09-10 | 2021-12-10 | 平安科技（深圳）有限公司 | Flow node-based embedded point configuration method, device, equipment and medium |
| CN113868434A (en) * | 2021-09-28 | 2021-12-31 | 北京百度网讯科技有限公司 | Data processing method, device and storage medium for graph database |
| CN113919821A (en) * | 2021-11-02 | 2022-01-11 | 奇安信科技集团股份有限公司 | Service transfer method, device, computer equipment and storage medium |
Patent Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000315234A (en) * | 1999-03-03 | 2000-11-14 | Hitachi Ltd | Work flow server and work flow system control method |
| US20040153350A1 (en) * | 2003-01-31 | 2004-08-05 | Handysoft Corporation | System and method of executing and controlling workflow processes |
| CN101242309A (en) * | 2008-03-19 | 2008-08-13 | 中兴通讯股份有限公司 | A failure form processing method |
| CN101610510A (en) * | 2009-06-10 | 2009-12-23 | 南京邮电大学 | Node legitimacy multiple-authentication method in the layer cluster type wireless self-organization network |
| CN102695249A (en) * | 2011-03-23 | 2012-09-26 | 北京天地互连信息技术有限公司 | Energy saving method for IPv6 wireless sensor network |
| CN103307447A (en) * | 2013-06-03 | 2013-09-18 | 清华大学 | Technical failure information monitoring and early warning system for urban gas pipe network |
| CN104378812A (en) * | 2014-11-28 | 2015-02-25 | 北京农业信息技术研究中心 | Differentiated topology control method of renewable energy source nodes of farmland self-organizing network |
| CN106021247A (en) * | 2015-07-14 | 2016-10-12 | 陈兆福 | Method for transmitting information in Internet |
| WO2017045473A1 (en) * | 2015-09-15 | 2017-03-23 | 华为技术有限公司 | Business process operation method and apparatus |
| US20180329752A1 (en) * | 2017-05-12 | 2018-11-15 | Fujitsu Limited | Parallel processing apparatus, job management method, and recording medium recording job management program |
| US20190104176A1 (en) * | 2017-09-29 | 2019-04-04 | Tektronix, Inc. | Mirroring Flow Configurations for Internet Protocol Receivers |
| WO2020024390A1 (en) * | 2018-08-01 | 2020-02-06 | 平安科技（深圳）有限公司 | Micro-expression-based node information processing method and apparatus, computer device, and storage medium |
| CN109471691A (en) * | 2018-10-16 | 2019-03-15 | 平安普惠企业管理有限公司 | Flow nodes processing method, device, computer equipment and storage medium |
| CN111897815A (en) * | 2020-07-15 | 2020-11-06 | 中国建设银行股份有限公司 | Service processing method and device |
| CN112667236A (en) * | 2020-12-28 | 2021-04-16 | 珠海新华通软件股份有限公司 | Method, system and medium for implementing workflow of gridding layout |
| CN112699094A (en) * | 2021-03-23 | 2021-04-23 | 中国信息通信研究院 | File storage method, data retrieval method, corresponding device and system |
| CN113778799A (en) * | 2021-09-10 | 2021-12-10 | 平安科技（深圳）有限公司 | Flow node-based embedded point configuration method, device, equipment and medium |
| CN113868434A (en) * | 2021-09-28 | 2021-12-31 | 北京百度网讯科技有限公司 | Data processing method, device and storage medium for graph database |
| CN113919821A (en) * | 2021-11-02 | 2022-01-11 | 奇安信科技集团股份有限公司 | Service transfer method, device, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 刘少敏: "基于流程节点的流程优化技术研究", 企业经济, no. 4, 15 April 2013 (2013-04-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110750267A (en) | Service information updating method and device, computer equipment and storage medium | |
| CN111210350A (en) | Block chain transaction method and device, computer equipment and storage medium | |
| CN110969354A (en) | Linear flow configuration method and device, computer equipment and storage medium | |
| CN115344533A (en) | Microservice log retrieval method, microservice log retrieval system, microservice log retrieval control device, and storage medium | |
| CN115098426A (en) | PCIE (peripheral component interface express) equipment management method, interface management module, PCIE system, equipment and medium | |
| CN110955591A (en) | System performance evaluation method and device, computer equipment and storage medium | |
| CN114489855B (en) | Flow node control method and device and computer equipment | |
| CN114489855A (en) | Process node control method and device and computer equipment | |
| CN107122952B (en) | Flow scheduling method and system based on rules | |
| CN116185869A (en) | Software testing method, system, computer equipment and storage medium | |
| CN114780217B (en) | Task scheduling method, device, computer equipment and medium | |
| CN114493287A (en) | Process activity node iteration method and device and computer equipment | |
| CN110688400A (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN113438122B (en) | Heartbeat management method and device for server, computer equipment and medium | |
| CN112000648B (en) | Data clearing method and device, computer equipment and storage medium | |
| CN113609541A (en) | Path-optimized weaving method, device, weaving apparatus and storage medium | |
| CN112887919B (en) | Short message sending method and system for multi-channel short message cluster scheduling and electronic equipment | |
| CN112702269B (en) | SDN and non-SDN intercommunication method and intercommunication system | |
| CN113268348B (en) | Switching method and device of distributed lock server, computer equipment and medium | |
| CN117009043A (en) | Embedded system and message processing method | |
| CN110909761A (en) | Image recognition method and device, computer equipment and storage medium | |
| CN110430090A (en) | A kind of distributed system election queue optimization method and device | |
| CN112616156B (en) | Functional entity configuration method, device, equipment and storage medium | |
| CN115361283B (en) | K8S-based cloud host management method and device and computer equipment | |
| CN115499394B (en) | Message theme processing method, device, equipment and storage 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 |