A Petri net system is said to be initial-state opaque if its initial state remains opaque to an external observer (called an intruder). In other words, the intruder is never able to ascertain that the initial state belongs to a given set of states (called a secret) based on its observation of the system's evolution. This paper addresses the problem of verifying initial-state opacity in discrete event systems (DES) modeled by labeled Petri nets. An efficient approach to verifying initial-state opacity is proposed based on the notion of basis reachability graph (BRG).
['Yin Tong', 'Zhiwu Li', 'Carla Seatzu', 'Alessandro Giua']
Verification of initial-state opacity in Petri nets