Abstract
Opacity is a property of discrete event systems (DES) that is related to the possibility of hiding a secret from external observers (the intruders). When the secret is the initial state of the system, the related opacity problem is referred to as Initial State Opacity (ISO). A necessary and sufficient condition to check ISO in DES modeled as Petri nets (PN) is given in this paper. By exploiting both the structural properties of PNs and the algebraic description of their dynamic, we propose to assess ISO by solving Integer Linear Programming problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have