This invention belongs to the field of
information security technology and discloses a method for verifying the strong
opacity of time-assigned discrete event systems based on labeled temporal Petri nets. First, the time-assigned
discrete event system to be analyzed is accurately modeled by constructing its labeled temporal
Petri net model to formally describe the
system's states, events, time constraints, and partial
observability. Second, for a given time-labeled sequence (i.e., externally observed events and their timestamps), this invention proposes to efficiently enumerate all logically consistent paths with the sequence by constructing a partially modified state class graph and extracting their time constraints. Finally, based on this set of time-consistent paths, the set of all possible reachable current states (identifiers) of the
system is calculated. This invention provides a method for verifying the strong
opacity of time-assigned discrete event systems based on labeled temporal Petri nets, solving the problems in the background technology, reducing computational complexity, and making it more suitable for complex systems.