Abstract:
This paper addresses the problem of current-state opacity of discrete event systems (DES) modeled with Petri nets. A system is said to be current-state opaque if the intr...Show MoreMetadata
Abstract:
This paper addresses the problem of current-state opacity of discrete event systems (DES) modeled with Petri nets. A system is said to be current-state opaque if the intruder who only has partial observations on the system's behavior is never able to infer that the current state of the system is within a set of secret states. Based on the notion of basis markings, an efficient approach to verifying current-state opacity in bounded Petri nets is proposed, without computing the whole reachability set or exhaustively enumerating the set of markings consistent with the observation. An example showing the efficiency of the approach is presented.
Published in: 2015 American Control Conference (ACC)
Date of Conference: 01-03 July 2015
Date Added to IEEE Xplore: 30 July 2015
ISBN Information: