Abstract
This paper presents an online approach to deal with the problem of state-based K-step opacity of a discrete event system modeled with labeled Petri nets. The secret states can be described by a set of either markings or generalized mutual exclusion constraints (GMECs), which is more general than the existing approaches in which the secret states are characterized by GMECs only. We formulate an integer linear programming (ILP) model to find a marking outside the set of secret states from each of the K-delayed state estimates, avoiding a complete enumeration of reachability set. Based on the ILP model, an online algorithm is developed to verify K-step opacity of an observation (i.e., an observed sequence). As an extension of K-step opacity, we define the notion of jointK-step opacity in a decentralized structure with two local sites and extend the proposed algorithm to verify the joint K-step opacity of an observation. In addition, the relationship between joint K-step opacity and K-step opacity is formally discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
