Data redundancy error detection method and system in cyber-physical system based on Petri-Net

By mapping the information physics system into Petri-Net with data and applying the merge process optimization and α deletion rules, the problem of state space explosion and detection efficiency in the Petri-Net method is solved, and efficient data redundancy error detection is achieved. Verify the correctness of the system design.

CN118368223BActive Publication Date: 2024-11-01YANGZHOU UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410318137.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-20
Publication Date
2024-11-01
Estimated Expiration
2044-03-20

AI Technical Summary

Technical Problem

The existing Petri-Net method is prone to state space explosion problems when detecting data redundant errors in information physics systems, and has complex analysis structure and low detection efficiency.

Method used

By mapping the information physics system into Petri-Net with data, using merge process optimization and α deletion rules, we can judge whether the event is a redundant event, and calculate the data adjacent events, output the event set of data redundant errors, reducing the complexity of the model And improve detection efficiency.

Benefits of technology

It alleviates the problem of state space explosion, improves the efficiency of data redundancy error detection, can fully detect data flow errors in the information physics system, verifies the correctness of the system design, and proves the superiority and effectiveness of the method through experiments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118368223B_ABST
    Figure CN118368223B_ABST
Patent Text Reader

Abstract

The present invention discloses a method and system for detecting data redundancy errors in a Petri‑Net-based cyber-physical system. The method first maps the cyber-physical system into a Petri‑Net with data and generates a merging process; secondly, optimizes the events and conditions in the merging process according to deletion rules to obtain an optimized merging process; in the optimized merging process, it is determined whether each event is a redundant event; and finally, an event set of data redundancy errors is output. The present invention optimizes the merging process by deleting rules, thereby reducing the complexity of the model; and designs a data redundancy error detection algorithm, which can detect data redundancy errors in the data stream of the cyber-physical system to verify the design correctness of the cyber-physical system.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of Petri-Net data anomaly detection, in particular to a data redundancy error detection method and system in an information-physical system. Background Art

[0002] Cyber-physical system (CPS) is a system that closely integrates physical devices and network computing. It can realize real-time perception and control of physical entities and improve the efficiency and safety of the system. At present, CPS has been widely used in various fields, such as smart home, smart transportation and medical services. However, with the increase of distributed sensors and concurrent business units, the business process of CPS has become more and more complex. Therefore, how to ensure the correctness of CPS design, that is, whether CPS can run according to its design goals and requirements without errors or abnormalities, has become a hot research topic in industry and academia.

[0003] Business Process Modeling Notation (BPMN) is a standardized notation for business processes and is widely used for modeling the control flow and data flow of CPS. However, due to the lack of formal methods, it is difficult to verify the design correctness of CPS, especially in its data flow. At present, there are mainly test-based methods and model-based methods in the research on detecting data errors in CPS data flow. The Petri-Net-based method is a model-based method, which usually uses a reachability graph (RG) or a state transition diagram to check data redundancy errors, such as systematically traversing a given workflow to detect its data flow errors; converting BPMN into a Petri-Net net and detecting data redundancy errors based on computation tree logic (CTL); using Petri-Net with data operations (PN-DO) to detect data redundancy errors in workflow systems, etc. However, the existing methods are prone to the problem of state space explosion, and their analysis structure is relatively complex, and the detection efficiency is low. Summary of the invention

[0004] Purpose of the invention: The purpose of the present invention is to provide a method and system for detecting data redundancy errors in a Petri-Net-based information-physical system with low model complexity and high detection efficiency.

[0005] Technical solution: The Petri-Net-based cyber-physical system data redundancy error detection method of the present invention comprises the following steps:

[0006] Mapping the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data;

[0007] Generate the merging process μ=(B, E, G, D, Rd, Wr, De) of the first Petri net; wherein B is a condition set, E is an event set, G is an arc set, D is a data element set, Rd is a read annotation function, Wr is a write annotation function, and De is a delete annotation function;

[0008] Optimize the events and conditions in the merging process μ according to the deletion rule to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′);

[0009] In the optimization merging process μ′, it is determined whether each event is a redundant event, and a set of events with data redundancy errors is output;

[0010] The optimized merging process μ′ is subjected to synonymous data operation to calculate data neighboring events; the synonymous data operation is that given an event e is a deletion annotation function or an end annotation function about a data item d, that is, (e, De: d or e, End: d), if there are two events belonging to [e] + For concurrent events e1 and e2, and d∈Wr(e1)∪Rd(e1), add the same data operation label, that is, (e1,Wr:d or e1,Rd:d), from e1 to e2, where [e] + ={e′∈E|e′≤e}; the data neighboring event is given two events e1 and e2 satisfying the data d∈Rd(e1)∪Wr(e1)∪De(e1). If e1<e2, then there is obviously a path from e1 to e2. If there is an event e′ on this path satisfying or e1 · = · e2, then e1 is called the data neighboring event of e2;

[0011] The method to determine whether each event e is a redundant event is:

[0012] Determine whether event e belongs to the De or End marking function of data element d. If so, in the weak local configuration [e] of event e + Calculate the data neighbor set S(e,d) of event e with respect to data element d, where [e] + ={e′∈E|e′≤e}; if there exists an event e′ in S(e,d) that is a Wr marking function belonging to the data element d, then the event e is added to the event set E_redu where data redundancy errors occur.

[0013] Further, the mapping of the information-physical system to a first Petri net, the information-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data, including: mapping the information-physical system to a first Petri net according to data objects and states in the information-physical system, and modeling the first Petri net; the first Petri net is a network N with data initially marked as m0 D , recorded as Σ=(N D ,m0),N D =(P, T, F, D, Read, Write, Delete), which satisfies (P, T, F) is a net, P is a place, T is a transition, F is a flow relation, and Read, Write, Delete are the read annotation function, write annotation function, and delete annotation function in the first Petri net respectively.

[0014] Further, the information-physical system is mapped into a first Petri net, the information-physical system is modeled using a business process modeling representation, the first Petri net is a Petri net with data, and includes: a merging process μ=Merge(β), and a method for generating the merging process μ is:

[0015] Merge all beta-conflict conditions with the same label and occurrence depth into one condition;

[0016] All β events with the same label, i.e., the pre-set and the post-set, are merged into one event;

[0017] All relevant arcs of β need to be redirected according to the conditions and events of the merger;

[0018] Here, β is the branching process of the first Petri net.

[0019] Furthermore, the mapping of the cyber-physical system into a first Petri net, the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data and includes:

[0020] Mapping the exclusive gateways of the business process modeling notation to the conflict structure of the first Petri net;

[0021] Mapping the parallel gateways of the business process modeling notation to the concurrent structure of the first Petri net;

[0022] Mapping activities into transitions and their pre-places or post-places;

[0023] Mapping the input and output of a data object or database to labeled functions that read and write data elements in a transition;

[0024] Mapping external inputs to tag functions that write data elements in transitions;

[0025] Map the message flow between activities to a place and its before or after transitions;

[0026] Other connection objects are mapped as arcs between related places and transitions.

[0027] Furthermore, the process of optimizing the events and conditions in the merging process μ according to the deletion rule to obtain a new merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′) includes:

[0028] Transform the merge process μ into the target interactive merge process μ λ =(B,E,G,D,Rd,Wr,De,λ,M), where λ is a marking function used to mark the type of the current event, M:B→{0,1,2,3,…} is an identifier of the network; marking function λ:E→L∪{α}, L={!,?,@}×D, including empty mark α, write!, read?, delete@;

[0029] In the interactive merging process of the target μ λ In , events and conditions are deleted according to the deletion rules to obtain the optimized merging process μ′.

[0030] Further, the optimizing the events and conditions in the merging process μ according to the deletion rule to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′) includes:

[0031] Delete rule 1:

[0032] ,like( · e) · ={e}, then the event e can be deleted, where:

[0033] B′=B- · e;

[0034] E′=E-{e};

[0035] G′=F-{(x,e)|x∈ · e}-{(e,y)|y∈e ·}-{(x,y)|x∈ · ( · e)∧y∈( · e)}∪{(x,y)|x∈ · ( · e)∧y∈e ·};

[0036] D′=D;

[0037] Rd′=Rd;

[0038] Wr′=Wr;

[0039] De′=De;

[0040] λ′=λ-{(e,α)};

[0041] If x∈ · e∧M(x)==0, then M′=M; if ,but

[0042] Delete rule 2:

[0043] ,like · e1= · e2…= · e n ∧e1 · =e2 · =…=e n · , then these n e1,e2,…,e n can all be deleted, and the new MP is μ′=(B′,E′,G′,D′,Rd′,Wr′,De′,λ′,M′), where:

[0044] B′=B- · e1;

[0045] E′=E-( · e1) · ;

[0046] G′=G-{(x,y)|x∈ · e1∧y∈( · e1) ·}-{(x,y)|x∈( · e1) · ∧y∈e1 ·}-{(x,y)|x∈ · ( · e1)∧y∈( · e1)}∪{(x,y)|x∈ · ( · e1)∧y∈e1 ·};

[0047] D′=D;

[0048] Rd′=Rd;

[0049] Wr′=Wr;

[0050] De′=De;

[0051] λ′=λ-{(e1,α)}-{(e2,α)}…-{(e n ,α)};

[0052] If x∈ · e i ∧M(x)==0, then M′=M; if ,but Where i ranges from 1 to n;

[0053] Delete rule 3:

[0054] ,like · e1= · e2=…= · e n = · e∧e1 · =e2 · =…=e n · =e · ,but( · e1) · All α in can be deleted, but e event cannot be deleted. An α is added to keep the conflict structure in the deletion rule, where:

[0055] B′=B;

[0056] E′=E-{x|x∈( · e1) · ∧λ(x)=α}∪{e n+1};

[0057] G′=G-{(x,y)|x∈ · e1∧y∈( · e1) · ∧λ(y)=α}-{(x,y)|x∈( · e1) · ∧y∈e1 · ∧λ(x)=α}∪{(x,α)|x∈ · e1}∪{(α,y)|y∈e1 ·};

[0058] D′=D;

[0059] Rd′=Rd;

[0060] Wr′=Wr;

[0061] De′=De;

[0062] λ′=λ;

[0063] M′=M.

[0064] Furthermore, the method of optimizing the events and conditions in the merging process μ according to the deletion rules to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′) includes: performing correctness analysis on the deletion rules, using weak mutual simulation as a criterion for verifying whether the behaviors are consistent, and reducing the problem of verifying whether the source merging process and the target interactive merging process maintain behavioral consistency to the problem of verifying whether the source merging process and the target interactive merging process satisfy weak mutual simulation.

[0065] Furthermore, in the optimization merging process μ′, determining whether each event is a redundant event and outputting a set of events with data redundancy errors includes:

[0066] Before determining whether each event is a redundant event in the optimization merging process μ′, the optimization merging process μ′ is initialized; the initialization includes:

[0067] Add condition b′0 and event e′0 before the start condition of the optimization merging process μ′, and add condition b′ and event e′ after the end condition. The subscripts of b′ and e′ are the maximum subscript i of the conditions and events in μ′ plus one.

[0068] In the optimization merging process μ′, the flow relations {b′0}×{e′0}, {e′0}×{b0}, {b′ i}×{e′} and {e′}×{b′};

[0069] Mark e′0 as the operation of deleting all data, that is, De(e′0)=D; mark e′ as the end operation, that is, End(e′)=D, End is the end marking function, End:E→2 D .

[0070] The Petri-Net-based cyber-physical system data redundancy error detection system of the present invention comprises:

[0071] A Petri net mapping unit, configured to map the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data;

[0072] A merging process generating unit, used for generating a merging process μ=(B, E, G, D, Rd, Wr, De) of the first Petri net; wherein B is a condition set, E is an event set, G is an arc set, D is a data element set, Rd is a read annotation function, Wr is a write annotation function, and De is a delete annotation function;

[0073] A merging process optimization unit, used for optimizing the events and conditions in the merging process μ according to the deletion rule to obtain an optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′);

[0074] A redundant error detection unit, used to determine whether each event is a redundant event in the optimization merging process μ″, and output a set of events with data redundant errors;

[0075] In the redundant error detection unit, the optimized merging process μ′ is subjected to a synonymous data operation to calculate data neighboring events; the synonymous data operation is that given an event e is a deletion annotation function or an end annotation function about a data item d, that is, (e, De: d or e, End: d), if there are two events belonging to [e] + If there are concurrent events e1 and e2, and d∈Wr(e1)∪Rd(e1), then add the same data operation label, that is, (e1,Wr:d or e1,Rd:d), that is, (e1,Rd:d), from e1 to e2, where [e] + ={e′∈E|e′≤e}; the data neighboring event is given two events e1 and e2 satisfying the data d∈Rd(e1)∪Wr(e1)∪De(e1). If e1<e2, then there is obviously a path from e1 to e2. If there is an event e′ on this path satisfying or e1 · = · e2, then e1 is called the data neighboring event of e2;

[0076] The method to determine whether each event e is a redundant event is:

[0077] Determine whether event e belongs to the De or End marking function of data element d. If so, in the weak local configuration [e] of event e + Calculate the data neighbor set S(e,d) of event e with respect to data element d, where [e] + ={e′∈E|e′≤e}; if there exists an event e′ in S(e,d) that is a Wr marking function belonging to the data element d, then the event e is added to the event set E_redu where data redundancy errors occur.

[0078] The computer-readable storage medium described in the present invention stores a computer program, and is characterized in that when the computer program is executed by a processor, it implements the Petri-Net-based information-physical system data redundancy error detection method.

[0079] Beneficial effects: Compared with the prior art, the advantages of the present invention are: (1) The present invention uses the Petri-Net expansion technology and the structural analysis method to detect data redundancy errors, which alleviates the problem of state space explosion caused by using reachable graphs or state transition graphs for detection; at the same time, it solves the problem that the state space of the reachable graph is incomplete after a data flow error occurs, thereby failing to detect all data redundancy errors. (2) A data redundancy error detection algorithm is designed. For an event e that belongs to the De or End marking function of a data element d, it is searched in its data neighborhood set whether there is an event e′ that is a Wr marking function belonging to the data element d. Through the above steps, data redundancy errors in the data flow of the information-physical system can be detected to verify the design correctness of the information-physical system; at the same time, the superiority and effectiveness of the present invention are proved by experimental comparison; (3) An α deletion rule is designed and the correctness of the α deletion rule is analyzed. By combining the α deletion rule with the merging process, a large number of irrelevant control flow conditions and events are reduced. Under the premise of ensuring behavioral consistency, the complexity of the model is reduced, and the efficiency of the data redundancy error detection algorithm is greatly improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0080] Figure 1 This is a BPMN schematic diagram of an embodiment of the present invention;

[0081] Figure 2 A flow chart of a data redundancy error detection method according to an embodiment of the present invention;

[0082] Figure 3 A mapping relationship diagram between BPMN and PD-Net according to an embodiment of the present invention;

[0083] Figure 4 It is a diagram and a reachable graph of α deletion rule 1 according to an embodiment of the present invention;

[0084] Figure 5 It is a diagram and a reachable graph of α deletion rule 2 of an embodiment of the present invention;

[0085] Figure 6 1 is a diagram and a reachable graph of α deletion rule 3 according to an embodiment of the present invention. DETAILED DESCRIPTION

[0086] The technical solution of the present invention is further described below in conjunction with the accompanying drawings.

[0087] See also Figure 1 and Figure 2 A healthcare cyber-physical system (HCPS) modeled using BPMN is used to perform data redundancy error detection on the HCPS using the present invention, including the following steps:

[0088] S1. Map the HCPS modeled using BPMN into a Petri-Net with data (PD-Net) according to the mapping relationship.

[0089] Considering the data objects and their states, BPMN is converted into PD-Net, and the PD-Net generated by the mapping is modeled on the computer using a modeling tool. Among them, PD-Net is a network (D-net) with data initially marked as m0. D , recorded as ∑=(N D ,m0). A D-net is a 7-tuple N D =(P,T,F,D,Read,Write,Delete), satisfying (P,T,F) is a network; D is a finite set of data elements; Read: T→2 D It is the annotation function for reading data; Write: T→2 D It is the annotation function for writing data; Delete:T→2 D It is the annotation function to delete data.

[0090] like Figure 3 As shown in the figure, the mapping from BPMN to PD-Net is as follows: the exclusive gateway of BPMN is mapped to the conflict structure of PD-Net; the parallel gateway of BPMN is mapped to the concurrent structure of PD-Net; the activities are mapped to transitions and their previous / after places; the input and output of data objects / databases are mapped to the marking functions for reading and writing data elements in transitions; the external input is mapped to the marking function for writing data elements in transitions; the message flow between activities is mapped to a place and its previous / after transitions; other connection objects are mapped to arcs between some related places and transitions.

[0091] S2. Generate the merging process of PD-Net according to the rules.

[0092] A merge process (MP) μ = (B, E, G, D, Rd, Wr, De), for this formalization, is to map the library P, change T, flow relation F, data element set D, and annotation functions Read, Write, and Delete to conditions B, events E, arcs G, data element set D, and annotation functions Rd, Wr, and De respectively. The specific rules are as follows: Let β be a branching process of PD-Net (N, m0), represented by μ = Merge (β), which can be obtained by the following steps:

[0093] (1) All β-conflict conditions with the same label and occurrence depth are merged into one condition.

[0094] (2) All β events with the same label, i.e., the front set and the back set, are merged into one event.

[0095] (3) All relevant arcs of β need to be redirected according to the conditions and events of the merger.

[0096] The branching process is a finite or infinite labeled acyclic network, which can be obtained by continuously triggering transitions and expanding the PD-Net under the following assumptions:

[0097] (1) Start with a set of places (called conditions), each of which corresponds to a label of the initial label;

[0098] (2) For each new trigger, a new transition (called an event) is generated;

[0099] (3) A new place (also called condition) is generated for each newly generated token. Each event / condition is marked by a corresponding transition / condition.

[0100] If x is one of the nodes (conditions or events) of β, then the occurrence depth of x is defined as the maximum number of labeled nodes on any directed path starting from the initial condition and ending at x in the directed graph representing β.

[0101] Finally, the merging process of PD-Net is obtained μ=(B, E, G, D, Rd, Wr, De).

[0102] S3. Formulate the α deletion rule to optimize the generated merge process and give the correctness analysis of the α deletion rule.

[0103] The α deletion rule is to transform the merging process into an interactive MP, and then optimize it to obtain the optimized merging process μ′, expressed as μ λ =(B,E,G,D,Rd,Wr,De,λ,M), where the marking function λ:E→L∪{α}, L={!,?,@}×D, marking the type of the current event, including empty label α, write!, read?, delete@; M is the mapping M:P→{0,1,2,3,…}, which is called an identifier of the network.

[0104] α Delete rule 1:

[0105] ,like( · e) · ={e}, then the event e can be deleted, where:

[0106] B′=B- · e;

[0107] E′=E-{e};

[0108] G′=F-{(x,e)|x∈ ·e}-{(e,y)|y∈e ·}-{(x,y)|x∈ · ( · e)∧y∈( · e)}∪{(x,y)|x∈ · ( · e)∧y∈e ·};

[0109] D′=D;

[0110] Rd′=Rd;

[0111] Wr′=Wr;

[0112] De′=De;

[0113] λ′=λ-{(e,α)};

[0114] If x∈ · e∧M(x)==0, then M′=M; if ,but

[0115] α Delete rule 1 as Figure 4 As shown, it can be applied in 3 situations. Figure 4 Middle (a), Figure 4 (b) and Figure 4 (c) corresponds to the first, second and third cases of applying α deletion rule 1 respectively; Figure 4 (d) is Figure 4 The reachable graph corresponding to (a) is: Figure 4 (e) is Figure 4 The reachable graph corresponding to (b) is: Figure 4 (f) is Figure 4 The corresponding reachable graph in (c). The left side of the thick arrow is the source interactive MPμ λ , the interactive MPμ λ There is α in ; the one on the right of the thick arrow is the target optimization merging process (O-MP) μ′. λ After deleting α from , we get Figure 4 (a) shows the application of α deletion rule 1 to an interactive MP with a serial structure. Figure 4 (b) and Figure 4 (c) shows the application of α deletion rule 1 to an interactive MP with a concurrent structure. Figure 4 (a) and Figure 4 The difference between (c) and (c) is the different processing of M′. In order to intuitively distinguish α from data operation events, α is represented by a filled black square. In addition, the area shown in the dotted square is the source interactive MPμ during the process of deleting α. λThe relevant elements that need to be deleted.

[0116] α Delete rule 2:

[0117] ,like · e1= · e2…= · e n ∧e1 · =e2 · =…=e n · , then these n e1,e2,…,e n can all be deleted, and the new MP is μ′=(B′,E′,G′,D′,Rd′,Wr′,De′,λ′,M′), where:

[0118] B′=B- · e1;

[0119] E′=E-( · e1) · ;

[0120] G′=G-{(x,y)|x∈ · e1∧y∈( · e1) ·}-{(x,y)|x∈( · e1) · ∧y∈e1 ·}-{(x,y)|x∈ · ( · e1)∧y∈( · e1)}∪{(x,y)|x∈ · ( · e1)∧y∈e1 ·};

[0121] D′=D;

[0122] Rd′=Rd;

[0123] Wr′=Wr;

[0124] De′=De;

[0125] λ′=λ-{(e1,α)}-{(e2,α)}…-{(e n ,α)};

[0126] If x∈ · e i ∧M(x)==0, then M′=M; if ,but The value of i ranges from 1 to n.

[0127] α deletion rule 2 can be applied in two cases, such as Figure 5 As shown, Figure 5 (a) and Figure 5 (b) corresponds to the first and second cases of applying α deletion rule 2 respectively; Figure 5 (c) is Figure 5 The reachable graph corresponding to (a) is: Figure 5 (d) is Figure 5 The corresponding reachable graph in (b). Figure 5 (a) and Figure 5 The difference between (b) and (c) is the different treatment of M′. The similarity is that Figure 5 (a) and Figure 5 The source interactive MPμ on the left of the thick arrow shown in (b) λ There are n α in , and the inputs of these α converge to condition b2, and the outputs converge to condition b3. α deletion rule 2 is used to delete all these α.

[0128] α Delete rule 3:

[0129] ,like · e1= · e2=…= · e n = · e∧e1 · =e2 · =…=e n · =e · ,but( · e1) · All α in can be deleted, but e event cannot be deleted. An α is added to keep the conflict structure in the deletion rule, where:

[0130] B′=B;

[0131] E′=E-{x|x∈( · e1) · ∧λ(x)=α}∪{e n+1};

[0132] G′=G-{(x,y)|x∈ · e1∧y∈( · e1) · ∧λ(y)=α}-{(x,y)|x∈( · e1) · ∧y∈e1 · ∧λ(x)=α}∪{(x,α)|x∈ · e1}∪{(α,y)|y∈e1 ·};

[0133] D′=D;

[0134] Rd′=Rd;

[0135] Wr′=Wr;

[0136] De′=De;

[0137] λ′=λ;

[0138] M′=M.

[0139] α Delete rule 3 as Figure 6 shown. Figure 6 (a) corresponds to the first case of applying α-deletion rule 3, Figure 6 (b) is Figure 6 The corresponding reachable graph in (a). Figure 6 The source interactive MPμ λ There are n α and 1 operation to read data item z in the process? z, and the input of these events converges to condition b2, and the output converges to condition b3. If all these n α are deleted directly, the source interactive MPμ will be destroyed. λ Therefore, after deleting these n α to simplify the source interactive MPμ λ At the same time, an α event needs to be added to the target optimization merging process (O-MP) μ′ to maintain the source interactive MPμ λ The choice (conflict) structure in .

[0140] Correctness analysis of α deletion rules:

[0141] The correctness of the α deletion rule is analyzed, and weak mutual simulation is used as the criterion for verifying whether the behavior is consistent. The problem of verifying whether the source MP and the target interactive MP maintain behavioral consistency can be reduced to the problem of verifying whether the source interactive MP and the target interactive MP satisfy weak mutual simulation.

[0142] Optimizing MP by pruning it according to the above α deletion rules can reduce a large number of control flow conditions and events, greatly improving the efficiency of the data redundancy error detection algorithm while ensuring behavioral consistency.

[0143] The certification process includes:

[0144] S301, α deletion rule 1 correctness analysis:

[0145] The key problem in correctness analysis of α-deletion rule 1 is to prove whether the reachable graph of the source interactive MP satisfies weak mutual simulation with the reachable graph of the target interactive MP. The proof is as follows:

[0146] That is to prove Figure 4 The reachable graphs shown in (d) satisfy bisimulation.

[0147] The first step is to have a reachable graph on the left. There exists M0′ in the reachable graph on the right such that

[0148] In the second step, in the reachable graph on the left, there are There exists M1′ in the reachable graph on the right such that

[0149] From the above, we can know that M0SM0′. The relationship S={(M0,M0′),(M1,M0′),(M2,M1′)}.

[0150] Prove that the inverse S of relation S -1 ={(M0′,M0),(M0′,M1),(M1′,M2)} is a weak simulation, that is Figure 4 The reachability graph to the right of the medium thick arrow is weakly simulated by the reachability graph to the left.

[0151] In the first step, in the reachable graph on the right, M0′ remains unchanged; in the reachable graph on the left, there exists M0 such that

[0152] In the second step, in the reachable graph on the right, there are There exists M2 in the reachable graph on the left such that

[0153] In summary, we can know that M0′S -1 M0. This proves that M0≈M0′. Similarly, it can be proved that other reachable graphs satisfy weak mutual simulation.

[0154] S302, α deletion rule 2 correctness analysis:

[0155] The key problem in correctness analysis of α-deletion rule 2 is to prove whether the reachable graph of the source interactive MP satisfies weak mutual simulation with the reachable graph of the target interactive MP. The proof is as follows:

[0156] That is to prove Figure 5 The two reachable graphs shown satisfy a weak bisimulation relation,

[0157] The first step is to have a reachable graph on the left. There exists M1′ in the reachable graph on the right such that

[0158] In the second step, in the reachable graph on the left, there are Here α can be α or α… or α; there exists M1′ in the reachable graph on the right such that

[0159] In the third step, in the reachable graph on the left, there are There exists M2′ in the reachable graph on the right such that

[0160] Step 4: M2 and M2′ are both end markers.

[0161] In summary, we can know that M0SM0′. The relationship S={(M0,M0′),(M1,M1′),(M2,M1′),(M3,M2′)}.

[0162] Prove that the inverse S of relation S -1 ={(M0′,M0),(M1′,M1),(M1′,M2),(M2′,M3)} is a weak simulation, that is Figure 5 The reachability graph to the right of the medium-thick arrow is weakly simulated by the reachability graph to the left of the black arrow.

[0163] The first step is to have a reachable graph on the right. In the reachable graph on the left, there exists M1 such that

[0164] In the second step, M1′ in the reachable graph on the right remains unchanged; there exists M2 in the reachable graph on the left such that

[0165] In the third step, in the reachable graph on the right, there are There exists M3 in the reachable graph on the left such that

[0166] In summary, we can know that M0′S -1 M0. This proves that M0≈M0′. Similarly, it can be proved that other reachable graphs satisfy weak mutual simulation.

[0167] S303, α deletion rule 3 correctness analysis:

[0168] The key problem in correctness analysis of α-deletion rule 3 is to prove whether the reachable graph of the source interactive MP satisfies weak mutual simulation with the reachable graph of the target interactive MP. The proof is as follows:

[0169] That is to prove Figure 6 The two reachable graphs shown satisfy a weak bisimulation relation,

[0170] The first step is to have a reachable graph on the left. There exists M1′ in the reachable graph on the right such that

[0171] Step 2, in the reachable graph on the left: or There exists M2′ in the reachable graph on the right such that Or there is There exists M2′ in the reachable graph on the right, such that

[0172] In the third step, in the reachable graph on the left, there are There exists M3′ in the reachable graph on the right such that

[0173] Step 4: M3 and M3′ are both end markers.

[0174] In summary, we can know that M0SM0′. The relationship S={(M0,M0′),(M1,M1′),(M2,M2′),(M3,M3′)}.

[0175] Prove that the inverse S of relation S -1 ={(M0′,M0),(M1′,M1),(M2′,M2),(M3′,M3)} is a weak simulation, that is Figure 6 The reachability graph to the right of the medium-thick arrow is weakly simulated by the reachability graph to the left of the black arrow.

[0176] The first step is to have a reachable graph on the right. In the reachable graph on the left, there exists M1 such that

[0177] Step 2, in the reachable graph on the right: or There exists M2 in the reachable graph on the left such that Or there is There exists M2 in the reachable graph on the left such that

[0178] In the third step, in the reachable graph on the right, there are There exists M3 in the reachable graph on the left such that

[0179] In summary, we can know that M0′S -1 M0. This proves that M0≈M0′.

[0180] The correctness analysis of the α deletion rule in steps S301, S302, and S303 requires understanding the concepts of experimental relationship, weak simulation, and weak mutual simulation, which are defined as follows:

[0181] Experimental relationship: Let ∑=(P,T,F,M0) be a Petri-Net, where M0 is the initial state. The reachable graph of ∑ is RG(∑)=(R(M0),E,Tran),M i ,M j ∈R(M0),s∈Act*, where Act=T∪{α}, experimental relationship and The definition is as follows:

[0182] (1) Indicates that there is a transition sequence with a length greater than or equal to 0 Or more formally, in, yes The reflexive transitive closure of .

[0183] (2) Let s = t1…t n ,but express Or more formally, In particular, Indicates that it is preceded or followed by any number of of Where t∈T.

[0184] Weak simulation: Let Σ=(P,T,F,M0) be a Petri-Net whose reachability graph is RG(Σ)=(R(M0),E,Tran); Σ′=(P′,T′,F′,M0′) be a Petri-Net whose reachability graph is RG(Σ′)=(R(,M0′),E′,Tran′), and the relation S is a weak simulation of the reachable identification set R(M0)∪R(M0′). For M0SM0′, the following conditions hold.

[0185] (1) If Among them, M0,M k ∈R(M0), then there exists M k ′∈R(M0′), satisfying And M k SM k ′.

[0186] (2) If Among them, M0,M k ∈R(M0), then there exists M k ′∈R(M0′), satisfying And M k SM k ′.

[0187] If M0SM0′, then Σ is said to be weakly simulated by Σ′.

[0188] Weak bisimulation: Let ∑=(P,T,F,M0) be a Petri-Net whose reachability graph is RG(∑0=(R(M0),E,Tran); ∑′=(P′,T′,F′,M0′) be a Petri-Net whose reachability graph is RG(∑′)=(R(,M0′),E′,Tran′), and a relation B is a weak bisimulation on the reachability identity set R(M0)∪R(M0′) if and only if B and its inverse are both weak bisimulations. If there exists a weak bisimulation B satisfying M0SM0′, then M0 and M0′ are called weak bisimulations, denoted by M0≈M0′.

[0189] If M0BM0′, then ∑ and ∑′ are said to satisfy weak mutual simulation.

[0190] S4. Initialize the optimization merging process O-MPμ″=(B′,E′,G′,D′,Rd′,Wr′,De′,End′,λ′,M′), and the event set of data redundancy error

[0191] Initialization optimization merge process refers to adding condition b′0 and event e′0 before the start condition of μ′, and adding condition b′ and event e′ after the end condition. The subscripts of b′ and e′ are the maximum subscript i of the condition and event in μ′ plus one. In addition, the flow relations {b′0}×{e′0} and {e′0}×{b0} and {b′ i At the same time, e'0 is marked as the operation of deleting all data, that is, De(e'0)=D; e' is marked as the end operation, that is, End(e')=D.

[0192] S5. Analyze the optimized merging process μ″ after initialization and design a detection algorithm for data redundancy errors.

[0193] The data redundancy error detection algorithm is based on data adjacent events. Before calculating the data adjacent events, it is necessary to perform synonymous data operations on MP so that errors can be correctly detected in concurrent structures. Synonymous data operations refer to writing data items d for a given event e. If there are two items belonging to [e] + For concurrent events e1 and e2, and d∈Wr(e1)∪Rd(e1), add the same data operation label, that is, (e1,Wr:d or e1,Rd:d), from e1 to e2, where [e] + ={e′∈E|e′≤e}.

[0194] Data neighboring events are defined as given two events e1 and e2 satisfying the data d∈Rd(e1)∪Wr(e1)∪De(e1), if e1<e2, then there is obviously a path from e1 to e2. If there is an event e′ on this path satisfying or e1 · = · e2, then e1 is called the data adjacent event of e2.

[0195] The data redundancy error detection algorithm is as follows:

[0196]

[0197] The algorithm flow is to determine whether event e belongs to the De or End marking function of data element d. If so, in the weak local configuration [e] of event e + Calculate the data neighbor set S(e,d) of event e with respect to data element d, where [e] + ={e′∈E|e′≤e}. If there is an event e′ in S(e,d) that is a Wr marking function belonging to data element d, then the event e is added to the event set E_redu where data redundancy errors occur.

[0198] S6. Output a set of events where data redundancy occurs.

[0199] Using the data redundancy error detection algorithm based on O-MP, the event set E_redu where data redundancy errors occur is finally output.

[0200] Some of the comparison results are shown in Table 1. At present, no research has proposed a method for detecting data loss errors in the backbone merging process, so data loss errors cannot be detected. Since the data flow error detection based on the reachable graph may not trigger subsequent transformations once a data flow error occurs in the transition, and the relevant states and arcs will not be represented in the reachable graph, in this case the reachable graph does not have a complete state space to cover all operating information. Therefore, this method cannot detect all data redundancy errors. Through comparison, the method of the present invention makes up for this deficiency. In addition, through analysis and comparison, it is concluded that the optimized merging process based on the α deletion rule used in the present invention for data redundancy error detection is superior to the data redundancy error detection based on the ordinary merging process in terms of detection results and time, and is superior to the method based on the reachable graph in terms of state space, detection results and time.

[0201] Table 1 Comparison of the number of data redundancy error detections using MP, O-MP, and RG in HCPS

[0202] Benchmarks MP O-MP RG Data redundancy 0 2 0

[0203] The Petri-Net-based cyber-physical system data redundancy error detection system of the present invention comprises:

[0204] A Petri net mapping unit, configured to map the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data;

[0205] A merging process generating unit, used for generating a merging process μ=(B, E, G, D, Rd, Wr, De) of the first Petri net; wherein B is a condition set, E is an event set, G is an arc set, D is a data element set, Rd is a read annotation function, Wr is a write annotation function, and De is a delete annotation function;

[0206] A merging process optimization unit, used for optimizing the events and conditions in the merging process μ according to the deletion rule to obtain an optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′);

[0207] A redundant error detection unit, used to determine whether each event is a redundant event in the optimization merging process μ″, and output a set of events with data redundant errors;

[0208] In the redundant error detection unit, the optimized merging process μ′ is subjected to a synonymous data operation to calculate data neighboring events; the synonymous data operation is that given an event e is a deletion annotation function or an end annotation function about a data item d, that is, (e, De: d or e, End: d), if there are two events belonging to [e] + For concurrent events e1 and e2, and d∈Wr(e1)∪Rd(e1), add the same data operation label, that is, (e1,Wr:d or e1,Rd:d), from e1 to e2, where [e] + ={e′∈E|e′≤e}; the data neighboring event is given two events e1 and e2 satisfying the data d∈Rd(e1)∪Wr(e1)∪De(e1). If e1<e2, then there is obviously a path from e1 to e2. If there is an event e′ on this path satisfying or e1 · = · e2, then e1 is called the data neighboring event of e2;

[0209] The method to determine whether each event e is a redundant event is:

[0210] Determine whether event e belongs to the De or End marking function of data element d. If so, in the weak local configuration [e] of event e + Calculate the data neighbor set S(e,d) of event e with respect to data element d, where [e] +={e′∈E|e′≤e}; if there exists an event e′ in S(e,d) that is a Wr marking function belonging to the data element d, then the event e is added to the event set E_redu where data redundancy errors occur.

[0211] The computer-readable storage medium of the present invention stores a computer program, and when the computer program is executed by a processor, the Petri-Net-based cyber-physical system data redundancy error detection method is implemented.

[0212] The computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, flash memory, or any other medium that can be used to store the desired program code in the form of instructions or data structures and that can be accessed by a computer.

[0213] The processor is used to execute the computer program stored in the memory to implement each step of the method involved in the above embodiment.

Claims

1. A method for detecting data redundancy errors in a cyber-physical system based on Petri-Net, characterized in that: The steps include: Mapping the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data; Generate the merging process μ=(B, E, G, D, Rd, Wr, De) of the first Petri net; wherein B is a condition set, E is an event set, G is an arc set, D is a data element set, Rd is a read annotation function, Wr is a write annotation function, and De is a delete annotation function; Optimize the events and conditions in the merging process μ according to the deletion rule to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′); In the optimization merging process μ′, it is determined whether each event is a redundant event, and a set of events with data redundancy errors is output; Perform synonymous data operations on the optimized merging process μ′ to calculate data proximity events; the synonymous data operation is that given an event e is a deletion annotation function or an end annotation function for a data element d, i.e., (e, De: d or e, End: d), if there are two concurrent events e1 and e2 belonging to [e] + and d ∈ Wr(e1) ∪ Rd(e1), then add the same data operation label, i.e., (e1, Wr: d or e1, Rd: d), from e1 to e2, where [e] + = {e′ ∈ E|e′ ≤ e}; the data proximity event is that given two events e1 and e2 satisfy data d ∈ Rd(e1) ∪ Wr(e1) ∪ De(e1), if e1 < e2, then obviously there is a path from e1 to e2, if there is an event e′ on this path that satisfies or e1 ·=· e2, then e1 is called a data proximity event of e2; The method to determine whether each event e is a redundant event is: Determine whether event e belongs to the De or End marking function of data element d. If so, in the weak local configuration [e] of event e + Calculate the data neighbor set S(e, d) of event e with respect to data element d, where [e] + ={e′∈E|e′≤e}; if there is an event e′ in S(e, d) that is a Wr marking function belonging to data element d, then add event e to the event set E_redu where data redundancy errors occur; The optimizing the events and conditions in the merging process μ according to the deletion rule to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′) comprises: Transform the merge process μ into the target interactive merge process μ λ =(B, E, G, D, Rd, Wr, De, λ, M), where λ is a marking function used to mark the type of the current event, M: B→{0, 1, 2, 3, ...} is an identifier of the network; marking function λ: E→L∪{α}, L={! , ? , @}×D, including empty mark α, write! , read? , delete@; In the target interactive merging process μλ, events and conditions are deleted according to the deletion rule to obtain an optimized merging process μ; The optimizing the events and conditions in the merging process μ according to the deletion rule to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′) comprises: The deletion rules include: If (·e)·={e}, then the event e can be deleted, where: B = B - e; E = E - {e}; G′=F-{(x, e)|x∈·e}-{(e, y)|y∈e·}-{(x, y)|x∈·(·e)∧y∈(·e)}∪{(x, y)|x∈·(·e)∧y∈e·}; D = D; Rd′=Rd; Wr′=Wr; De′=D e ; λ′=λ-{(e,α)}; If x∈·e∧M(x)==0, then M′=M; if but like · e1= · e2...= · e n ∧e1 · =e2 · =...=e n · , then these n e1, e2, ..., e n can all be deleted, and the optimal merging process is μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′), where: B = B - e1; E′=E-(·e1)·; G′=G-{(x, y)|x∈·e1∧y∈(·e1)·}-{(x, y)|x∈(·e1)·∧y∈e1·}-{(x, y)|x∈ ·(·e1)∧y∈(·e1)}∪{(x,y)|x∈·(·e1)∧y∈e1·}; D′=D; Rd′=Rd; Wr′=Wr; De′=De; λ′=λ-{(e1,α)}-{(e2,α)}…-{(e n ,a)}; If x∈ · e i ∧M(x)==0, then M′=M; if but Where i ranges from 1 to n; If ·e1=·e2=…=·e n =·e∧e1·=e2·=...=e n ·=e·, then all α in (·e1)· can be deleted, and the e event cannot be deleted. An α is added to maintain the conflict structure in the deletion rule, where: B′=B; E′=E-{x|x∈(·e1)·∧λ(x)=α}∪{e n+1 }; G′=G-{(x, y)|x∈·e1∧y∈(·e1)·∧λ(y)=α}-{(x, y)|x∈(·e1)·∧y∈e1·∧ λ(x)=α}∪{(x, α)|x∈·e1}∪{(α, y)|y∈e1·}; D′=D; Rd′=Rd; Wr′=Wr; De′=De; λ′=λ; M′=M.

2. The method for detecting data redundancy errors in a Petri-Net-based cyber-physical system according to claim 1, characterized in that: The mapping of the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data, including: According to the data objects and states in the cyber-physical system, the cyber-physical system is mapped into the first Petri network, and the first Petri network is modeled; The first Petri net is a net N with data initially marked as m0. D , recorded as ∑=(N D , m0), N D =(P, T, F, D, Read, Write, Delete), satisfying (P, T, F) is a network, P is a place, T is a transition, F is a flow relationship, Read, Write, Delete are the read annotation function, write annotation function and delete annotation function in the first Petri network respectively.

3. The method for detecting data redundancy errors in a Petri-Net-based cyber-physical system according to claim 2, characterized in that: The mapping of the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data, including: The merging process μ=Merge(β), and the method for generating the merging process μ is: Merge all beta-conflict conditions with the same label and occurrence depth into one condition; All β events with the same label, i.e., the pre-set and the post-set, are merged into one event; All relevant arcs of β need to be redirected according to the conditions and events of the merger; Here, β is the branching process of the first Petri net.

4. The method for detecting data redundancy errors in a Petri-Net-based cyber-physical system according to claim 1, characterized in that: The mapping of the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data, including: Mapping the exclusive gateways of the business process modeling notation to the conflict structure of the first Petri net; Mapping the parallel gateways of the business process modeling notation to the concurrent structure of the first Petri net; Mapping activities into transitions and their pre-places or post-places; Mapping the input and output of a data object or database to labeled functions that read and write data elements in a transition; Mapping external inputs to tag functions that write data elements in transitions; Map the message flow between activities to a place and its before or after transitions; Other connection objects are mapped as arcs between related places and transitions.

5. The method for detecting data redundancy errors in a Petri-Net-based cyber-physical system according to claim 1, characterized in that: The optimizing the events and conditions in the merging process μ according to the deletion rule to obtain the optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′) comprises: The correctness of the deletion rule is analyzed, weak mutual simulation is used as a criterion for verifying whether the behavior is consistent, and the problem of verifying whether the behavior consistency is maintained between the source merging process and the target interactive merging process is reduced to the problem of verifying whether the source merging process and the target interactive merging process satisfy weak mutual simulation.

6. The method for detecting data redundancy errors in a Petri-Net-based cyber-physical system according to claim 1, characterized in that: In the optimization merging process μ′, it is determined whether each event is a redundant event, and a set of events of outputting data redundant errors includes: Before determining whether each event is a redundant event in the optimization merging process μ′, the optimization merging process μ′ is initialized; the initialization includes: Add condition b′0 and event e′0 before the start condition of the optimization merging process μ′, and add condition b′ and event e′ after the end condition. The subscripts of b′ and e′ are the maximum subscript i of the conditions and events in μ′ plus one. In the optimization merging process μ′, flow relations {b′0}×{e′0}, {e′0}×{b0}, {b′i}×{e′} and {e′}×{b′} are added; Mark e′0 as the operation of deleting all data, that is, De(e′0)=D; mark e′ as the end operation, that is, End(e′)=D, and End is the end marking function.

7. A data redundancy error detection system in a cyber-physical system based on Petri-Net, characterized in that: include: A Petri net mapping unit, configured to map the cyber-physical system into a first Petri net, wherein the cyber-physical system is modeled using a business process modeling notation, and the first Petri net is a Petri net with data; A merging process generating unit, used for generating a merging process μ=(B, E, G, D, Rd, Wr, De) of the first Petri net; wherein B is a condition set, E is an event set, G is an arc set, D is a data element set, Rd is a read annotation function, Wr is a write annotation function, and De is a delete annotation function; A merging process optimization unit, used for optimizing the events and conditions in the merging process μ according to the deletion rule to obtain an optimized merging process μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′); A redundant error detection unit, used to determine whether each event is a redundant event in the optimization merging process μ′, and output a set of events with data redundant errors; In the redundant error detection unit, a synonymous data operation is performed on the optimized merging process μ′ to calculate data proximity events; the synonymous data operation is that a given event e is a deletion annotation function or an end annotation function for a data element d, that is, (e, De: d or e, End: d). If there are two concurrent events e1 and e2 belonging to [e] + and d ∈ Wr(e1) ∪ Rd(e1), then the same data operation label is added, that is, (e1, Wr: d or e1, Rd: d), that is, (e1, Rd: d), from e1 to e2, where [e] + = {e′ ∈ E|e′ ≤ e}; the data proximity event is that given two events e1 and e2 satisfy that data d ∈ Rd(e1) ∪ Wr(e1) ∪ De(e1). If e1 < e2, then there is obviously a path from e1 to e2. If there is an event e′ on this path that satisfies or e1 ·=· e2, then e1 is called a data proximity event of e2; The method to determine whether each event e is a redundant event is: Determine whether event e belongs to the De or End marking function of data element d. If so, in the weak local configuration [e] of event e + Calculate the data neighbor set S(e, d) of event e with respect to data element d, where [e] + ={e′∈E|e′≤e}; if there is an event e′ in S(e, d) that is a Wr marking function belonging to data element d, then add event e to the event set E_redu where data redundancy errors occur; In the merging process optimization unit, the merging process μ is converted into a target interactive merging process μ λ =(B, E, G, D, Rd, Wr, De, λ, M), where λ is a marking function used to mark the type of the current event, M: B→{0, 1, 2, 3, ...} is an identifier of the network; marking function λ: E→L∪{α}, L={! , ? , @}×D, including empty mark α, write! , read? , delete@; In the interactive merging process of the target μ λ In the above example, events and conditions are deleted according to the deletion rules to obtain the optimized merging process μ; In the merging process optimization unit, the deletion rule includes: If (·e)·={e}, then the event e can be deleted, where: B = B - e; E′=E-{e}; G′=F-{(x, e)|x∈·e}-{(e, y)|y∈e·}-{(x, y)|x∈·(·e)∧y∈(·e)}∪{(x, y)|x∈·(·e)∧y∈e·}; D = D; Rd′=Rd; Wr=Wr; De=De; λ′=λ-{(e,α)}; If x∈·e∧M(x)==0, then M′=M; if but like · e1= · e2…= · e n ∧e1 · =e2 · =…=e n · , then these n e1, e2, ..., e n can all be deleted, and the optimal merging process is μ′=(B′, E′, G′, D′, Rd′, Wr′, De′, λ′, M′), where: B′=B-·e1; E′=E-(·e1)·; G′=G-{(x, y)|x∈·e1∧y∈(·e1)·}-{(x, y)|x∈(·e1)·∧y∈e1·}-{(x, y)|x∈ ·(·e1)∧y∈(·e1)}∪{(x,y)|x∈·(·e1)∧y∈e1·}; D′=D; Rd′=Rd; Wr′=Wr; De′=De; λ=λ-{(e1,α)}-{(e2,α)}…-{(e n ,a)}; If x∈ · e i ∧M(x)==0, then M′=M; if but Where i ranges from 1 to n; If ·e1=·e2=…=·e n =·e∧e1·=e2·=…=e n ·=e·, then all α in (·e1)· can be deleted, and the e event cannot be deleted. An α is added to maintain the conflict structure in the deletion rule, where: B′=B; E′=E-{x|x∈(·e1)·∧λ(x)=α}∪{e n+1 }; G′=G-{(x, y)|x∈·e1∧y∈(·e1)·∧λ(y)=α}-{(x, y)|x∈(·e1)·∧y∈e1·∧ λ(x)=α}∪{(x, α)|x∈·e1}∪{(α, y)|y∈e1·}; D′=D; Rd′=Rd; Wr′=Wr; De′=De; λ′=λ; M′=M.

8. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by the processor, the method for detecting data redundancy errors in a Petri-Net-based information-physical system according to any one of claims 1 to 6 is implemented.