CN114493287A - Process activity node iteration method, device and computer equipment - Google Patents

Abstract

The application provides a flow activity node iteration method, a flow activity node iteration device and computer equipment, relates to the technical field of flow control, and is used for improving the iteration efficiency of a flow. 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 nodes into a plurality of active node areas according to the positions of the logic nodes; determining a currently executed active node area according to the position of a currently executed active node in a target business process; when the current execution active node generates feedback data, acquiring a target active node corresponding to the feedback data; setting all active nodes in an active node area corresponding to the target active node as an execution state; and the target activity node determines the data content according to the feedback data and transmits the data content to a downstream activity node of the target activity node according to the flow sequence of the target business flow to continue executing.

Description

Process activity node iteration method, device and computer equipment

technical field

The present application relates to the technical field of process control, and in particular, to a process activity node iteration method, apparatus, computer device and storage medium.

Background technique

With the increase of business complexity and the continuous enhancement of client differentiation and personalized requirements, the involved process control nodes and process control complexity are also increasing. In the traditional technical process, the activities under the process are divided into parallel and serial, and the serial has a sequential relationship. After the upstream active node ends, the downstream active node starts. In the actual process execution process, iteration is required. When the upstream activity node is not over, the downstream activity node starts work first, and the downstream activity node provides feedback to the upstream activity node in time. The upstream activity node iterates according to the feedback, and the downstream activity node according to the iteration result. Re-start the work, and so on, until the end result meets the needs.

However, in the actual process execution process, the upstream active node is finalized and then sent to the downstream, and the downstream active node restarts the entire process if the downstream active node calculates that it is not good, the efficiency is too low, and the cycle is too long.

SUMMARY OF THE INVENTION

Embodiments of the present application provide an iterative method, apparatus, computer device, and storage medium for process activity nodes, which are used to improve the iterative efficiency of the process.

An embodiment of the present invention provides an iterative method for process activity nodes, and the method includes:

Obtain the corresponding positions of the active node and the logical node in the target business process;

According to the position of the logical node, the active node is divided into a plurality of active node areas, each active node area corresponds to location identification information, and each active node area includes at least one active node;

According to the position of the current execution active node in the target business process, determine the currently executed active node area; wherein, the node after the active node in the currently executed active node area is in a waiting state;

When the current execution activity node generates feedback data, obtain the target activity node corresponding to the feedback data; the target activity node is the upstream activity node of the current execution activity node;

Setting all active nodes in the active node area corresponding to the target active node to the execution state;

The target activity node determines data content according to the feedback data, and transmits the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process to continue execution.

An embodiment of the present invention provides a process activity node iteration device, the device comprising:

an obtaining module, used to obtain the corresponding positions of the active node and the logical node in the target business process;

A division module, configured to divide the active node into a plurality of active node areas according to the position of the logical node, each active node area corresponds to location identification information, and each active node area includes at least one active node area node;

A determination module, configured to determine the currently executed active node area according to the position of the currently executed active node in the target business process; wherein, the nodes after the active node in the currently executed active node area are all waiting states;

The acquisition module is further configured to acquire a target activity node corresponding to the feedback data when the current execution activity node generates feedback data; the target activity node is an upstream activity node of the current execution activity node;

a setting module for setting all active nodes in the active node area corresponding to the target active node to the execution state;

The iterative module is used for the target activity node to determine data content according to the feedback data, and to transmit the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process for continuous execution. A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the above-mentioned method for iterating on an active node of a process when the processor executes the computer program.

A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, implements the above process activity node iteration method.

The present application provides an iterative method, device, computer equipment and storage medium for process activity nodes. First, the corresponding positions of the activity nodes and logical nodes in the target business process are obtained, and then the activity nodes are divided into multiple activities according to the positions of the logical nodes. Node area, according to the position of the current execution activity node in the target business process, determine the currently executed activity node area, when the current execution activity node generates feedback data, obtain the target activity node corresponding to the feedback data, and assign the activity corresponding to the target activity node. All active nodes in the node area are set to the execution state; the target active node determines the data content according to the feedback data, and transmits the data content to the downstream active node of the target active node according to the process sequence of the target business process to continue execution. When there is feedback data relative to the existing downstream active node, the process mode needs to be restarted. According to the execution process of the process, when the current executing active node generates feedback data to the target active node, the active node area corresponding to the target active node is stored. All the active nodes of the node are set to the execution state, so that the application does not need to restart the entire process when it is determined that feedback data occurs, and only needs to reset the corresponding active node area to the execution state. The execution requirements of active nodes improve the iterative efficiency of the process.

Description of drawings

1 is a flowchart of a process activity node iteration method provided by the application;

1a is a schematic diagram of a target business process provided by the application;

2 is a flowchart of another process activity node iteration method provided by the present application;

2a is a schematic diagram of a target business process provided by the application;

3 is a flowchart of another process activity node iteration method provided by the present application;

4 is a schematic structural diagram of a process activity node iteration device provided by the present application;

FIG. 5 is a schematic diagram of a computer device provided by the present application.

Detailed ways

In order to better understand the above technical solutions, the technical solutions of the embodiments of the present application will be described in detail below with reference to the accompanying drawings and specific embodiments. The detailed description is not intended to limit the technical solutions of the present application, and the embodiments of the present application and the technical features in the embodiments may be combined with each other without conflict.

Referring to FIG. 1 , an iterative method for process activity nodes provided by an embodiment of the present invention specifically includes steps S101 to S105:

In step S101, the respective positions corresponding to the active node and the logical node in the target business process are acquired.

Among them, the active node is a node that needs to perform an action, and the active node requires the participation of people. Whether the active node is executed in this embodiment is not determined by the upstream active node, but determined by the active node area corresponding to the active node. Logical nodes include AND, OR, and judgment nodes. Logical nodes do not require human participation, and whether to execute is driven by upstream nodes; after the logical nodes are completed, they will drive downstream nodes.

In this embodiment, each node will correspond to a node type, and the type of each node in the business process can be determined by the node type. If the node type is an active node, it means that the corresponding node is an active node; if the node type is logical node, it means that the corresponding node is a logical node.

Step S102: Divide the active node into a plurality of active node areas according to the position of the logical node.

Wherein, each active node area corresponds to location identification information, and each active node area includes at least one active node. The location identification information is used to identify the 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, according to the location of the logical node, the active node is divided into multiple active node areas, including:

S1021, determining all active nodes before the first logical node as nodes in the first active node area, and the location identification information of the first active node area is 1;

S1022: Determine all active nodes between the Nth logical node to the N+1th logical node as the N+1th active node area; the location identification information of the Nth active node area is N; the N is greater than is equal to 1;

S1023: Determine all active nodes after the last logical node as nodes in the Mth active node area, where the location identification information of the Mth active node area is M, where M is greater than the N+1.

For example, if the target business process includes 3 logical nodes, all active nodes before the first logical node are determined as nodes in the first active node area, the location identification information of the first active node area is 1, and the first active node area is set to 1. All active nodes between the first logical node and the second logical node are determined as the second active node area, the location identification information of the second active node area is 2, and all active nodes after the third logical node are determined as The third active node area, the location identification information of the third active node area is 3.

Step S103, according to the position of the currently executing active node in the target business process, determine the area of the currently executing active node.

Wherein, all the active nodes in the currently executing active node area are in the executing state, and the nodes after the active nodes in the currently executing active node area are all in the waiting state. Waiting status: including but not limited to inactive, unpublished, and unissued Execution status: Execution status includes but not limited to unaccepted, published, issued, and in progress, which is not specifically limited in this embodiment.

It should be noted that the nodes in the target business process in this embodiment have corresponding execution sequences, so the currently executing active node area can be determined according to the position of the currently executing active node. The currently executing active node may be an active node or a logical node. If the current executing active node is an active node, the corresponding currently executing active node area is determined according to the position of the currently executing active node. For example, the first active node area in the target business process includes three active nodes, and if the currently executing active node is the first active node, it is determined that the current executing active node area is the first active node area.

Step S104 , when the current executing active node generates feedback data, obtain the target active node corresponding to the feedback data; the target active node is the upstream active node of the current executing active node.

The target business process shown in Figure 1a, the currently executing active node is the active node 6, if the active node 6 generates feedback data, then according to the process steering configuration of the target business process, the target active node (active node) corresponding to the active node 6 is determined. 2), the target active node is the active node that the active node needs to feed back data.

Step S105, setting all active nodes in the active node area corresponding to the target active node to the execution state.

As shown in Figure 1a, since the current execution active node is active node 6, that is to say, the active nodes (active node 5 and active node 6) between logical node 1 and logical node 2 are in the execution state, while the previous active node of logical node 1 is in the execution state. The active node is in the execution completed state. Therefore, after obtaining the target active node that needs to be fed back in this embodiment, all active nodes in the active node area corresponding to the target active node need to be set to the execution state, that is, the active node before the logical node. Set to the execution state, so that the active node 2 reformulates the data content based on the received feedback data of the active node 6 .

It should be noted that, in this embodiment, the feedback data and data content are determined according to the actual business process, that is, for different business processes, corresponding active nodes may generate different feedback data, and then the target active node is re-determined based on the feedback data. Corresponding data content, the data content may be the content re-modified by the administrator corresponding to the target active node, or the previous content may not be modified.

Step S106, the target activity node determines the data content according to the feedback data, and transmits the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process to continue execution.

In this embodiment, after the target activity node obtains the feedback data, the current execution activity node is updated to the target activity node, and then different process sequences are selected for execution based on whether the target activity node modifies the previous data. As shown in Figure 1a, if the data content determined by active node 2 is different from the previously set data content, the sequence of processes executed after active node 2 is: active node 3 and/or active node 4 -> active node 5 -> Active node 6, if the re-executed active node 6 has no feedback data, then execute active node 7 in sequence; if the data content determined by active node 2 is the same as the previously set data content, active node 2 directly sends confirmation to active node 6 data, and inform the active node 6 that the previous data content will not be modified and will not be iterated.

It should be noted that if the current execution activity node generates feedback data, and the target activity node corresponding to the feedback data and the current execution activity node are not in the same activity node area, the activity nodes in the area where the target activity node is located are set to the execution state; If the target active node corresponding to the feedback data and the current executing active node are in the same active node area, that is, the target active node is also in the executing state, and the state setting of the active node is not required at this time.

For example, to design a combat department (target activity node) on a tank, the combat department requires the power to reach X; according to the overall design of the process, a technical requirement will be given, the weight does not exceed Y, the size does not exceed Z; the machine gun department press this Requested the design and found that the size could not meet the power requirements, so gave the overall feedback, requiring the size to be increased and the weight to be increased; after receiving the feedback, the War Department found that it was indeed the case, and redesigned the size and weight (it is likely to reduce the size of other parts in this process. size and weight).

An embodiment of the present application provides an iterative method for process activity nodes. First, the corresponding positions of the activity nodes and the logical nodes in the target business process are obtained, and then according to the positions of the logical nodes, the activity nodes are divided into multiple activity node areas. The position of the current execution activity node in the process, determine the current execution activity node area, when the current execution activity node generates feedback data, obtain the target activity node corresponding to the feedback data, and convert all activities in the activity node area corresponding to the target activity node The node is set to the execution state; the target activity node determines the data content according to the feedback data, and transmits the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process to continue execution. When there is feedback data relative to the existing downstream active node, the process mode needs to be restarted. According to the execution process of the process, when the current executing active node generates feedback data to the target active node, the active node area corresponding to the target active node is stored. All the active nodes of the node are set to the execution state, so that the application does not need to restart the entire process when it is determined that feedback data occurs, and only needs to reset the corresponding active node area to the execution state. The execution requirements of active nodes improve the iterative efficiency of the process.

Referring to FIG. 2, an iterative method for process activity nodes provided by an embodiment of the present invention, after step S103, the method may further include:

Step S104, when the current execution activity node has no feedback data, according to the execution state of the activity node in the current execution activity node area and the content information of the end logical node, and the position identification information of the currently executed activity node area, determine the next activity. Node area.

In an optional embodiment provided by this application, the execution state of the active node in the currently executing active node area and the logic information of the last logical node, and the location identification information of the currently executing active node area , to determine the next active node area, including:

1041. If the logical information is an AND relationship, after determining that the execution of all active nodes in the currently executing active node area is completed, determine the next active node area according to the location identification information of the currently executing active node area.

As shown in the schematic diagram of the target business process shown in Figure 2a, if the logical node in the figure is AND, and the location identification information of the currently executed active node area is 1, then the active node 1-active node 4 in the currently executed active node area is determined. After all executions are completed, it is determined that the location identification information of the next active node area is 2.

1042. If the logical information is an OR relationship, after determining that any node in the multiple parallel active nodes in the active node area currently executing is completed, determine the next active node according to the location identification information of the active node area currently executing. area.

As shown in the schematic diagram of the target business process as shown in Figure 2a, if the logical node in the figure is OR, and the location identification information of the currently executed active node area is 1, then the active node 1 and the active node in the currently executed active node area will be determined. 2. After the execution of the active node 3 is 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 nodes in the currently executing active node area satisfy the preset judgment content, determine the next active node area according to the location identification information of the currently executing active node area.

As shown in the schematic diagram of the target business process as shown in Figure 2a, if the judgment content corresponding to the logical node is that the results obtained by the active node 3 and the active node 4 are the same, then the active node 1 to the active node 4 are all executed in the area of the active node that is currently executed. After completion, and when 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, setting the active node in the next active node area to the execution state.

The present application provides an iterative method for process activity nodes. First, the corresponding positions of the activity nodes and the logic nodes in the target business process are obtained, and then the activity nodes are divided into a plurality of activity node areas according to the positions of the logic nodes. Each activity node area There is corresponding location identification information, and each active node area includes at least one active node. According to the position of the currently executing active node in the target business process, the currently executing active node area is determined. When the current executing active node has no feedback data, according to The execution status of the active node in the currently executed active node area and the content information of the last logical node, as well as the location identification information of the currently executed active node area, determine the next active node area; set the active node in the next active node area is the execution state. Compared with the existing overall process startup and step-by-step process driving methods, the present application sets the active nodes in the active node area to the execution state in a targeted manner according to the execution process of the process. It can also meet the execution requirements of the active nodes in the parallel iterative process.

Referring to FIG. 3, another method for iterative process activity nodes provided by an embodiment of the present invention specifically includes steps S301-S306:

Step S301, determining whether the target business process corresponds to a parent node.

The parent node of the target business process is the upper-level node of the target business process. Specifically, in this embodiment, whether there is a parent node can be determined through the node level identifier. If the node level identifier corresponding to the target business process corresponds to 1, it means that the target The business process corresponds to a parent node, and the corresponding parent node is 1. For example, the target business process includes an active node 11 , an active node 12 and an active node 13 , and the parent node corresponding to the target business process is an active node 1 .

Step S302, if not, obtain the positions corresponding to the active node and the logical node respectively in the target business process.

In this embodiment, if the target business process has no corresponding parent node, it is directly obtained whether the target business process has a corresponding parent node.

Step S302B, if yes, obtain the state information of the parent node, and determine whether the state information is the execution state.

Among them, step S302 and step S302B are parallel steps. If the target business process has a corresponding parent node, the state information of the parent node is obtained, and the state information is used to indicate the state of the parent node, including the execution state and the waiting state. and edit status.

In this embodiment, after acquiring the state information of the parent node, it is determined whether the state information is in the execution state, and if it is in the execution state, then jumps to step S302 to continue the execution.

Step S302, if yes, obtain the positions corresponding to the active node and the logical node respectively in the target business process.

Further, if the state information of the parent node is the waiting state, the waiting state of all nodes in the target business process is maintained. If the state information of the parent node is in the editing state, it is determined that the target business process cannot be driven.

Step S303: Divide the active node into a plurality of active node areas according to the position of the logical node.

Wherein, each active node area corresponds to location identification information, and each active node area includes at least one active node.

Step S304 , according to the position of the currently executing active node in the target business process, determine the area of the currently executing active node.

The nodes other than the active nodes in the currently executing active node area are all in a waiting state.

Further, since there will 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 will be restarted, this embodiment is based on the target business process. After the position of the execution active node is determined, and the currently executed active node area is determined, the method further includes: determining whether the active nodes in the currently executed active node area are all set to the execution state; The active node that does not have an execution state set in the active node area of is set to the execution state.

Step S305, when the current execution activity node does not have feedback data, according to the execution state of the activity node in the current execution activity node area and the content information of the end logical node, and the position identification information of the currently executed activity node area, determine the next activity. Node area.

Step S306, setting the active node in the next active node area to the execution state.

It should be noted that, steps S302 to S306 in this embodiment are the same as the descriptions of the corresponding steps in FIG. 2 , and are not described again in this embodiment.

The present application provides an iterative method for process activity nodes. According to whether there is a corresponding parent node in the target business process, as well as the status information of the parent node and the execution process of the target business process, the present application performs a targeted line of operations in the area of the active node. The active node is set to the execution state, so that the present application can satisfy both the active node in the targeted execution process and the execution requirements of the active node in the parallel iterative process.

It should be understood that the size of the sequence numbers of the steps in the above embodiments does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

In one embodiment, an apparatus for iterating process activity nodes is provided, and the apparatus for iterating process activity nodes corresponds one-to-one with the method for iterating process activity nodes in the foregoing embodiment. As shown in Figure 4, the detailed description of each functional module of the process activity node iteration device is as follows:

The obtaining module 41 is used to obtain the positions corresponding to the active nodes and the logical nodes respectively in the target business process;

The division module 42 is configured to divide the active node into a plurality of active node areas according to the position of the logical node, each active node area corresponds to location identification information, and each active node area includes at least one active node area. active node;

The determination module 43 is used to determine the currently executed active node area according to the position of the currently executed active node in the target business process; wherein, the nodes after the active node in the currently executed active node area are all waiting states ;

The acquiring module 41 is further configured to acquire the target active node corresponding to the feedback data when the current execution active node generates feedback data; the target active node is the upstream active node of the current execution active node;

A setting module 44 is used to set all active nodes in the active node area corresponding to the target active node to the execution state;

The iterative module 45 is used for the target activity node to determine data content according to the feedback data, and to transmit the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process for continued execution.

In an optional embodiment, the determining module 43 is further configured to, when the currently executing active node has no feedback data, according to the execution state of the active node in the currently executing active node area and the content information of the last logical node, And the position identification information of the active node area of the described current execution, determine the next active node area;

The setting module 44 is further configured to set the active node in the next active node area to the execution state.

In an optional embodiment, the determining module 43 is further configured to determine whether the target business process corresponds to a parent node;

The obtaining module 41 is specifically configured to obtain the corresponding positions of the active node and the logical node in the target business process if the target business process has no parent node.

In an optional embodiment, the obtaining module 41 is specifically used for:

If the target business process corresponds to a parent node, obtain the status information of the parent node;

If the state information of the parent node is the execution state, obtain the respective positions of the active node and the logical node in the target business process;

If the state information of the parent node is a waiting state, the waiting state of all nodes in the target business process is maintained.

In an optional embodiment, the dividing module 42 is specifically used for:

All active nodes before the first logical node are determined as nodes in the first active node area, and the location identification information of the first active node area is 1;

Determine all active nodes between the Nth logical node to the N+1th logical node as the N+1th active node area; the location identification information of the Nth active node area is N; the N is greater than or equal to 1 ;

All active nodes after the last logical node are determined as nodes in the Mth active node area, the location identification information of the Mth active node area is M, and the M is greater than the N+1.

In an optional embodiment, the determining module 43 is specifically configured to:

If the logical information is an AND relationship, after determining that the execution of all active nodes in the currently executing active node area is completed, the next active node area is determined according to the location identification information of the currently executing active node area;

If the logical information is an OR relationship, after it is determined that any one of the multiple parallel active nodes in the currently executing active node area is executed, determine, according to the location identification information of the currently executing active node area, next active node area;

If the logical information is the preset judgment content, after determining that the active nodes in the currently executing active node area satisfy the preset judgment content, determine according to the location identification information of the currently executing active node area The next active node area.

In an optional embodiment, the determining module 43 is specifically configured to determine whether the active nodes in the currently executing active node area are all set to the execution state; if not, set the currently executing active node area An active node that does not have an execution state set within it is set to the execution state.

For the specific definition of the apparatus for iterating the process activity node, reference may be made to the above definition of the method for iterating the process activity node, which will not be repeated here. Each module in the above device can be implemented in whole or in part by software, hardware and combinations thereof. The above modules can be embedded in or independent of the processor in the computer device in the form of hardware, or stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

In one embodiment, a computer device is provided, and the computer device may be a server, and its internal structure diagram may be as shown in FIG. 5 . The computer device includes a processor, memory, a network interface, and a database connected by a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium, an internal memory. The nonvolatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the execution of the operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. The computer program when executed by a processor implements a process activity node iteration method.

In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and running on the processor, and the processor implements the following steps when executing the computer program:

Obtain the corresponding positions of the active node and the logical node in the target business process;

According to the position of the logical node, the active node is divided into a plurality of active node areas, each active node area corresponds to location identification information, and each active node area includes at least one active node;

According to the position of the current execution active node in the target business process, determine the currently executed active node area; wherein, the node after the active node in the currently executed active node area is in a waiting state;

When the current execution activity node generates feedback data, obtain the target activity node corresponding to the feedback data; the target activity node is the upstream activity node of the current execution activity node;

Setting all active nodes in the active node area corresponding to the target active node to the execution state;

The target activity node determines data content according to the feedback data, and transmits the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process to continue execution.

In one embodiment, a computer-readable storage medium is provided on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

Obtain the corresponding positions of the active node and the logical node in the target business process;

According to the position of the logical node, the active node is divided into a plurality of active node areas, each active node area corresponds to location identification information, and each active node area includes at least one active node;

According to the position of the current execution active node in the target business process, determine the currently executed active node area; wherein, the node after the active node in the currently executed active node area is in a waiting state;

When the current execution activity node generates feedback data, obtain the target activity node corresponding to the feedback data; the target activity node is the upstream activity node of the current execution activity node;

Setting all active nodes in the active node area corresponding to the target active node to the execution state;

The target activity node determines data content according to the feedback data, and transmits the data content to the downstream activity node of the target activity node according to the flow sequence of the target business process to continue execution.

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be implemented by instructing relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage In the medium, when the computer program is executed, it may include the processes of the above-mentioned method embodiments. Wherein, any reference to memory, storage, database or other medium used in the various embodiments provided in this application may include non-volatile and/or volatile memory. Nonvolatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous chain Road (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

Those skilled in the art can clearly understand that, for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example. Module completion, that is, dividing the internal structure of the device into different functional units or modules to complete all or part of the functions described above.

The above embodiments are only used to illustrate the technical solutions of the present invention, but not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: The recorded technical solutions are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should be included in the present invention. within the scope of protection.

Claims (10)

1. A method for process activity node iteration, 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 the 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 in a waiting state;

when the current execution active node generates feedback data, acquiring a target active node corresponding to the feedback data; the target active node is an upstream active node of the currently executing active node;

setting all active nodes in an active node area corresponding to the target active node as an execution state;

and the target activity node determines data content according to the feedback data and transmits the data content to a downstream activity node of the target activity node to continue execution according to the flow sequence of the target business flow.

2. The method of claim 1, further comprising:

when the currently executed active node has no feedback data, 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.

3. 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.

4. The method of claim 3, 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.

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. An apparatus for process activity node iteration, 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 obtaining module is further configured to obtain a target active node corresponding to feedback data when the currently executing active node generates the feedback data; the target active node is an upstream active node of the currently executing active node;

a setting module, configured to set all active nodes in an active node area corresponding to the target active node to an execution state;

and the iteration module is used for determining the data content by the target activity node according to the feedback data and transmitting the data content to a downstream activity node of the target activity node to continue execution according to the flow sequence of the target business flow.

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 when executing the computer program implements the process activity node iteration method of any of claims 1-7.

10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, implements the process activity node iteration method according to any one of claims 1 to 7.

Images