CN113986508B - Business flow network decomposition method, system, equipment and medium based on PN machine model - Google Patents

Abstract

The invention provides a service flow network decomposition method, a system, equipment and a medium based on PN machine model, wherein the decomposition method comprises the following steps: constructing a PN model of a service flow network, and placing all transitions in the PN model into a transition set of an undegraded subnet; the transition is a data processing state of a PN model; each transition is provided with a subscript indicating the layer number and the pass number in each layer; and selecting transition with minimum subscript from the transition set of the undegraded sub-network as initial transition, taking the transition of the transition set of the undegraded sub-network as current transition, and searching correlation between the front and the rear of the current transition by synchronously processing the front and the rear of the current transition so as to construct a concurrent execution service sub-network. The invention can decompose a complex large service processing network into a plurality of simple service subnets which can be executed concurrently, and reduces the coupling between the service processing subnets while improving the concurrency capacity to the maximum extent.

Description

Business flow network decomposition method, system, equipment and medium based on PN machine model

Technical Field

The present invention belongs to the technical field of interconnected business processing, and relates to a decomposition method and system, and in particular to a business flow network decomposition method, system, equipment and medium based on a PN machine model.

Background technique

Information technology is an important driving force for economic and social development in the world today. It has promoted the transformation and optimization and upgrading of the global industrial structure and brought about profound changes in human production and lifestyle. The rapid development of new technologies such as communications and networks has greatly expanded the development space of the information service industry and also brought new challenges. On the one hand, as the business becomes more and more complex, the highly coupled business processing system is becoming more and more difficult to expand and maintain. It is necessary to decompose the business flow network to reduce the coupling of the system. On the other hand, since the interconnected business is difficult to predict and has short-term burst characteristics, this puts high demands on the processing speed of the business system. Therefore, it is necessary to deeply explore the concurrency in the business processing system and improve the concurrency of business processing by decomposing the business flow network to improve the processing speed of the system. However, the decomposition of the business flow network is a complexity internalization problem. At present, the decomposition method based on experience is adopted in engineering. The effectiveness of the decomposition depends largely on the experience of developers, and the effect is difficult to guarantee.

Therefore, how to provide a business flow network decomposition method, system, equipment and medium based on the PN machine model to solve the defects of the existing technology that the effectiveness of decomposition depends largely on the experience of developers and the effect is difficult to guarantee has become a technical problem that needs to be urgently solved by technical people in this field.

Summary of the invention

In view of the above-mentioned shortcomings of the prior art, the purpose of the present invention is to provide a business flow network decomposition method, system, device and medium based on the PN machine model, which is used to solve the problem that the effectiveness of the decomposition of the prior art depends largely on the experience of the developers and the effect is difficult to guarantee.

To achieve the above-mentioned purpose and other related purposes, the present invention provides a business flow network decomposition method based on a PN machine model, including: constructing a PN model of a business flow network, and placing all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a traversal number within each layer; selecting the transition with the smallest subscript from the transition set of the undecomposed subnet as the initial transition, and taking the transition of the transition set of the undecomposed subnet as the current transition, by synchronously processing the predecessor and successor of the current transition, finding the correlation between the predecessor and successor of the current transition, so as to construct a concurrently executed business subnet.

In one embodiment of the present invention, the step of synchronously processing the predecessor and successor of the current transition, finding the correlation between the predecessor and successor of the current transition, and constructing a concurrently executed business subnet includes: determining whether the number of states of the predecessor and successor of the current transition are equal and one-to-one corresponding; if so, merging the current transition and its predecessor and successor into the current business subnet allocated for the current transition; if not, continuing to determine whether the number of predecessors and successors of the current transition is the same; if so, proceeding to the step of merging the current transition and its predecessor and successor into the current business subnet allocated for the current transition; if not, continuing to determine whether the number of predecessors of the current transition is greater than the number of successors; if so, processing the number of successors of the current transition and constructing an unallocated business subnet; if not, processing the number of predecessors of the current transition and constructing an unallocated business subnet.

In one embodiment of the present invention, the step of processing the number of successors of the current transition includes: increasing the virtual number of successors of the current transition so that the number of successors of the current transition is consistent with the number of predecessors.

In one embodiment of the present invention, the step of constructing an unallocated business subnet includes: splitting the current transition, assigning a pair of prefix and postfix to each of the split transitions, and placing the transitions whose layer number subscripts of the split transitions are consistent with the layer number subscripts of the current transitions into the unallocated business subnet; the number of splits of the current transition is the same as the number of added postfixes of the current transition.

In one embodiment of the present invention, the step of processing the number of predecessors of the current transition includes: increasing the virtual number of predecessors of the current transition so that the number of predecessors and the number of successors of the current transition are consistent.

In one embodiment of the present invention, the step of constructing an unallocated business subnet also includes: splitting the current transition, assigning a pair of prefix and postfix to each of the split transitions, and placing the transitions whose layer number subscripts of the split transitions are consistent with the layer number subscripts of the current transitions into the unallocated business subnet; the number of splits of the current transition is the same as the number of added prefixes of the current transition.

In one embodiment of the present invention, after the current transition and its predecessor and successor are incorporated into the step of allocating the current business subnet for the current transition, the business flow network decomposition method based on the PN machine model also includes: determining whether the current business subnet has been traversed to completion; if so, continuing to determine whether the transition set of the undecomposed subnet has been allocated a business subnet; if so, terminating the business flow network decomposition; if not, returning to the step of selecting the transition with the smallest subscript from the transition set of the undecomposed subnet as the initial transition, and using the transition of the transition set of the undecomposed subnet as the current transition; if the traversal has not been completed, using the subsequent transition of the current transition as the current transition, and entering the step of synchronously processing the predecessor and successor of the current transition, finding the correlation between the predecessor and successor of the current transition, so as to construct a business subnet for concurrent execution.

On the other hand, the present invention provides a business flow network decomposition system based on a PN machine model, including: a preprocessing module, used to construct a PN model of a business flow network, and place all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript representing a layer number and a traversal number within each layer; a decomposition module, used to select the transition with the smallest subscript from the transition set of the undecomposed subnet as the initial transition, and use the transition of the transition set of the undecomposed subnet as the current transition, by synchronously processing the predecessor and successor of the current transition, finding the correlation between the predecessor and successor of the current transition, so as to construct a concurrently executed business subnet.

Another aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the service flow network decomposition method based on the PN machine model.

The last aspect of the present invention provides a business flow network decomposition device based on the PN machine model, including: a processor and a memory; the memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that the device executes the business flow network decomposition method based on the PN machine model.

As described above, the service flow network decomposition method, system, device and medium based on the PN machine model of the present invention have the following beneficial effects:

First, by constructing a PN machine model of a network concurrent system through the present invention, the behavior correlation relationship in the concurrent system is fully explored.

Secondly, the polynomial algorithm for determining the legal transmission sequence of the flow network synchronization of the present invention solves the high algorithm complexity (NP-complete problem) of determining the transmission sequence of general networks.

Thirdly, the present invention outputs indivisible meta-level subnets, thereby achieving concurrent decoupling of complex business flows and improving the concurrency of the business system.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is a diagram showing an example of a PN model applied in the present invention.

FIG. 1B is a diagram showing an example of a service subnet decomposed from a PN model according to the present invention.

FIG. 2 is a schematic flow chart showing a method for decomposing a business flow network based on a PN machine model in one embodiment of the present invention.

FIG. 3 is a flow chart showing S22 in an embodiment of the service flow network decomposition method based on the PN machine model of the present invention.

FIG. 4 is a diagram showing an implementation example of S225 of the present invention.

FIG. 5 is a schematic diagram showing the principle structure of a service flow network decomposition system based on a PN machine model in one embodiment of the present invention.

Component number description

5 Business flow network decomposition system based on PN machine model

51 Preprocessing module

52 Decomposition Module

Steps S21 to S22

Steps S221 to S229

Detailed ways

The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the following embodiments and features in the embodiments can be combined with each other without conflict.

It should be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present invention, and thus the drawings only show components related to the present invention rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.

The technical principles of the business flow network decomposition method, system, device and medium based on the PN machine model of the present invention are as follows:

By using the semantic relationship between services, a PN machine model of the service flow network is constructed. The service flow network is decomposed through a polynomial algorithm for determining the legal transmission sequence of the PN machine's flow network synchronization, so that the decomposed service processing network can have the maximum concurrency capability.

Embodiment 1

This embodiment provides a service flow network decomposition method based on a PN machine model, including:

A PN model of a service flow network is constructed, and all transitions in the PN model are placed in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript indicating a layer number and a traversal number within each layer;

The transition with the smallest index is selected from the transition set of the undecomposed subnet as the initial transition, and the transition of the transition set of the undecomposed subnet is used as the current transition. The predecessor and successor of the current transition are synchronously processed to find the correlation between the predecessor and successor of the current transition, so as to construct a concurrently executed business subnet.

The following will describe in detail the service flow network decomposition method based on the PN machine model provided by this embodiment in conjunction with the diagram. The service flow network decomposition method based on the PN machine model described in this embodiment is used to synchronously decompose the service flow network based on the PN machine model as shown in FIG1A to obtain multiple service subnets as shown in FIG1B. The decomposition method is the following decomposition steps (S21-S29)

Please refer to Figure 2, which is a flow chart of a method for decomposing a business flow network based on a PN machine model in one embodiment. As shown in Figure 2, the method for decomposing a business flow network based on a PN machine model specifically includes the following steps:

S21, construct a PN model of a business flow network, select the input transition of the PN model as T ₀₀ , take it as the initial transition, perform breadth-first traversal of the entire PN model, and place all transitions in the PN model in the transition set of the undecomposed subnet; the transition is the data processing state of the PN model; each transition is set with a subscript representing the layer number and the traversal number within each layer.

In this embodiment, the semantic relationship between services is utilized to construct the PN model by referring to PN system modeling, concurrent program modeling and other methods.

S22, select the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, use the transition of the transition set of the undecomposed subnet as the current transition, synchronously process the predecessor and successor of the current transition, find the correlation between the predecessor and successor of the current transition, so as to build a concurrently executed business subnet.

Please refer to FIG3 , which is a schematic diagram of the process of S22 in one embodiment. As shown in FIG3 , S22 specifically includes the following steps:

S221, determine whether the number of states before and after the current transition is equal (that is, whether the number of input connections and the number of output connections of the current node in the PN graph are equal). If so, execute S222, if not, execute S223.

S222, when the states of the preceding and following states of the current transition are not equal and do not correspond one to one, continue to determine whether the states of the preceding and following states of the current transition are the same, if so, execute S225; if not, execute S223. In this embodiment, since the service subnet can be split into several completely independent networks only if the transitions are consistent, it is necessary to further determine whether the state of the preceding and following states of the current transition is greater than the state of the following states.

S223, when the number of predecessors and successors of the current transition is not equal, continue to determine whether the number of predecessors of the current transition is greater than the number of successors; if so, execute S224. If not, execute S225.

S224: When the number of predecessors of the current transition is greater than the number of successors, process the number of successors of the current transition and construct an unallocated service subnet.

In this embodiment, the S224 includes:

Increase the virtual number of the post-transition of the current transition so that the number of the post-transition of the current transition is consistent with the number of the pre-transition.

In this embodiment, after increasing the number of virtual post-transitions of the current transition, the steps of constructing an unallocated service subnet include:

The current transition is split, and a pair of prefix and postfix is assigned to each of the split transitions. The transitions whose layer number subscripts after the split are consistent with the layer number subscripts of the current transition are placed in the unallocated business subnet. The number of splits of the current transition is the same as the number of postfixes added to the current transition. For example, if k postfixes are virtually added, the current transition is split into k transitions.

S225, when the number of preceding transitions of the current transition is less than the number of following transitions, the number of preceding transitions of the current transition is processed, and an unallocated service subnet is constructed.

In this embodiment, the S225 includes:

Increase the virtual number of the predecessors of the current transition so that the number of predecessors and successors of the current transition is consistent.

Please refer to Figure 4, which shows an implementation example of S225. As shown in Figure 4, the pre-transition quantity of the current transition is 1, which is less than the post-transition quantity 2, so the pre-transition of the current transition needs to increase the virtual quantity 1 to make it consistent with the post-transition quantity.

In this embodiment, after increasing the number of virtual pre-positions of the current transition, the step of constructing an unallocated service subnet includes:

Split the current transition, assign a pair of prefix and suffix to each of the split transitions, and put the transitions whose layer number subscripts after the split transitions are consistent with the layer number subscripts of the current transitions into the unallocated business subnet; the number of splits of the current transition is the same as the number of additions to the prefix of the current transition.

S226: merge the current transition and its predecessor and successor into the current service subnet allocated for the current transition, and the current service subnet is recorded as SubPN _t .

S227, determine whether the current service subnet has been traversed, if the traversal is completed, execute S228. If the traversal is not completed, execute S230.

S228, determine whether the transition set of the undecomposed subnet has been allocated a business subnet; if so, end the business flow network decomposition; if not, return to S21, that is, return to the step of selecting the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, and using the transition of the transition set of the undecomposed subnet as the current transition.

S229, if the traversal is not completed, the subsequent transition of the current transition is taken as the current transition, and the step of synchronously processing the predecessor and successor of the current transition, finding the correlation between the predecessor and successor of the current transition, and building a concurrently executed business subnet is entered, that is, returning to S221.

The service flow network decomposition method based on the PN machine model described in this embodiment has the following beneficial effects:

First, by constructing a PN machine model of a network concurrent system, the behavioral correlation relationships in the concurrent system are fully explored.

Secondly, the high algorithmic complexity (NP-complete problem) of determining the emission sequence of general networks is solved through the polynomial algorithm for determining the legal emission sequence of flow network synchronization.

Third, this method outputs indivisible meta-level subnets, thereby achieving concurrent decoupling of complex business flows and improving the concurrency of the business system.

This embodiment further provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the method shown in FIG. 2 is implemented.

At any possible level of technical detail combination, the present application may be a system, method and/or computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for causing a processor to implement various aspects of the present application.

Computer readable storage medium can be a tangible device that can hold and store instructions used by an instruction execution device. Computer readable storage medium can be, for example, (but not limited to) an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination thereof. More specific examples (non-exhaustive list) of computer readable storage medium include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, for example, a punch card or a convex structure in a groove on which instructions are stored, and any suitable combination thereof. The computer readable storage medium used here is not interpreted as a transient signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated by a waveguide or other transmission medium (for example, a light pulse by an optical fiber cable), or an electrical signal transmitted by a wire.

The computer-readable program described herein can be downloaded from a computer-readable storage medium to each computing/processing device, or downloaded to an external computer or external storage device through a network, such as the Internet, a local area network, a wide area network, and/or a wireless network. The network can include copper transmission cables, optical fiber transmission, wireless transmission, routers, firewalls, switches, gateway computers, and/or edge servers. The network adapter card or network interface in each computing/processing device receives a computer-readable program instruction from the network, and forwards the computer-readable program instruction for storage in a computer-readable storage medium in each computing/processing device. The computer program instruction for performing the operation of this application can be an assembly instruction, an instruction set architecture (ISA) instruction, a machine instruction, a machine-related instruction, a microcode, a firmware instruction, a state setting data, an integrated circuit configuration data, or a source code or object code written in any combination of one or more programming languages, wherein the programming language includes an object-oriented programming language, such as Smalltalk, C++, etc., and a procedural programming language, such as "C" language or similar programming language. Computer readable program instructions can be executed completely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer, partially on a remote computer, or completely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., using an Internet service provider to connect through the Internet). In certain embodiments, by using the state information of computer readable program instructions to customize electronic circuits, such as programmable logic circuits, field programmable gate arrays (FPGAs) or programmable logic arrays (PLAs), the electronic circuits can execute computer readable program instructions, thereby realizing various aspects of the present application.

Embodiment 2

This embodiment provides a service flow network decomposition system based on a PN machine model, including:

A preprocessing module is used to construct a PN model of a service flow network and place all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript indicating a layer number and a traversal number within each layer;

The decomposition module is used to select the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, use the transition of the transition set of the undecomposed subnet as the current transition, synchronously process the predecessor and successor of the current transition, find the correlation between the predecessor and successor of the current transition, so as to build a business subnet for concurrent execution.

The following will describe in detail the business flow network decomposition system based on the PN machine model provided by this embodiment in conjunction with the diagram. Please refer to FIG5, which is a schematic diagram of the principle structure of the business flow network decomposition system based on the PN machine model in one embodiment. As shown in FIG5, the business flow network decomposition system based on the PN machine model 5 includes a preprocessing module 51 and a decomposition module 52.

The preprocessing module 51 is used to construct a PN model of a business flow network, select the input transition of the PN model as T ₀₀ , use it as the initial transition, perform breadth-first traversal of the entire PN model, and place all transitions in the PN model in the transition set of the undecomposed subnet; the transition is the data processing state of the PN model; each transition is provided with a subscript representing the layer number and the traversal number within each layer.

In this embodiment, the pre-processing module 51 utilizes the semantic relationship between services to construct the PN model by referring to PN system modeling, concurrent program modeling and other methods.

The decomposition module 52 selects the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, takes the transition of the transition set of the undecomposed subnet as the current transition, and synchronously processes the predecessor and successor of the current transition to find the correlation between the predecessor and successor of the current transition to construct a concurrently executed business subnet.

Specifically, the decomposition module 52 determines whether the number of states of the predecessor and the successor of the current transition is equal and one-to-one corresponding; if so, the current transition and its predecessor and successor are merged into the current business subnet allocated to the current transition; if not, continue to determine whether the number of predecessors and successors of the current transition is the same; if so, merge the current transition and its predecessor and successor into the step of allocating the current business subnet to the current transition; if not, continue to determine whether the number of predecessors of the current transition is greater than the number of successors; if so, process the number of successors of the current transition and construct an unallocated business subnet; if not, process the number of predecessors of the current transition and construct an unallocated business subnet.

In this embodiment, the decomposition module 52 increases the virtual number of the postpositions of the current transition so that the number of the postpositions of the current transition is consistent with the number of the prepositions, splits the current transition, allocates a pair of prepositions and postpositions to each of the split transitions, and puts the transitions whose layer number subscripts of the split transitions are consistent with the layer number subscripts of the current transitions into unallocated service subnets; the number of splits of the current transition is the same as the number of increases of the postpositions of the current transition to process the number of the postpositions of the current transition, and constructs an unallocated service subnet to process the number of the postpositions of the current transition, and constructs an unallocated service subnet

In this embodiment, the decomposition module 52 increases the virtual number of the predecessors of the current transition to make the number of predecessors of the current transition consistent with the number of successors, splits the current transition, assigns a pair of predecessors and successors to each of the split transitions, and puts the transitions whose layer number subscripts after the split are consistent with the layer number subscripts of the current transition into an unallocated business subnet; the number of splits of the current transition is the same as the number of increases in the predecessors of the current transition to process the number of predecessors of the current transition and construct an unallocated business subnet.

When the decomposition module 52 splits the current transition, a pair of preamble and postamble is allocated to each of the split transitions, and the transitions whose layer number subscripts of the split transitions are consistent with the layer number subscripts of the current transition are placed in an unallocated service subnet, the current transition and its preamble and postamble are merged into the current service subnet allocated for the current transition, and the current service subnet is recorded as SubPN _t .

The decomposition module 52 is also used to determine whether the current business subnet has been traversed to completion. If the traversal is completed, it is determined whether the transition set of the undecomposed subnet has been assigned to the business subnet; if so, the business flow network decomposition is terminated; if not, the preprocessing module 51 is called to select the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, and the transition of the transition set of the undecomposed subnet is used as the step of the current transition. If the traversal is not completed, the subsequent transition of the current transition is used as the current transition, and the predecessor and successor of the current transition are continuously processed synchronously to find the correlation between the predecessor and successor of the current transition, so as to construct a concurrently executed business subnet.

It should be noted that it should be understood that the division of the various modules of the above system is only a division of logical functions. In actual implementation, they can be fully or partially integrated into one physical entity, or they can be physically separated. And these modules can all be implemented in the form of software called by processing elements, or they can all be implemented in the form of hardware, or some modules can be implemented in the form of software called by processing elements, and some modules can be implemented in the form of hardware. For example: the x module can be a separately established processing element, or it can be integrated in a certain chip of the above system. In addition, the x module can also be stored in the memory of the above system in the form of program code, and called and executed by a certain processing element of the above system. The implementation of other modules is similar. These modules can be fully or partially integrated together, or they can be implemented independently. The processing element described here can be an integrated circuit with signal processing capabilities. In the implementation process, each step of the above method or each module above can be completed by an integrated logic circuit of hardware in the processor element or instructions in the form of software. The above modules may be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASIC), one or more digital singnal processors (DSP), one or more field programmable gate arrays (FPGA), etc. When a module is implemented in the form of a processing element scheduling program code, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processor that can call program code. These modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

Embodiment 3

The present embodiment provides a business flow network decomposition device based on a PN machine model, comprising: a processor, a memory, a transceiver, a communication interface and/or a system bus; the memory and the communication interface are connected to the processor and the transceiver through the system bus and complete mutual communication, the memory is used to store computer programs, the communication interface is used to communicate with other devices, the processor and the transceiver are used to run computer programs, so that the business flow network decomposition device based on the PN machine model executes the various steps of the business flow network decomposition method based on the PN machine model as described in Example 1.

The system bus mentioned above can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The system bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus. The communication interface is used to realize the communication between the database access device and other devices (such as clients, read-write libraries, and read-only libraries). The memory may include random access memory (RAM), and may also include non-volatile memory, such as at least one disk storage.

The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

The protection scope of the business flow network decomposition method based on the PN machine model described in the present invention is not limited to the execution order of the steps listed in this embodiment. All solutions implemented by adding, reducing or replacing steps in the prior art based on the principles of the present invention are included in the protection scope of the present invention.

The present invention also provides a business flow network decomposition system based on a PN machine model, and the business flow network decomposition system based on a PN machine model can implement the business flow network decomposition method based on a PN machine model described in the present invention, but the implementation device of the business flow network decomposition method based on a PN machine model described in the present invention includes but is not limited to the structure of the business flow network decomposition system based on a PN machine model listed in this embodiment. All structural deformations and replacements of the prior art made according to the principles of the present invention are included in the protection scope of the present invention.

In summary, the service flow network decomposition method, system, device and medium based on the PN machine model of the present invention have the following beneficial effects:

First, by constructing a PN machine model of a network concurrent system through the present invention, the behavior correlation relationship in the concurrent system is fully explored.

Secondly, the polynomial algorithm for determining the legal transmission sequence of the flow network synchronization of the present invention solves the high algorithm complexity (NP-complete problem) of determining the transmission sequence of general networks.

Third, the present invention outputs indivisible meta-level subnets, thereby achieving concurrent decoupling of complex business flows and improving the concurrency of business systems. The present invention effectively overcomes various shortcomings in the prior art and has high industrial utilization value.

The above embodiments are merely illustrative of the principles and effects of the present invention, and are not intended to limit the present invention. Anyone familiar with the art may modify or alter the above embodiments without departing from the spirit and scope of the present invention. Therefore, all equivalent modifications or alterations made by a person of ordinary skill in the art without departing from the spirit and technical ideas disclosed by the present invention shall still be covered by the claims of the present invention.

Claims (9)

1. A business flow network decomposition method based on a PN machine model, characterized by comprising: Construct a PN model of a service flow network, and place all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript indicating a layer number and a number within each layer; Select the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, use the transition of the transition set of the undecomposed subnet as the current transition, synchronously process the predecessor and successor of the current transition, find the correlation between the predecessor and successor of the current transition, so as to construct a concurrently executed business subnet; wherein, The step of synchronously processing the predecessor and successor of the current transition and finding the correlation between the predecessor and successor of the current transition to construct a concurrently executed service subnet includes: Determine whether the number of states of the predecessor and successor of the current transition is equal and one-to-one corresponding; if so, merge the current transition and its predecessor and successor into the current business subnet allocated for the current transition; if not, continue to determine whether the number of predecessors and successors of the current transition is the same; if so, proceed to the step of merging the current transition and its predecessor and successor into the current business subnet allocated for the current transition; if not, continue to determine whether the number of predecessors of the current transition is greater than the number of successors; if so, process the number of successors of the current transition and construct an unallocated business subnet; if not, process the number of predecessors of the current transition and construct an unallocated business subnet. 2. The method for decomposing a business flow network based on a PN machine model according to claim 1, wherein the step of processing the number of post-transitions of the current transition comprises: Increase the virtual number of the post-transition of the current transition so that the number of the post-transition of the current transition is consistent with the number of the pre-transition. 3. According to the PN machine model-based service flow network decomposition method described in claim 2, it is characterized in that the step of constructing an unallocated service subnet includes: splitting the current transition, assigning a pair of prefix and postfix to each of the split transitions, and placing the transitions whose layer number subscripts of the split transitions are consistent with the layer number subscripts of the current transitions into the unallocated service subnet; the number of splits of the current transition is the same as the number of added postfixes of the current transition. 4. The method for decomposing a business flow network based on a PN machine model according to claim 1, wherein the step of processing the number of predecessors of the current transition comprises: Increase the virtual number of the predecessors of the current transition so that the number of predecessors and successors of the current transition is consistent. 5. According to the PN machine model-based service flow network decomposition method of claim 4, it is characterized in that the step of constructing an unallocated service subnet also includes: splitting the current transition, assigning a pair of prefix and postfix to each of the split transitions, and placing the transitions whose layer number subscripts after the split are consistent with the layer number subscripts of the current transitions into the unallocated service subnet; the number of splits of the current transition is the same as the number of increases in the prefix of the current transition. 6. The method for decomposing a service flow network based on a PN machine model according to claim 1, characterized in that after the step of incorporating the current transition and its pre- and post-transition into the current service subnet allocated to the current transition, the method for decomposing a service flow network based on a PN machine model further comprises: Determine whether the current business subnet has been traversed to the end. If so, continue to determine whether the transition sets of the undecomposed subnets have all been assigned business subnets; if so, end the business flow network decomposition; if not, return to the step of selecting the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, and using the transition of the transition set of the undecomposed subnet as the current transition; if the traversal is not completed, use the subsequent transition of the current transition as the current transition, and proceed to the step of synchronously processing the predecessor and successor of the current transition, finding the correlation between the predecessor and successor of the current transition, so as to construct the concurrently executed business subnet. 7. A business flow network decomposition system based on a PN machine model, characterized by comprising: A preprocessing module is used to construct a PN model of a service flow network and place all transitions in the PN model in a transition set of an undecomposed subnet; the transition is a data processing state of the PN model; each transition is provided with a subscript indicating a layer number and a number within each layer; A decomposition module is used to select the transition with the smallest index from the transition set of the undecomposed subnet as the initial transition, take the transition of the transition set of the undecomposed subnet as the current transition, and synchronously process the predecessor and successor of the current transition to find the correlation between the predecessor and successor of the current transition to construct a concurrently executed service subnet; wherein the step of synchronously processing the predecessor and successor of the current transition to find the correlation between the predecessor and successor of the current transition to construct a concurrently executed service subnet includes: Determine whether the number of states of the predecessor and successor of the current transition is equal and one-to-one corresponding; if so, merge the current transition and its predecessor and successor into the current business subnet allocated for the current transition; if not, continue to determine whether the number of predecessors and successors of the current transition is the same; if so, proceed to the step of merging the current transition and its predecessor and successor into the current business subnet allocated for the current transition; if not, continue to determine whether the number of predecessors of the current transition is greater than the number of successors; if so, process the number of successors of the current transition and construct an unallocated business subnet; if not, process the number of predecessors of the current transition and construct an unallocated business subnet. 8. A computer-readable storage medium having a computer program stored thereon, characterized in that when the program is executed by a processor, the service flow network decomposition method based on the PN machine model as described in any one of claims 1 to 6 is implemented. 9. A service flow network decomposition device based on a PN machine model, characterized by comprising: a processor and a memory; The memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that the device executes the service flow network decomposition method based on the PN machine model as described in any one of claims 1 to 6.