Concurrent service processing method, device and equipment based on time delay Petri network and storage medium

Abstract

The invention discloses a concurrent service processing method, device and equipment based on a time delay Petri network and a storage medium, and the method comprises the steps: determining a service flow of each service for multiple concurrent services; constructing a time delay Petri network model corresponding to the VNF-FG based on the business processes of the plurality of businesses; the time delay Petri network model comprises a network sharing resource library; analyzing the time delay Petri network model to obtain a plurality of analysis results for the processing flow of the concurrent multiple services; under the condition that it is determined that deadlock exists in the multiple analysis results, a preset deadlock avoiding strategy is utilized to update the time delay Petri net model, and a deadlock-free time delay Petri net model is obtained; and based on a deadlock-free delay Petri network model, determining a processing flow of the concurrent multiple services. By adopting the method, competition conflicts of different services to network sharing resources can be avoided under the conditions that multiple services multiplex network virtualization resources and the network resources are limited.

Description

Technical Field

[0001] The present application relates to the technical field of business processing, and in particular to a concurrent business processing method, device, equipment and storage medium based on a time-delay Petri net. Background Art

[0002] In the virtualization scope of power automation scenarios, the network services required by the business are composed of a series of virtualized network functions (VNFs) connected in series. At present, the power scenario is usually a collaborative deployment of multiple services, and there are concurrent data transmissions of multiple service flows in the bearer network. In the network function virtualization scenario, under the condition of limited resources, shared VNFs may be reused by multiple service processes, which may cause conflicts between VNFs. For example, multiple services compete for network shared resources, which will cause deadlock problems in the data processing process, thereby affecting the accessibility of the service.

[0003] Therefore, when multiple services reuse network virtualization resources and resources are limited, how to avoid competition conflicts among different services for network shared resources has become an urgent problem to be solved. Summary of the invention

[0004] The embodiments of the present application provide a concurrent service processing method, apparatus, device and storage medium based on a delay Petri net, which can avoid competition conflicts between different services for network shared resources when multiple services reuse network virtualization resources and network resources are limited.

[0005] In a first aspect, an embodiment of the present application provides a concurrent service processing method based on a delay Petri net, the method comprising:

[0006] For concurrent multiple businesses, determine the business process for each business;

[0007] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtualized network function forwarding graph (VNF-FG) is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in the VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0008] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0009] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0010] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0011] In one of the embodiments, based on the business processes corresponding to multiple businesses, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed, including: taking each sub-business in the business processes corresponding to the multiple businesses as a place, taking the trigger event corresponding to each sub-business as a transition, taking the business data flow as a token in the place, and using directed arcs to connect each place and the transition corresponding to the place to obtain a Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein the Petri net model corresponding to VNF-FG also includes a network shared resource place; each place includes an arbitrary number of tokens; and associating delay parameters with each transition in the Petri net model corresponding to VNF-FG to obtain a delay Petri net model corresponding to VNF-FG.

[0012] In one of the embodiments, the delay Petri net model is analyzed to obtain multiple analysis results for the processing flow of concurrent multi-services, including: generating a reachable marking tree corresponding to the delay Petri net model based on a reachable marking tree generation algorithm; analyzing the reachable marking tree to obtain multiple analysis results for the processing flow of concurrent multi-services.

[0013] In one of the embodiments, a reachable marking tree is analyzed to obtain multiple analysis results of the processing flow for concurrent multi-services, including: determining whether there is an unreachable path in the reachable marking tree; when it is determined that there is an unreachable path in the reachable marking tree, determining that there is a deadlock in the multiple analysis results of the processing flow for concurrent multi-services.

[0014] In one of the embodiments, the method further includes: when it is determined that there is no unreachable path in the reachable marking tree, determining that there is no deadlock in multiple analysis results of the processing flow for concurrent multi-services; the method further includes: when it is determined that there is no deadlock in multiple analysis results, determining that the delay Petri net model is a deadlock-free delay Petri net model.

[0015] In one of the embodiments, the method further includes: determining a set of deadlock node identifiers in a reachable marking tree; and determining a preset deadlock avoidance strategy based on the set of deadlock node identifiers.

[0016] In a second aspect, the present application provides a concurrent service processing device based on a delay Petri net, the device comprising:

[0017] A determination module is used to determine the business process of each business for concurrent multiple businesses;

[0018] A construction module is used to construct a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG based on the business processes corresponding to multiple services; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0019] An analysis module is used to analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0020] An updating module, used for updating the delay Petri net model by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model when it is determined that deadlock exists in multiple analysis results;

[0021] The determination module is also used to determine the processing flow of concurrent multi-services based on a deadlock-free time-delay Petri net model.

[0022] In a third aspect, the present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0023] For concurrent multiple businesses, determine the business process for each business;

[0024] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0025] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0026] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0027] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0028] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the following steps are implemented:

[0029] For concurrent multiple businesses, determine the business process for each business;

[0030] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0031] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0032] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0033] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0034] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0035] For concurrent multiple businesses, determine the business process for each business;

[0036] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0037] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0038] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0039] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0040] The above-mentioned concurrent service processing method, device, equipment and storage medium based on delay Petri net, the computer equipment can determine the business process of each service for concurrent multiple services; based on the business processes corresponding to multiple services, construct a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG; the delay Petri net model is used to describe the transmission characteristics of the service process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library; the delay Petri net model is analyzed to obtain multiple analysis results for the processing flow of concurrent multiple services; when it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model; based on the deadlock-free delay Petri net model, the processing flow of concurrent multiple services is determined. By adopting this method, the computer device can construct a delay Petri net model corresponding to the VNF-FG based on the business processes of multiple services, thereby converting the network shared resource competition problem when multiple services reuse network virtualization resources and the network resources are limited into a deadlock analysis for the delay Petri net model. After that, by analyzing the constructed delay Petri net model, and when it is determined that there is a deadlock in the analysis result, the constructed delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model. Finally, based on the deadlock-free delay Petri net model, the processing flow of concurrent multiple services is determined, so that the competition conflict of different services for network shared resources can be avoided, thereby ensuring the reachability of each service in the concurrent multiple services. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0042] Figure 1 It is a schematic diagram of an application scenario of a concurrent service processing method based on a delay Petri net provided in an embodiment of the present application;

[0043] Figure 2 It is a flowchart of a concurrent service processing method based on a delay Petri net provided in an embodiment of the present application;

[0044] Figure 3 is a schematic diagram of a TdPN model provided in an embodiment of the present application;

[0045] Figure 4 It is a flowchart of another concurrent service processing method based on delay Petri net provided in an embodiment of the present application;

[0046] Figure 5 It is a time delay Petri net model corresponding to a concurrent multi-power information collection service provided in an embodiment of the present application;

[0047] Figure 6 It is a flowchart of another concurrent service processing method based on a delay Petri net provided in an embodiment of the present application;

[0048] Figure 7 It is a reachable marking tree provided in an embodiment of the present application;

[0049] Figure 8 It is a deadlock-free delay Petri net model provided by an embodiment of the present application;

[0050] Fig. 9 It is a structural diagram of a concurrent service processing device based on a delay Petri net provided in an embodiment of the present application;

[0051] Fig.10 It is a structural diagram of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0052] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0053] The following introduces the application scenario of the concurrent service processing method based on delay Petri net provided in the embodiment of the present application.

[0054] See also Figure 1 , Figure 1 Schematic diagram of an application scenario of a concurrent service processing method based on a time-delay Petri net provided in an embodiment of the present application. Figure 1 As shown, the computer device 101 ( Figure 1 In the figure, the computer device 101 is drawn as an example of a terminal device) and a power system server 102.

[0055] The computer device 101 can obtain multiple services from the power system server 102, and then determine the business process of each concurrent multi-service; based on the business processes corresponding to the multiple services, construct a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library; the delay Petri net model is analyzed to obtain multiple analysis results for the processing flow of concurrent multi-services; when it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model; based on the deadlock-free delay Petri net model, the processing flow of concurrent multi-services is determined. By adopting this method, the computer device can construct a delay Petri net model corresponding to the VNF-FG based on the business processes of multiple services, thereby converting the network shared resource competition problem when multiple services reuse network virtualization resources and the network resources are limited into a deadlock analysis of the delay Petri net model. After that, by analyzing the constructed delay Petri net model, and when it is determined that there is a deadlock in the analysis result, the constructed delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model. Finally, based on the deadlock-free delay Petri net model, the processing flow of concurrent multiple services is determined, so that the competition conflict of different services for network shared resources can be avoided, thereby ensuring the reachability of each service in the concurrent multiple services.

[0056] Optionally, the computer device 101 may be a terminal device, wherein the terminal device mentioned here may include but is not limited to: a smart phone, a tablet computer, a laptop computer, a desktop computer, a smart watch, a smart TV, a smart car terminal, etc.

[0057] See also Figure 2 , Figure 2 1 is a flowchart of a concurrent service processing method based on a time-delay Petri net provided in an embodiment of the present application. The method can be executed by a computer device (for example, the above-mentioned computer device 101). Figure 2 As shown, the concurrent service processing method based on the delay Petri net may include but is not limited to the following steps:

[0058] S201. For multiple concurrent businesses, determine the business process of each business.

[0059] For example, taking the electricity consumption information collection business in the power scenario as an example, the business process of this business (or a complete electricity consumption information collection process) may include the following steps: 1) First, a request task is generated on the Web server and sent to the collection server; 2) After the collection server completes task scheduling and protocol coding, it sends the collection code to the front-end server; 3) After the front-end server completes the analysis, it sends the collection request to the collection terminal; 4) The collection terminal receives the request and feeds back the corresponding information.

[0060] S202. Based on the business processes corresponding to the multiple businesses, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed.

[0061] Among them, the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library.

[0062] Among them, VNF-FG refers to the virtual network topology used to describe the connection relationship of VNFs. VNF-FG consists of multiple groups of VNFs and virtual links (VL). Compared with the traditional forwarding graph based on physical devices, VNF-FG can share network resources through the decoupling of software and hardware, making the deployment of new services more flexible, and has great advantages in efficiency, network elasticity, and deployability.

[0063] The Timed Petri Nets (TdPN) model is a Petri Net model that includes time factors and can be used to analyze the performance of asynchronous concurrent systems. For example, see Figure 3 , Figure 3 Schematic diagram of a TdPN model provided in an embodiment of the present application. Figure 3 As shown in the figure, circles represent places, which are usually used to model components that store or use resources; rectangles represent transitions, which are usually used to model operations. Through the occurrence of transitions, resources in places are used to change the system state; directed arcs connect tokens and places, indicating the flow relationship of the network; solid black dots in places represent tokens, which are used to represent resources in places.

[0064] TdPN is a sextuple N = (P, T, F, V, M0, D), where (P, T, F, V, M0) is a prototype Petri net, D is the set of delay elements defined on the transition set T, and , for p∈P, D(p)=x, which means that it takes x time units to complete the process through place p. i is a binary group M i =(m i ,u i ), where mi (p-marking) is the node identification of the prototype Petri net, u i (t-marking) is the marking of the transition delay parameter. And for , .

[0065] S203: Analyze the delay Petri net model to obtain multiple analysis results for the processing flow of concurrent multi-services.

[0066] In an optional implementation, the computer device may analyze the delay Petri net model using analysis methods such as association matrix, state equation, reachable marking graph and reachable marking tree to obtain multiple analysis results for the processing flow of concurrent multi-services, which is not limited here.

[0067] S204: When it is determined that deadlock exists in the plurality of analysis results, the delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model.

[0068] In an optional implementation, the preset deadlock avoidance strategy may include but is not limited to adding system resources in the delay Petri net model, applying for system resources in sequence, adding enable arcs in the delay Petri net model, adding a controller in the delay Petri net model, etc.

[0069] S205: Determine the processing flow of concurrent multi-services based on the deadlock-free delay Petri net model.

[0070] In an embodiment of the present application, a computer device can determine the business process of each concurrent multi-service; based on the business processes corresponding to the multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library; the delay Petri net model is analyzed to obtain multiple analysis results of the processing flow for concurrent multi-services; when it is determined that deadlock exists in the multiple analysis results, the delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model; based on the deadlock-free delay Petri net model, the processing flow of concurrent multi-services is determined. By adopting this method, the computer device can construct a delay Petri net model corresponding to the VNF-FG based on the business processes of multiple services, thereby converting the network shared resource competition problem when multiple services reuse network virtualization resources and the network resources are limited into a deadlock analysis of the delay Petri net model. After that, by analyzing the constructed delay Petri net model, and when it is determined that there is a deadlock in the analysis result, the constructed delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model. Finally, based on the deadlock-free delay Petri net model, the processing flow of concurrent multiple services is determined, so that the competition conflict of different services for network shared resources can be avoided, thereby ensuring the reachability of each service in the concurrent multiple services.

[0071] See also Figure 4 , Figure 4 is a flowchart of another concurrent service processing method based on a delay Petri net provided in an embodiment of the present application. Figure 2 Compared with the concurrent business processing method based on delay Petri net shown in Figure 4 The method shown in FIG. 1 specifically describes how a computer device constructs a delay Petri net corresponding to a VNF-FG based on the business processes of multiple businesses. Figure 4 As shown, the concurrent service processing method based on the delay Petri net may include but is not limited to the following steps:

[0072] S401. For multiple concurrent businesses, determine the business process of each business.

[0073] For example, taking the electricity consumption information collection business in the power scenario as an example, the business process of this business (or a complete electricity consumption information collection process) may include the following steps: (1) first generate a request task on the Web server and send it to the collection server; (2) after the collection server completes task scheduling and protocol coding, it sends the collection code to the front-end server; (3) after the front-end server completes the analysis, it sends the collection request to the collection terminal; (4) the collection terminal receives the request and feeds back the corresponding information.

[0074] S402. Take each sub-business in the business process corresponding to the multiple businesses as a place, take the trigger event corresponding to each sub-business as a transition, take the business data flow as a token in the place, use directed arcs to connect each place and the transition corresponding to the place, and obtain the Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein VNF-FG also includes a network shared resource place.

[0075] The computer device can model the VNF node (each sub-service in the business process of multiple services as a place) as a place, the event "complete VNF instantiation and processing, business data flows to the next node" (the trigger event corresponding to each sub-service) as a transition, the business data flow is modeled as a token, and the directed arc represents the virtual link connecting the VNF nodes, and the Petri net model corresponding to the VNF-FG is obtained. After that, the computer device can also simulate the virtual network forwarding path of the business data flow in the VNF-FG through the flow of tokens in the network model.

[0076] S403. Associate the delay parameter with each transition in the Petri net model corresponding to the VNF-FG to obtain the delay Petri net model corresponding to the VNF-FG.

[0077] In an optional implementation, the delay parameter may be expressed as D(T vi )=d vi , used to indicate that the Token has passed through d after arriving at the input library vi The transition occurs after d time units have passed, which means that the VNF node has vi After a time unit, instantiation and processing are completed, and the business data flows to the next node.

[0078] Continuing with the example in step S401, assuming that the electricity consumption information collection service has two concurrent service flows and there is a competition relationship for network shared resources, the delay Petri net model corresponding to the VNF-FG constructed by the computer device based on the above two service flows can be found in Figure 5 As shown, Figure 5 This is a time delay Petri net model corresponding to a concurrent multi-power information collection service provided by an embodiment of the present application. Figure 5As shown in the figure, p1, p2, ..., p8 represent 8 places corresponding to two business flows (one of which corresponds to 4 places, i.e. 4 steps), and their definitions can be found in Table 1 below; p9 represents a network shared resource place; t1, t2, ..., t8 represent transitions. Among them, transitions t1, t2, t5, and t6 compete for place p9.

[0079] Table 1 Library definition table

[0080]

[0081] S404: Analyze the delay Petri net model to obtain multiple analysis results for the processing flow of concurrent multi-services.

[0082] S405 . When it is determined that deadlock exists in the plurality of analysis results, the delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model.

[0083] In an optional implementation, the relevant descriptions of steps S404 and S405 can refer to the descriptions of the aforementioned steps S203 and S204, respectively, and will not be repeated here.

[0084] S406: Determine the processing flow of concurrent multi-services based on the deadlock-free delay Petri net model.

[0085] In an optional implementation, a computer device determines the processing flow of concurrent multi-services based on a deadlock-free delay Petri net model, which may include: determining a virtual network forwarding path for concurrent multi-services based on a deadlock-free delay Petri net model; mapping the virtual network forwarding path to a physical forwarding path in a physical network, and determining the processing flow of concurrent multi-services based on the physical forwarding path.

[0086] In this implementation, the physical network may include physical resources such as switches, servers, links, etc. at the infrastructure layer.

[0087] In the embodiment of the present application, the computer device can use each sub-service in the business process corresponding to multiple services as a library, use the trigger event corresponding to each sub-service as a transition, use the business data flow as a token in the library, and use a directed arc to connect each library and the transition corresponding to the library to obtain a virtual network function forwarding graph VNF-FG; wherein the VNF-FG also includes a network shared resource library; each library includes an arbitrary number of tokens; the delay parameter is associated with each transition in the VNF-FG to obtain a delay Petri net model corresponding to the VNF-FG, so that the multi-service multiplexing network virtualization resource The network shared resource competition problem under the condition of limited network resources is converted into a deadlock analysis of the delay Petri net model. Afterwards, the constructed delay Petri net model is analyzed, and when it is determined that there is a deadlock in the analysis result, the constructed delay Petri net model is updated using the preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model. Finally, based on the deadlock-free delay Petri net model, the processing flow of concurrent multi-services is determined. In this way, the competition conflict of different services for network shared resources can be avoided, thereby ensuring the reachability of each service in the concurrent multi-services.

[0088] See also Figure 6 , Figure 6 1 is a flowchart of another concurrent service processing method based on a time-delay Petri net provided in an embodiment of the present application. Figure 4 Compared with the concurrent business processing method based on delay Petri net shown in Figure 6 The method shown specifically describes how a computer device analyzes a time delay Petri net model to obtain multiple analysis results for the processing flow of concurrent multi-services. Figure 6 As shown, the concurrent service processing method based on the delay Petri net may include but is not limited to the following steps:

[0089] S601. For multiple concurrent businesses, determine the business process of each business.

[0090] S602. Take each sub-business in the business process corresponding to the multiple businesses as a place, take the trigger event corresponding to each sub-business as a transition, take the business data flow as a token in the place, use directed arcs to connect each place and the transition corresponding to the place, and obtain the Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein VNF-FG also includes a network shared resource place.

[0091] S603. Associate the delay parameter with each transition in the Petri net model corresponding to the VNF-FG to obtain the delay Petri net model corresponding to the VNF-FG.

[0092] In an optional implementation, the relevant descriptions of steps S601 to S603 can refer to the descriptions of the aforementioned steps S401 to S403, and will not be repeated here.

[0093] S604: Generate a reachable marking tree corresponding to the delay Petri net model based on a reachable marking tree generation algorithm.

[0094] Among them, the reachable marking tree generation algorithm is an important method for analyzing the dynamic behavior of the time-delay Petri net model. The reachable marking tree generated by the reachable marking tree generation algorithm (in terms of R (M i ) is a node set, and a directed tree consisting of arc sets with direct reachable relationships between identifiers can well describe the relationship between identifiers and transitions in the delay Petri net model.

[0095] For example, suppose the delay Petri net model is as follows Figure 5 As shown, the computer device is based on the reachable marking tree generation algorithm, and the reachable marking tree corresponding to the generated delay Petri net model can be found in Figure 7 As shown, Figure 7 is a reachable marking tree provided in the embodiment of the present application. Figure 7 As shown, M i It represents the identifier in the delay Petri net model corresponding to VNF-FG.

[0096] like Figure 7 As shown, starting from the initial identifier M0, the computer device determines that the state corresponding to each node identifier in the reachable marking tree can be shown in Table 2. Among them, the last column of Table 2 indicates that the transition corresponding to each node identifier occurs.

[0097] Table 2 All marking states of the reachable marking tree

[0098]

[0099] As shown in Table 2 above, M i is a binary group M i =(m i ,u i ), where m i (p-marking) is the node identification of the prototype Petri net, u i (t-marking) is the marking of the transition delay parameter.

[0100] S605, determine whether there is an unreachable path in the reachable marking tree, if so, execute steps S606, S607 and S610; if not, execute steps S608 to S610.

[0101] For example, following the above example, Figure 7 It can be seen that both power consumption information collection service data flows can complete the service process, that is, there is a transition sequence σ, so that M0 to M7 is reachable (that is, M0[σ>M7). Optionally, the transition sequence σ can be determined by the computer device through the following steps.

[0102] Step 1: Equation of state Solve for X in and get X.

[0103] In the above state equation, M0=((1,0,0,0,1,0,0,0,2),(0,0,0,0,0,0,0,0,0)); M7=((0,0,0,0,0,0,0,0,2),(0,0,0,0,0,0,0,0,0)); A is the incidence matrix, A=[a ij ] n*m , where a ij =a ij + -a ij - , where a ij + 、a ij - and A can be expressed as the following formulas (1)~(3) respectively.

[0104] (1)

[0105] (2)

[0106] (3)

[0107] Step 2: Determine the transition occurrence sequence σ based on X.

[0108] Depend on Figure 7 It can be seen that there are multiple paths such that M0[σ>M7, and the following formula (4) is one of the reachable paths.

[0109] (4)

[0110] In formula (4), It indicates the intermediate state after the transition is triggered but the consumption delay is not met. The arrow indicates the transition that has occurred and the corresponding delay parameters.

[0111] However, Figure 7 There are also some node identifier changes that are unreachable, such as M 18 When the node ID changes to M7 18 When the system stops running, the business process cannot reach M7. In this case, the computer equipment can determine M 18 is a deadlock node identifier; thus, the computer device can determine that there is a deadlock in multiple analysis results of the processing flow of two concurrent power consumption information collection services. Therefore, there is an unreachable path in the reachable marking tree. In this case, the computer device can execute the following steps S606 and S607.

[0112] S606: Determine whether a deadlock exists in multiple analysis results of the processing flow of concurrent multiple services.

[0113] S607: Using a preset deadlock avoidance strategy, the delay Petri net model is updated to obtain a deadlock-free delay Petri net model.

[0114] In an optional implementation, before step S607, the computer device may further determine a set of deadlock node identifiers in the reachable marking tree; and determine a preset deadlock avoidance strategy based on the set of deadlock node identifiers.

[0115] For example, Figure 7 As shown, the deadlock node identification set DM={M 18}. In this case, the computer device can determine that the preset deadlock avoidance strategy is to add a controller in the delay Petri net model. The idea of ​​this strategy is: construct a place constraint condition, that is, the sum of the number of identifiers in the place containing the deadlock identifier in the deadlock identifier state must be less than the total number of the deadlock identifiers, corresponding to the place constraint condition. The constraint changes cannot occur at the same time, and the idea of ​​place invariants is used to avoid deadlock. Among them, the deadlock-free delay Petri net model obtained according to this strategy can be found in Figure 8 , Figure 8 It is a deadlock-free delay Petri net model provided in an embodiment of the present application.

[0116] S608: Determine that there is no deadlock in the multiple analysis results of the processing flow of the concurrent multi-business.

[0117] S609: Determine that the time-delay Petri net model is a deadlock-free time-delay Petri net model.

[0118] S610: Determine the processing flow of concurrent multi-services based on a deadlock-free time-delay Petri net model.

[0119] In an optional implementation, the relevant description of step S610 can refer to the description of the aforementioned step S406, which will not be repeated here.

[0120] In the embodiment of the present application, the computer device can generate a reachable marking tree corresponding to the delay Petri net model based on the reachable marking tree generation algorithm, and then, when it is determined that there is an unreachable path in the reachable marking tree, it is determined that there is a deadlock in multiple analysis results of the processing flow for concurrent multi-services. At this time, the computer device can use the preset deadlock avoidance strategy to update the delay Petri net model to obtain a deadlock-free delay Petri net model; when it is determined that there is no unreachable path in the reachable marking tree, it is determined that there is no deadlock in multiple analysis results of the processing flow for concurrent multi-services. At this time, the computer device can determine that the delay Petri net model is a deadlock-free delay Petri net model; finally, based on the deadlock-free delay Petri net model, the processing flow of concurrent multi-services is determined. In this way, the competition and conflict of different services for network shared resources can be avoided, thereby ensuring the reachability of each service in the concurrent multi-service.

[0121] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0122] Based on the same inventive concept, the embodiment of the present application also provides a concurrent service processing device based on a delay Petri net for implementing the concurrent service processing method based on a delay Petri net involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in the embodiments of one or more concurrent service processing devices based on a delay Petri net provided below can refer to the limitations of the concurrent service processing method based on a delay Petri net above, and will not be repeated here.

[0123] See also Fig. 9 , Fig. 9 Schematic diagram of a concurrent service processing device based on a time-delay Petri net provided in an embodiment of the present application. Fig. 9 As shown, the concurrent service processing device based on the delay Petri net may include but is not limited to:

[0124] A determination module 901 is used to determine the business process of each business for concurrent multiple businesses;

[0125] A construction module 902 is used to construct a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG based on the business processes corresponding to the multiple businesses; the delay Petri net model is used to describe the transmission characteristics of the business process in the VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0126] An analysis module 903 is used to analyze the delay Petri net model to obtain multiple analysis results for the processing flow of concurrent multi-services;

[0127] An updating module 904 is used to update the delay Petri net model by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model when it is determined that there is a deadlock in the multiple analysis results;

[0128] The determination module 901 is also used to determine the processing flow of concurrent multi-services based on a deadlock-free delay Petri net model.

[0129] In one embodiment, when the construction module 902 is used to construct a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG based on the business processes corresponding to multiple services, it is specifically used to: take each sub-service in the business processes corresponding to the multiple services as a library place, take the trigger event corresponding to each sub-service as a transition, take the business data flow as a token in the library place, use directed arcs to connect each library place and the transition corresponding to the library place, so as to obtain the Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein VNF-FG also includes a network shared resource library place; each library place includes any number of tokens; and associate the delay parameter with each transition in the Petri net model corresponding to VNF-FG to obtain the delay Petri net model corresponding to VNF-FG.

[0130] In one embodiment, when the analysis module 903 is used to analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services, it is specifically used to: generate a reachable marking tree corresponding to the delay Petri net model based on a reachable marking tree generation algorithm; analyze the reachable marking tree to obtain multiple analysis results for the processing flow of concurrent multi-services.

[0131] In one embodiment, when the analysis module 903 is used to analyze the reachable marking tree and obtain multiple analysis results of the processing flow for concurrent multi-businesses, it is specifically used to: determine whether there is an unreachable path in the reachable marking tree; when it is determined that there is an unreachable path in the reachable marking tree, determine whether there is a deadlock in the multiple analysis results of the processing flow for concurrent multi-businesses.

[0132] In one embodiment, the determination module 901 is also used to determine that there is no deadlock in multiple analysis results of the processing flow for concurrent multi-businesses when it is determined that there is no unreachable path in the reachable marking tree; the determination module 901 is also used to determine that the delay Petri net model is a deadlock-free delay Petri net model when it is determined that there is no deadlock in multiple analysis results.

[0133] In one embodiment, the determination module 901 is further used to determine a set of deadlock node identifiers in a reachable marking tree; and determine a preset deadlock avoidance strategy based on the set of deadlock node identifiers.

[0134] Each module in the above-mentioned concurrent service processing device based on delay Petri net can be implemented in whole or in part by software, hardware and their combination. Each of the above-mentioned modules can be embedded in or independent of the processor in the terminal device in the form of hardware, or can be stored in the memory in the terminal device in the form of software, so that the processor can call and execute the corresponding operations of each of the above modules.

[0135] In an exemplary embodiment, the present application provides a computer device, which may be a terminal, and its internal structure diagram may be as follows: Fig.10 As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input / output interface. 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 and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, near field communication (NFC) or other technologies. When the computer program is executed by the processor, a concurrent business processing method based on a delay Petri net is implemented.

[0136] Those skilled in the art will understand that Fig.10 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0137] In an exemplary embodiment, the present application provides a computer device, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0138] For concurrent multiple businesses, determine the business process for each business;

[0139] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0140] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0141] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0142] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0143] In one embodiment, when a processor executes a computer program to implement a delay Petri net model corresponding to a virtual network function forwarding graph VNF-FG based on business processes corresponding to multiple businesses, the following steps are specifically implemented: each sub-business in the business processes corresponding to the multiple businesses is used as a place, a trigger event corresponding to each sub-business is used as a transition, and the business data flow is used as a token in the place, and each place and the transition corresponding to the place are connected by a directed arc to obtain a Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein VNF-FG also includes a network shared resource place; each place includes an arbitrary number of tokens; and the delay parameter is associated with each transition in the Petri net model corresponding to the VNF-FG to obtain a delay Petri net model corresponding to the VNF-FG.

[0144] In one embodiment, when a processor executes a computer program to analyze a delay Petri net model and obtains multiple analysis results for a processing flow of concurrent multi-services, the following steps are specifically implemented: based on a reachable marking tree generation algorithm, a reachable marking tree corresponding to the delay Petri net model is generated; and the reachable marking tree is analyzed to obtain multiple analysis results for a processing flow of concurrent multi-services.

[0145] In one embodiment, when a processor executes a computer program to analyze a reachable marking tree and obtains multiple analysis results for a processing flow of concurrent multiple services, the following steps are specifically implemented: determining whether an unreachable path exists in the reachable marking tree; and when it is determined that an unreachable path exists in the reachable marking tree, determining whether a deadlock exists in the multiple analysis results for the processing flow of concurrent multiple services.

[0146] In one embodiment, when the processor executes the computer program, the following steps are also implemented: when it is determined that there is no unreachable path in the reachable marking tree, it is determined that there is no deadlock in multiple analysis results of the processing flow for concurrent multi-services; when the processor executes the computer program, the following steps are also implemented: when it is determined that there is no deadlock in multiple analysis results, the delay Petri net model is determined to be a deadlock-free delay Petri net model.

[0147] In one embodiment, when the processor executes the computer program, the following steps are further implemented: determining a set of deadlock node identifiers in a reachable marking tree; and determining a preset deadlock avoidance strategy based on the set of deadlock node identifiers.

[0148] In an exemplary embodiment, the present application provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the following steps are implemented:

[0149] For concurrent multiple businesses, determine the business process for each business;

[0150] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0151] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0152] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0153] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0154] In one embodiment, when a computer program is executed by a processor to implement a delay Petri net model corresponding to a virtual network function forwarding graph VNF-FG based on business processes corresponding to multiple businesses, the following steps are specifically implemented: each sub-business in the business processes corresponding to the multiple businesses is used as a place, the trigger event corresponding to each sub-business is used as a transition, the business data flow is used as a token in the place, and each place and the transition corresponding to the place are connected by directed arcs to obtain a Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein VNF-FG also includes a network shared resource place; each place includes an arbitrary number of tokens; and the delay parameter is associated with each transition in the Petri net model corresponding to the VNF-FG to obtain a delay Petri net model corresponding to the VNF-FG.

[0155] In one embodiment, when a computer program is executed by a processor to analyze a delay Petri net model and obtain multiple analysis results for a processing flow of concurrent multiple services, the following steps are specifically implemented: based on a reachable marking tree generation algorithm, a reachable marking tree corresponding to the delay Petri net model is generated; and the reachable marking tree is analyzed to obtain multiple analysis results for a processing flow of concurrent multiple services.

[0156] In one embodiment, when a computer program is executed by a processor to analyze a reachable marking tree and obtain multiple analysis results for a processing flow of concurrent multiple services, the following steps are specifically implemented: determining whether there is an unreachable path in the reachable marking tree; and when it is determined that there is an unreachable path in the reachable marking tree, determining whether there is a deadlock in the multiple analysis results for the processing flow of concurrent multiple services.

[0157] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented: when it is determined that there is no unreachable path in the reachable marking tree, it is determined that there is no deadlock in multiple analysis results of the processing flow for concurrent multi-business; when the computer program is executed by the processor, the following steps are also implemented: when it is determined that there is no deadlock in multiple analysis results, the delay Petri net model is determined to be a deadlock-free delay Petri net model.

[0158] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented: determining a set of deadlock node identifiers in a reachable marking tree; and determining a preset deadlock avoidance strategy based on the set of deadlock node identifiers.

[0159] In an exemplary embodiment, the present application provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0160] For concurrent multiple businesses, determine the business process for each business;

[0161] Based on the business processes corresponding to multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library;

[0162] Analyze the delay Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services;

[0163] When it is determined that deadlock exists in multiple analysis results, the delay Petri net model is updated by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model;

[0164] Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multi-services is determined.

[0165] In one embodiment, when a computer program is executed by a processor to implement a delay Petri net model corresponding to a virtual network function forwarding graph VNF-FG based on business processes corresponding to multiple services, the following steps are specifically implemented: each sub-service in the business processes corresponding to the multiple services is used as a place, the trigger event corresponding to each sub-service is used as a transition, the business data flow is used as a token in the place, and each place and the transition corresponding to the place are connected by a directed arc to obtain the virtual network function forwarding graph VNF-FG; wherein VNF-FG also includes a network shared resource place; each place includes an arbitrary number of tokens; the delay parameter is associated with each transition in the Petri net model corresponding to VNF-FG to obtain the delay Petri net model corresponding to VNF-FG.

[0166] In one embodiment, when a computer program is executed by a processor to analyze a delay Petri net model and obtain multiple analysis results for a processing flow of concurrent multiple services, the following steps are specifically implemented: based on a reachable marking tree generation algorithm, a reachable marking tree corresponding to the delay Petri net model is generated; and the reachable marking tree is analyzed to obtain multiple analysis results for a processing flow of concurrent multiple services.

[0167] In one embodiment, when a computer program is executed by a processor to analyze a reachable marking tree and obtain multiple analysis results for a processing flow of concurrent multiple services, the following steps are specifically implemented: determining whether there is an unreachable path in the reachable marking tree; and when it is determined that there is an unreachable path in the reachable marking tree, determining whether there is a deadlock in the multiple analysis results for the processing flow of concurrent multiple services.

[0168] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented: when it is determined that there is no unreachable path in the reachable marking tree, it is determined that there is no deadlock in multiple analysis results of the processing flow for concurrent multi-business; when the computer program is executed by the processor, the following steps are also implemented: when it is determined that there is no deadlock in multiple analysis results, the delay Petri net model is determined to be a deadlock-free delay Petri net model.

[0169] In one embodiment, when the computer program is executed by a processor, the following steps are further implemented: determining a set of deadlock node identifiers in a reachable marking tree; and determining a preset deadlock avoidance strategy based on the set of deadlock node identifiers.

[0170] It should be noted that the data involved in this application (including but not limited to concurrent multiple services, business processes of each service, etc.) are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0171] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0172] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0173] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A concurrent service processing method based on a time-delay Petri net, characterized in that: The method comprises: For multiple concurrent services, determine the business process of each of the services; Based on the business processes corresponding to the multiple services, a delay Petri net model corresponding to the virtual network function forwarding graph VNF-FG is constructed; the delay Petri net model is used to describe the transmission characteristics of the business process in the VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library; Analyze the delay Petri net model to obtain multiple analysis results for the processing flow of the concurrent multi-service; When it is determined that deadlock exists in the plurality of analysis results, the delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model; Based on the deadlock-free delay Petri net model, the processing flow of the concurrent multi-services is determined.

2. The method according to claim 1, characterized in that The constructing of a delay Petri net model corresponding to a virtual network function forwarding graph VNF-FG based on the business processes corresponding to the plurality of businesses respectively includes: Each sub-service in the business process corresponding to the plurality of the services is taken as a place, the trigger event corresponding to each sub-service is taken as a transition, the business data flow is taken as a token in the place, and each place and the transition corresponding to the place are connected by directed arcs to obtain a Petri net model corresponding to the virtual network function forwarding graph VNF-FG; wherein the Petri net model corresponding to the VNF-FG also includes a network shared resource place; each place includes any number of tokens; Associate the delay parameter with each of the transitions in the Petri net model corresponding to the VNF-FG to obtain the delay Petri net model corresponding to the VNF-FG.

3. The method according to claim 1, characterized in that The delay Petri net model is analyzed to obtain multiple analysis results for the processing flow of the concurrent multi-services, including: Based on a reachable marking tree generation algorithm, generating a reachable marking tree corresponding to the delay Petri net model; The reachable marking tree is analyzed to obtain multiple analysis results for the processing flow of the concurrent multi-services.

4. The method according to claim 3, characterized in that The reachable marking tree is analyzed to obtain multiple analysis results for the processing flow of the concurrent multi-service, including: Determine whether there is an unreachable path in the reachable marking tree; When it is determined that an unreachable path exists in the reachable marking tree, it is determined that a deadlock exists in a plurality of analysis results of the processing flow of the concurrent multi-services.

5. The method according to claim 4, characterized in that The method further comprises: In the case of determining that there is no unreachable path in the reachable marking tree, determining that there is no deadlock in multiple analysis results of the processing flow of the concurrent multi-service; The method further comprises: In the case where it is determined that there is no deadlock in the plurality of analysis results, the delay Petri net model is determined to be the deadlock-free delay Petri net model.

6. The method according to claim 4, characterized in that The method further comprises: Determine a deadlock node identifier set in the reachable marking tree; The preset deadlock avoidance strategy is determined based on the deadlock node identification set.

7. A concurrent service processing device based on a time-delay Petri net, characterized in that: The device comprises: A determination module, used for determining the business process of each of the concurrent multiple businesses; A construction module is used to construct a delay Petri net model corresponding to a virtual network function forwarding graph VNF-FG based on the business processes corresponding to the multiple services respectively; the delay Petri net model is used to describe the transmission characteristics of the business process in the VNF-FG and the time characteristics of each node; the delay Petri net model includes a network shared resource library; An analysis module, used to analyze the delay Petri net model to obtain multiple analysis results for the processing flow of the concurrent multi-service; An updating module, for updating the delay Petri net model by using a preset deadlock avoidance strategy to obtain a deadlock-free delay Petri net model when it is determined that a deadlock exists in the plurality of analysis results; The determination module is further used to determine the processing flow of the concurrent multi-services based on the deadlock-free delay Petri net model.

8. A computer device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method according to any one of claims 1 to 6 when executing the computer program.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images