Concurrent service processing method and device based on delay petri net, equipment and storage medium

Abstract

A concurrent service processing method and device based on a delay Petri net, equipment and a storage medium, the method comprising: determining the service flow of each service for concurrent multi-service; constructing a delay Petri net model corresponding to VNF-FG based on the service flow of each service; the delay Petri net model includes a network shared resource library; analyzing the delay Petri net model to obtain multiple analysis results of the processing flow of concurrent multi-service; in the case where multiple analysis results exist deadlocks, updating the delay Petri net model using a preset deadlock avoidance strategy to obtain a delay Petri net model without deadlocks; determining the processing flow of concurrent multi-service based on the delay Petri net model without deadlocks. By using the method, the competition and conflict of different services for network shared resources can be avoided in the case where multi-service multiplexes network virtualization resources and network resources are limited.

Description

Technical Field

[0001] This application relates to the field of business processing technology, and in particular to a concurrent business processing method, apparatus, device and storage medium based on time-delay Petri nets. Background Technology

[0002] In power automation scenarios, within the realm of virtualization, the network services required by businesses consist of a series of interconnected Virtualized Network Functions (VNFs). Currently, power scenarios typically involve the collaborative deployment of multiple services, resulting in concurrent data transmission of multiple service flows within the bearer network. In network function virtualization scenarios, under resource-constrained conditions, shared VNFs may be reused by multiple service processes, potentially leading to conflicts between VNFs. For example, multiple services may compete for shared network resources, causing deadlock issues during data processing and impacting service reachability.

[0003] Therefore, in situations where multiple services reuse network virtualization resources and resources are limited, how to avoid competition and conflict between different services for shared network resources has become an urgent problem to be solved. Summary of the Invention

[0004] This application provides a concurrent service processing method, apparatus, device, and storage medium based on a time-delay Petri net, which can avoid competition for shared network resources among different services when multiple services reuse network virtualization resources and network resources are limited.

[0005] In a first aspect, embodiments of this application provide a concurrent service processing method based on a time-delayed Petri net, the method comprising:

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

[0007] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtualized Network Function Forwarding Graph (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0008] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0009] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0010] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0011] In one embodiment, a latency Petri net model corresponding to a Virtual Network Function Forwarding Graph (VNF-FG) is constructed based on the service processes corresponding to multiple services. This includes: treating each sub-service in the service processes corresponding to the multiple services as a place, the triggering event corresponding to each sub-service as a transition, and the service data stream as a token in the place; connecting each place with its corresponding transition using directed arcs to obtain the Petri net model corresponding to the VNF-FG; wherein the Petri net model corresponding to the VNF-FG also includes network shared resource places; each place includes any number of tokens; and associating latency parameters with each transition in the Petri net model corresponding to the VNF-FG to obtain the latency Petri net model corresponding to the VNF-FG.

[0012] In one embodiment, the latency 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 latency Petri net model based on a reachable marking tree generation algorithm; and analyzing the reachable marking tree to obtain multiple analysis results for the processing flow of concurrent multi-services.

[0013] In one embodiment, the reachability marking tree is analyzed to obtain multiple analysis results for the concurrent multi-service processing flow, including: determining whether there is an unreachable path in the reachability marking tree; and if it is determined that there is an unreachable path in the reachability marking tree, determining that there is a deadlock in the multiple analysis results for the concurrent multi-service processing flow.

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

[0015] In one embodiment, 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] Secondly, this application provides a concurrent service processing apparatus based on a time-delayed Petri net, the apparatus comprising:

[0017] The determination module is used to determine the business process of each service in the context of multiple concurrent services;

[0018] The construction module is used to build a latency Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) based on the business processes corresponding to multiple services. The latency Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The latency Petri net model includes the network shared resource library.

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

[0020] The update module is used to update the time-delay Petri net model using a preset deadlock avoidance strategy when deadlock is found in multiple analysis results, so as to obtain a deadlock-free time-delay Petri net model.

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

[0022] Thirdly, this application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

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

[0024] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0025] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0026] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0027] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0028] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the following steps:

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

[0030] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0031] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0032] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0033] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0034] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, performs the following steps:

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

[0036] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0037] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0038] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0039] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0040] The aforementioned concurrent service processing method, apparatus, equipment, and storage medium based on delay Petri nets allow computer equipment to determine the service flow for each concurrent service; construct a delay Petri net model corresponding to a Virtual Network Function Forwarding Map (VNF-FG) based on the service flows corresponding to multiple services; the delay Petri net model describes the transmission characteristics of the service flow in the 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 services; if deadlock is found 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; and the processing flow of concurrent services is determined based on the deadlock-free delay Petri net model. Using this method, computer equipment can construct a latency Petri net model corresponding to VNF-FG based on the separate business processes of multiple services. This transforms the network resource sharing contention problem under the condition of multiple services sharing network virtualization resources and limited network resources into deadlock analysis of the latency Petri net model. Then, by analyzing the constructed latency Petri net model and determining that deadlock exists in the analysis results, the constructed latency Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free latency Petri net model. Finally, based on the deadlock-free latency Petri net model, the processing flow of concurrent multiple services is determined. In this way, competition conflicts between different services for network shared resources can be avoided, thereby ensuring the reachability of each service in concurrent multiple services. Attached Figure Description

[0041] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0042] Figure 1 This is a schematic diagram illustrating an application scenario of a concurrent service processing method based on a time-delay Petri net, as provided in an embodiment of this application.

[0043] Figure 2 This is a flowchart illustrating a concurrent service processing method based on a time-delay Petri net, as provided in an embodiment of this application.

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

[0045] Figure 4 This is a flowchart illustrating another concurrent service processing method based on a time-delay Petri net provided in an embodiment of this application;

[0046] Figure 5 This application provides a Petri net model for the concurrent time delay of multiple electricity information collection services.

[0047] Figure 6 This is a flowchart illustrating another concurrent service processing method based on a time-delay Petri net provided in the embodiments of this application;

[0048] Figure 7 This is a reachable marking tree provided in the embodiments of this application;

[0049] Figure 8 This application provides a deadlock-free, time-delay Petri net model.

[0050] Figure 9 This is a schematic diagram of the structure of a concurrent service processing device based on a time-delay Petri net, provided in an embodiment of this application;

[0051] Figure 10 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0052] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0053] The following describes the application scenarios of the concurrent service processing method based on time-delay Petri nets provided in the embodiments of this application.

[0054] Please see Figure 1 , Figure 1 This is a schematic diagram illustrating an application scenario of a concurrent service processing method based on a time-delay Petri net, as provided in an embodiment of this application. For example... Figure 1 As shown, it includes computer equipment 101 ( Figure 1 (The computer equipment 101 is drawn as an example of a terminal device) and the power system server 102.

[0055] Computer device 101 can obtain multiple services from power system server 102. Then, for concurrent multiple services, it determines the service process of each service. Based on the service processes corresponding to the multiple services, it constructs a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Map (VNF-FG). The time-delay Petri net model is used to describe the transmission characteristics of the service process in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library. The time-delay Petri net model is analyzed to obtain multiple analysis results for the processing flow of concurrent multiple services. If deadlock is found in the multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model. Based on the deadlock-free time-delay Petri net model, the processing flow of concurrent multiple services is determined. Using this method, computer equipment can construct a latency Petri net model corresponding to VNF-FG based on the separate business processes of multiple services. This transforms the network resource sharing contention problem under the condition of multiple services sharing network virtualization resources and limited network resources into deadlock analysis of the latency Petri net model. Then, by analyzing the constructed latency Petri net model and determining that deadlock exists in the analysis results, the constructed latency Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free latency Petri net model. Finally, based on the deadlock-free latency Petri net model, the processing flow of concurrent multiple services is determined. In this way, the competition conflict between different services for network shared resources can be avoided, thereby ensuring the reachability of each service in concurrent multiple services.

[0056] Optionally, the computer device 101 may be a terminal device. The terminal device mentioned herein may include, but is not limited to, smartphones, tablets, laptops, desktop computers, smartwatches, smart TVs, and smart vehicle terminals.

[0057] Please see Figure 2 , Figure 2 This is a flowchart illustrating a concurrent service processing method based on a time-delay Petri net, provided in an embodiment of this application. The method can be executed by a computer device (e.g., the computer device 101 described above). Figure 2 As shown, the concurrent service processing method based on time-delay Petri nets may include, but is not limited to, the following steps:

[0058] S201. For concurrent multiple services, determine the business process for each service.

[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 encoding, it sends the collection code to the front-end server; 3) After the front-end server completes parsing, 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 multiple services, construct a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG).

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

[0062] VNF-FG refers to a virtual network topology used to describe the connection relationships between VNFs. A VNF-FG consists of multiple VNFs and Virtual Links (VLs). Compared to traditional forwarding graphs based on physical devices, VNF-FG enables network resource sharing through hardware and software decoupling, allowing for more flexible deployment of new services and offering significant advantages in efficiency, network resilience, and deployability.

[0063] Timed Petri Nets (TdPN) models are Petri Net models that incorporate a time factor and can be used to analyze the performance of asynchronous concurrent systems. For an example, please refer to [link to example]. Figure 3 , Figure 3 This is a schematic diagram of a TdPN model provided in an embodiment of this application. Figure 3 As shown, circles represent places, which are typically used to model components that store or use resources; rectangles represent transitions, which are typically used to model operations that use resources in places to change the system state through the occurrence of transitions; directed arcs connect tokens and places, representing 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 six-tuple N = (P, T, F, V, M0, D), where (P, T, F, V, M0) is a prototype Petri net, and D is the set of time-delay elements defined on the transition set T. For p∈P, D(p)=x, indicating that it takes x time units to complete the journey through place p. Identifier M i It is a binary tuple M i =(m i ,u i ), where mi (p-marking) refers to the node identifiers of the prototype Petri net, u i (t-marking) is an identifier for the transition delay parameter. And for , .

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

[0066] In one alternative implementation, the computer device can use analysis methods such as correlation matrix, state equation, reachability marking graph and reachability marking tree to analyze the latency Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services, which are not limited here.

[0067] S204. If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0068] In one optional implementation, the preset deadlock avoidance strategy may include, but is not limited to, adding system resources to the time-delay Petri net model, requesting system resources in sequence, adding an enabling arc to the time-delay Petri net model, or adding a controller to the time-delay Petri net model.

[0069] S205. Based on a deadlock-free latency Petri net model, determine the processing flow for concurrent multi-services.

[0070] In this embodiment, the computer device can determine the service flow for each concurrent multi-service; based on the service flows corresponding to the multiple services, a latency Petri net model corresponding to the Virtual Network Function Forwarding Map (VNF-FG) is constructed; the latency Petri net model is used to describe the transmission characteristics of the service flow in the VNF-FG and the time characteristics of each node; the latency Petri net model includes a network shared resource library; the latency Petri net model is analyzed to obtain multiple analysis results for the processing flow of concurrent multi-service; if a deadlock is found in the multiple analysis results, the latency Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free latency Petri net model; based on the deadlock-free latency Petri net model, the processing flow of concurrent multi-service is determined. Using this method, computer equipment can construct a latency Petri net model corresponding to VNF-FG based on the separate business processes of multiple services. This transforms the network resource sharing contention problem under the condition of multiple services sharing network virtualization resources and limited network resources into deadlock analysis of the latency Petri net model. Then, by analyzing the constructed latency Petri net model and determining that deadlock exists in the analysis results, the constructed latency Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free latency Petri net model. Finally, based on the deadlock-free latency Petri net model, the processing flow of concurrent multiple services is determined. In this way, the competition conflict between different services for network shared resources can be avoided, thereby ensuring the reachability of each service in concurrent multiple services.

[0071] Please see Figure 4 , Figure 4 This is a flowchart illustrating another concurrent service processing method based on a time-delay Petri net provided in an embodiment of this application. Figure 2 Compared to the concurrent service processing method based on time-delay Petri nets shown, Figure 4 The method illustrated specifically demonstrates how computer equipment constructs a time-delay Petri net corresponding to the VNF-FG based on the separate business processes of multiple services. For example... Figure 4 As shown, the concurrent service processing method based on time-delay Petri nets may include, but is not limited to, the following steps:

[0072] S401. For concurrent multiple services, determine the business process for each service.

[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, a request task is generated on the Web server and sent to the collection server; (2) After the collection server completes the task scheduling and protocol encoding, it sends the collection code to the front-end server; (3) After the front-end server completes the parsing, 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-service in the business process corresponding to multiple services as a place, take the triggering event corresponding to each sub-service as a transition, take the business data flow as a token in the place, and use directed arcs to connect each place and the transition corresponding to that place to obtain the Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG); among which, the VNF-FG also includes network shared resource places.

[0075] Computer equipment can model VNF nodes (each sub-service in the separate business process of multiple services as a place) as places, the event "Complete VNF instantiation and processing, business data flows to the next node" (the triggering event corresponding to each sub-service) as a transition, the business data flow as a token, and directed arcs as virtual links connecting VNF nodes, thus obtaining the Petri net model corresponding to the VNF-FG. Subsequently, the computer equipment 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 time delay parameter with each transition in the Petri net model corresponding to VNF-FG to obtain the time delay Petri net model corresponding to VNF-FG.

[0077] In one alternative implementation, the delay parameter can be expressed as D(T) vi )=d vi This is used to indicate that after the token arrives at the input database, it goes through d. vi A change occurs only after a certain number of time units, representing the time interval d for a VNF node. vi Instantiation and processing are completed after a certain number of time units, and the business data flow moves to the next node.

[0078] Following the example in step S401, assuming that the electricity information collection service has two concurrent service flows, resulting in competition for shared network resources, the time-delay Petri net model corresponding to the VNF-FG constructed by the computer equipment based on these two service flows can be found here. Figure 5 As shown, Figure 5 This application provides a Petri net model for the concurrent processing of multiple electricity information collection services, corresponding to time delays. For example... Figure 5As shown, p1, p2, ..., p8 represent the eight storage locations corresponding to two business flows (one business flow corresponds to four storage locations, i.e., four steps), and their definitions can be found in Table 1 below; p9 represents the network shared resource storage location; t1, t2, ..., t8 represent transitions. Among them, transitions t1, t2, t5, and t6 occur in competition for storage location p9.

[0079] Table 1. Location Definition Table

[0080]

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

[0082] S405. If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0083] In an optional implementation, the relevant descriptions of steps S404 and S405 can be found in the descriptions of steps S203 and S204 above, and will not be repeated here.

[0084] S406. Based on a deadlock-free latency Petri net model, determine the processing flow for concurrent multi-services.

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

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

[0087] In this embodiment, the computer device can use each sub-service in the business process corresponding to multiple services as a place, the triggering event corresponding to each sub-service as a transition, and the business data stream as a token in the place. A directed arc is used to connect each place and its corresponding transition to obtain a Virtual Network Function Forwarding Graph (VNF-FG). The VNF-FG also includes network shared resource places; each place contains any number of tokens. The latency parameter is associated with each transition in the VNF-FG to obtain a latency Petri net model corresponding to the VNF-FG. In this way, the virtualized network resources of the multi-service multiplexing network can be utilized. The problem of network resource sharing contention under conditions of limited network resources is transformed into deadlock analysis of a latency Petri net model. Then, by analyzing the constructed latency Petri net model and identifying deadlocks in the analysis results, a pre-defined deadlock avoidance strategy is used to update the model, resulting in a deadlock-free latency Petri net model. Finally, based on the deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined. This avoids competition for shared network resources among different services, thereby ensuring the reachability of each service in concurrent multi-service scenarios.

[0088] Please see Figure 6 , Figure 6 This is a flowchart illustrating another concurrent service processing method based on a time-delay Petri net provided in this application embodiment. Figure 4 Compared to the concurrent service processing method based on time-delay Petri nets shown, Figure 6 The method illustrated specifically demonstrates how computer equipment analyzes the latency Petri net model to obtain multiple analytical results for concurrent multi-service processing flows. For example... Figure 6 As shown, the concurrent service processing method based on time-delay Petri nets may include, but is not limited to, the following steps:

[0089] S601. For concurrent multiple services, determine the business process for each service.

[0090] S602. Take each sub-service in the business process corresponding to multiple services as a place, take the triggering event corresponding to each sub-service as a transition, take the business data flow as a token in the place, and use directed arcs to connect each place and the transition corresponding to that place to obtain the Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG); wherein, the VNF-FG also includes network shared resource places.

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

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

[0093] S604. Based on the reachability marking tree generation algorithm, generate the reachability marking tree corresponding to the time-delay Petri net model.

[0094] Among them, the reachable marking tree generation algorithm is an important method for analyzing the dynamic behavior of time-delay Petri net models. The reachable marking tree generated by the reachable marking tree generation algorithm (with R(M) as its core) is a key component of the model. i A directed tree consisting of a set of nodes and arcs representing the direct reachability relationships between identifiers can well describe the relationship between identifiers and transitions in a time-delay Petri net model.

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

[0096] like Figure 7 As shown in Table 2, starting from the initial identifier M0, the computer device determines the state corresponding to each node identifier in the reachable marking tree. The last column of Table 2 represents the transitions occurring for each node identifier.

[0097] Table 2. All Marker Status Tables for Reachable Marking Trees

[0098]

[0099] As shown in Table 2 above, M i It is a binary tuple M i =(m i ,u i ), where m i (p-marking) refers to the node identifiers of the prototype Petri net, u i (t-marking) is an identifier for the transition delay parameter.

[0100] S605. Determine whether there is an unreachable path in the reachable marking tree. If yes, proceed to steps S606, S607, and S610; otherwise, proceed to steps S608 to S610.

[0101] For example, following the example above, by Figure 7 It can be seen that both electricity information collection business data streams can complete the business process, that is, there exists a transition sequence σ such that M0 to M7 is reachable (i.e., M0[σ>M7). Optionally, the transition sequence σ can be determined by computer equipment through the following steps.

[0102] Step 1: Analyze the state equations Solve for X in the given information to obtain X.

[0103] In the above state equations, 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,2),(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 - A can be expressed as formulas (1) to (3) respectively.

[0104] (1)

[0105] (2)

[0106] (3)

[0107] Step 2: Determine the transition 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), This indicates an intermediate state where the transition has been triggered but the time consumption delay has not yet been met. The arrow indicates the transition that occurred and the corresponding time delay parameters.

[0111] However, Figure 7 There are also some nodes in the process where the transition between node identifiers becomes unreachable, such as M. 18 When the node identifier changes to M7 18 When this happens, the system stops running, preventing the business process from reaching M7. In this case, the computer equipment can determine M... 18 The deadlock node is identified; thus, the computer device can determine that a deadlock exists in multiple analysis results of the processing flow for two concurrent electricity information collection services. Therefore, there is an unreachable path in the reachability marking tree, in which case the computer device can execute the following steps S606 and S607.

[0112] S606. A deadlock was found in multiple analysis results for the concurrent multi-service processing flow.

[0113] S607. Using a preset deadlock avoidance strategy, update the time-delay Petri net model to obtain a deadlock-free time-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, such as Figure 7 As shown, the deadlock node identifier set DM={M 18 In this case, the computer equipment can determine that the preset deadlock avoidance strategy is to add a controller to the time-delayed Petri net model. The idea behind this strategy is to construct place constraints, namely, that the sum of the number of places with deadlock indicators in a deadlock state must be less than the total number of deadlock indicators. This corresponds to the constraint transitions of the place constraints not occurring simultaneously, using the idea of ​​place invariants to avoid deadlock. The deadlock-free time-delayed Petri net model obtained according to this strategy can be found in [reference needed]. Figure 8 , Figure 8 This is a deadlock-free, time-delay Petri net model provided in the embodiments of this application.

[0116] S608. Determine that there is no deadlock among the multiple analysis results for the concurrent multi-service processing flow.

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

[0118] S610, based on a deadlock-free latency Petri net model, determines the processing flow for concurrent multi-services.

[0119] In an optional implementation, the relevant description of step S610 can be found in the description of step S406 above, and will not be repeated here.

[0120] In this embodiment, the computer device can generate a reachability marking tree corresponding to the latency Petri net model based on a reachability marking tree generation algorithm. Then, if it is determined that there are unreachable paths in the reachability marking tree, and deadlocks exist in multiple analysis results for the concurrent multi-service processing flow, the computer device can update the latency Petri net model using a preset deadlock avoidance strategy to obtain a deadlock-free latency Petri net model. If it is determined that there are no unreachable paths in the reachability marking tree, and deadlocks do not exist in the multiple analysis results for the concurrent multi-service processing flow, the computer device can determine that the latency Petri net model is a deadlock-free latency Petri net model. Finally, based on the deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined. This avoids competition for shared network resources among different services, thereby ensuring the reachability of each service in concurrent multi-service processing.

[0121] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0122] Based on the same inventive concept, this application also provides a time-delay Petri net-based concurrent service processing apparatus for implementing the aforementioned time-delay Petri net-based concurrent service processing method. The solution provided by this apparatus is similar to the implementation scheme described in the above method. Therefore, the specific limitations in one or more time-delay Petri net-based concurrent service processing apparatus embodiments provided below can be found in the limitations of the time-delay Petri net-based concurrent service processing method described above, and will not be repeated here.

[0123] Please see Figure 9 , Figure 9 This is a schematic diagram of the structure of a concurrent service processing device based on a time-delay Petri net, provided in an embodiment of this application. Figure 9 As shown, the concurrent service processing device based on time-delay Petri nets may include, but is not limited to:

[0124] Module 901 is used to determine the business process of each service in the context of concurrent multiple services.

[0125] Module 902 is used to construct a latency Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) based on the business processes corresponding to multiple services. The latency Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The latency Petri net model includes the network shared resource library.

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

[0127] Update module 904 is used to update the time-delay Petri net model using a preset deadlock avoidance strategy when deadlock is found in multiple analysis results, so as to obtain a deadlock-free time-delay Petri net model.

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

[0129] In one embodiment, when constructing a latency Petri net model corresponding to a Virtual Network Function Forwarding Graph (VNF-FG) based on the business processes corresponding to multiple services, the construction module 902 specifically performs the following steps: treating each sub-service in the business processes corresponding to multiple services as a place, the triggering event corresponding to each sub-service as a transition, and the business data stream as a token in the place; connecting each place with its corresponding transition using directed arcs to obtain the Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG); wherein, the VNF-FG also includes network shared resource places; each place includes any number of tokens; and associating latency parameters with each transition in the Petri net model corresponding to the VNF-FG to obtain the latency Petri net model corresponding to the VNF-FG.

[0130] In one embodiment, when the analysis module 903 analyzes the latency Petri net model to obtain multiple analysis results for the processing flow of concurrent multi-services, it specifically performs the following: generates a reachable marking tree corresponding to the latency Petri net model based on a reachable marking tree generation algorithm; analyzes 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 analyzes the reachability marking tree to obtain multiple analysis results for the concurrent multi-service processing flow, it is specifically used to: determine whether there is an unreachable path in the reachability marking tree; and if it is determined that there is an unreachable path in the reachability marking tree, determine that there is a deadlock in the multiple analysis results for the concurrent multi-service processing flow.

[0132] In one embodiment, the determining module 901 is further configured to determine that there is no deadlock among the multiple analysis results of the concurrent multi-service processing flow if there is no unreachable path in the reachable marking tree; the determining module 901 is further configured to determine that the delay Petri net model is a deadlock-free delay Petri net model if there is no deadlock among the multiple analysis results.

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

[0134] Each module in the aforementioned concurrent service processing device based on time-delay Petri nets can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in the processor of the terminal device in hardware form or independent of it, or stored in the memory of the terminal device in software form, so that the processor can call and execute the operations corresponding to each module.

[0135] In one exemplary embodiment, this application provides a computer device, which may be a terminal, and its internal structure diagram may be as follows. Figure 10 As shown, the computer device includes a processor, memory, input / output interfaces, a communication interface, a display unit, and an input device. The processor, memory, and input / output interfaces are connected via a system bus, and the communication interface, display unit, and input device are also connected to the system bus via the input / output interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The input / output interfaces are used for exchanging information between the processor and external devices. The communication interface is used for wired or wireless communication with external terminals; wireless communication can be achieved through Wi-Fi, mobile cellular networks, Near Field Communication (NFC), or other technologies. When the computer program is executed by the processor, it implements a concurrent service processing method based on a time-delay Petri net.

[0136] Those skilled in the art will understand that Figure 10 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0137] In one exemplary embodiment, this application provides a computer device including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to perform the following steps:

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

[0139] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0140] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0141] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0142] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0143] In one embodiment, when a processor executes a computer program to construct a latency Petri net model corresponding to a Virtual Network Function Forwarding Graph (VNF-FG) based on the service processes corresponding to multiple services, the specific steps are as follows: Each sub-service in the service processes corresponding to multiple services is treated as a place, the triggering event corresponding to each sub-service is treated as a transition, and the service data stream is treated as a token in the place. Directed arcs are used to connect each place and its corresponding transition to obtain the Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG). The VNF-FG also includes network shared resource places; each place contains any number of tokens; latency parameters are associated with each transition in the Petri net model corresponding to the VNF-FG to obtain the latency Petri net model corresponding to the VNF-FG.

[0144] In one embodiment, when the processor executes a computer program to analyze the latency Petri net model and obtain multiple analysis results for the processing flow of concurrent multi-services, the specific steps are as follows: based on the reachability marking tree generation algorithm, generate the reachability marking tree corresponding to the latency Petri net model; analyze the reachability marking tree to obtain multiple analysis results for the processing flow of concurrent multi-services.

[0145] In one embodiment, when the processor executes a computer program to analyze the reachability marking tree and obtain multiple analysis results for the concurrent multi-service processing flow, the following steps are specifically implemented: determining whether there is an unreachable path in the reachability marking tree; and if it is determined that there is an unreachable path in the reachability marking tree, determining that there is a deadlock among the multiple analysis results for the concurrent multi-service processing flow.

[0146] In one embodiment, when the processor executes the computer program, it further performs the following steps: if it is determined that there is no unreachable path in the reachable marking tree, it determines that there is no deadlock among the multiple analysis results for the concurrent multi-service processing flow; when the processor executes the computer program, it further performs the following steps: if it is determined that there is no deadlock among the multiple analysis results, it determines that the delay Petri net model is a deadlock-free delay Petri net model.

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

[0148] In one exemplary embodiment, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the following steps:

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

[0150] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0151] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0152] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0153] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0154] In one embodiment, when a computer program is executed by a processor to implement a latency Petri net model corresponding to a Virtual Network Function Forwarding Graph (VNF-FG) based on the business processes corresponding to multiple services, the specific steps are as follows: Each sub-service in the business processes corresponding to the multiple services is treated as a place, the triggering event corresponding to each sub-service is treated as a transition, and the business data stream is treated as a token in the place. Directed arcs are used to connect each place and its corresponding transition to obtain the Petri net model corresponding to the VNF-FG. The VNF-FG also includes network shared resource places; each place contains any number of tokens; latency parameters are associated with each transition in the Petri net model corresponding to the VNF-FG to obtain the latency Petri net model corresponding to the VNF-FG.

[0155] In one embodiment, when a computer program is executed by a processor to analyze a latency Petri net model and obtain multiple analysis results for a concurrent multi-service processing flow, the specific steps are as follows: generating a reachability marking tree corresponding to the latency Petri net model based on a reachability marking tree generation algorithm; analyzing the reachability marking tree to obtain multiple analysis results for a concurrent multi-service processing flow.

[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 concurrent multi-service processing flow, the following steps are specifically implemented: determining whether there is an unreachable path in the reachable marking tree; and if it is determined that there is an unreachable path in the reachable marking tree, determining that there is a deadlock among the multiple analysis results for the concurrent multi-service processing flow.

[0157] In one embodiment, when the computer program is executed by the processor, it further performs the following steps: if it is determined that there is no unreachable path in the reachable marking tree, it determines that there is no deadlock among the multiple analysis results for the concurrent multi-service processing flow; when the computer program is executed by the processor, it further performs the following steps: if it is determined that there is no deadlock among the multiple analysis results, it determines that the delay Petri net model is a deadlock-free delay Petri net model.

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

[0159] In one exemplary embodiment, this application provides a computer program product including a computer program that, when executed by a processor, performs the following steps:

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

[0161] Based on the business processes corresponding to multiple services, a time-delay Petri net model corresponding to the Virtual Network Function Forwarding Diagram (VNF-FG) is constructed. The time-delay Petri net model is used to describe the transmission characteristics of the business processes in the VNF-FG and the time characteristics of each node. The time-delay Petri net model includes the network shared resource library.

[0162] The latency Petri net model was analyzed, and several analytical results were obtained for the processing flow of concurrent multi-services.

[0163] If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model.

[0164] Based on a deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined.

[0165] In one embodiment, when a computer program is executed by a processor to implement a latency Petri net model corresponding to a Virtual Network Function Forwarding Graph (VNF-FG) based on the business processes corresponding to multiple services, the specific steps are as follows: Each sub-service in the business processes corresponding to the multiple services is treated as a place, the triggering event corresponding to each sub-service is treated as a transition, and the business data stream is treated as a token in the place. Directed arcs are used to connect each place and its corresponding transition to obtain the Virtual Network Function Forwarding Graph (VNF-FG). The VNF-FG also includes network shared resource places; each place contains any number of tokens; latency parameters are associated with each transition in the Petri net model corresponding to the VNF-FG to obtain the latency Petri net model corresponding to the VNF-FG.

[0166] In one embodiment, when a computer program is executed by a processor to analyze a latency Petri net model and obtain multiple analysis results for a concurrent multi-service processing flow, the specific steps are as follows: generating a reachability marking tree corresponding to the latency Petri net model based on a reachability marking tree generation algorithm; analyzing the reachability marking tree to obtain multiple analysis results for a concurrent multi-service processing flow.

[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 concurrent multi-service processing flow, the following steps are specifically implemented: determining whether there is an unreachable path in the reachable marking tree; and if it is determined that there is an unreachable path in the reachable marking tree, determining that there is a deadlock among the multiple analysis results for the concurrent multi-service processing flow.

[0168] In one embodiment, when the computer program is executed by the processor, it further performs the following steps: if it is determined that there is no unreachable path in the reachable marking tree, it determines that there is no deadlock among the multiple analysis results for the concurrent multi-service processing flow; when the computer program is executed by the processor, it further performs the following steps: if it is determined that there is no deadlock among the multiple analysis results, it determines that the delay Petri net model is a deadlock-free delay Petri net model.

[0169] In one embodiment, when the computer program is executed by the processor, it further performs the following steps: determining a set of deadlock node identifiers in the 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 the relevant data must comply with relevant regulations.

[0171] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this 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. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0172] The technical features of the above embodiments can be combined in any way. For the sake of brevity, 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 embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A concurrent service processing method based on time-delay Petri nets, characterized in that, The method includes: For concurrent multiple services, determine the business process for each of the services; Based on the service processes corresponding to the various services, a latency Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG) is constructed. This latency Petri net model describes the transmission characteristics of the service processes within the VNF-FG and the time characteristics of each node. The latency Petri net model includes network shared resource pools and time parameters. The time parameters describe the latency characteristics of VNF nodes completing instantiation and processing. The shared resource pools characterize the competition for shared virtual network function resources among the sub-services in each service process. The latency Petri net model is analyzed to obtain multiple analysis results for the concurrent multi-service processing flow; If deadlock is found in multiple analysis results, the time-delay Petri net model is updated using a preset deadlock avoidance strategy to obtain a deadlock-free time-delay Petri net model. The preset deadlock avoidance strategy is to add a controller to the time-delay Petri net model. The controller avoids simultaneous transitions by constructing place constraints. The place constraints are that the sum of the number of tokens in the places with deadlock flags in the deadlock flag state is less than the total number of deadlock flags. Based on the deadlock-free latency Petri net model, the processing flow for concurrent multi-services is determined. The step of constructing a latency Petri net model corresponding to a Virtual Network Function Forwarding Graph (VNF-FG) based on the service processes corresponding to the multiple services includes: Each sub-service in the business process corresponding to the multiple services is taken as a place, the triggering event corresponding to each sub-service is taken as a transition, and the business data flow is taken as a token in the place. Directed arcs are used to connect each place and the transition corresponding to that place to obtain the Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG). The Petri net model corresponding to the VNF-FG also includes a network shared resource place. Each place includes any number of tokens. By associating the time delay parameter with each transition in the Petri net model corresponding to the VNF-FG, the time delay Petri net model corresponding to the VNF-FG is obtained.

2. The method according to claim 1, characterized in that, The analysis of the latency Petri net model yields multiple analysis results for the concurrent multi-service processing flow, including: Based on the reachability marking tree generation algorithm, the reachability marking tree corresponding to the time-delay Petri net model is generated; The reachability marking tree is analyzed to obtain multiple analysis results for the concurrent multi-service processing flow.

3. The method according to claim 2, characterized in that, The analysis of the reachability marking tree yields multiple analysis results for the concurrent multi-service processing flow, including: Determine whether there is an unreachable path in the reachable marking tree; If an unreachable path is determined to exist in the reachable marking tree, a deadlock is determined to exist in multiple analysis results for the concurrent multi-service processing flow.

4. The method according to claim 3, characterized in that, The method further includes: If it is determined that there are no unreachable paths in the reachable marking tree, it is determined that there is no deadlock in the multiple analysis results of the concurrent multi-service processing flow; The method further includes: If no deadlock is found in any of the analysis results, the time-delay Petri net model is determined to be the deadlock-free time-delay Petri net model.

5. The method according to claim 3, characterized in that, The method further includes: Determine the set of deadlock node identifiers in the reachable marking tree; Based on the set of deadlock node identifiers, the preset deadlock avoidance strategy is determined.

6. A concurrent service processing device based on a time-delay Petri net, characterized in that, The device includes: The determination module is used to determine the business process of each of the concurrent multiple services; A construction module is used to construct a latency Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG) based on the service processes corresponding to the multiple services. The latency Petri net model is used to describe the transmission characteristics of the service processes in the VNF-FG and the time characteristics of each node. The latency Petri net model includes network shared resource pools and time parameters. The time parameters are used to describe the latency characteristics of VNF nodes completing instantiation and processing. The shared resource pools are used to characterize the competition of sub-services in each service process for shared virtual network function resources. The analysis module is used to analyze the latency Petri net model and obtain multiple analysis results for the concurrent multi-service processing flow. The update module is used to update the time-delayed Petri net model using a preset deadlock avoidance strategy when deadlock is found in multiple analysis results, so as to obtain a deadlock-free time-delayed Petri net model. The preset deadlock avoidance strategy is to add a controller to the time-delayed Petri net model. The controller avoids simultaneous transitions by constructing place constraints. The place constraints are that the sum of the number of tokens in the places with deadlock indicators in the deadlock indicator state is less than the total number of deadlock indicators. The determining module is also used to determine the processing flow of the concurrent multi-service based on the deadlock-free latency Petri net model; Specifically, when the construction module is used to construct the latency Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG) based on the service processes corresponding to the multiple services, it is used for: Each sub-service in the business process corresponding to the multiple services is taken as a place, the triggering event corresponding to each sub-service is taken as a transition, and the business data flow is taken as a token in the place. Directed arcs are used to connect each place and the transition corresponding to that place to obtain the Petri net model corresponding to the Virtual Network Function Forwarding Graph (VNF-FG). The Petri net model corresponding to the VNF-FG also includes a network shared resource place. Each place includes any number of tokens. By associating the time delay parameter with each transition in the Petri net model corresponding to the VNF-FG, the time delay Petri net model corresponding to the VNF-FG is obtained.

7. The apparatus according to claim 6, characterized in that, When the analysis module (903) analyzes the latency Petri net model to obtain multiple analysis results for the concurrent multi-service processing flow, it is specifically used for: Based on the reachability marking tree generation algorithm, the reachability marking tree corresponding to the time-delay Petri net model is generated; The reachability marking tree is analyzed to obtain multiple analysis results for the concurrent multi-service processing flow.

8. A computer device, characterized in that, The method includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the steps of the method according to any one of claims 1 to 5.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method as described in any one of claims 1 to 5.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method as described in any one of claims 1 to 5.

Images