Abstract
Opacity is an important information-flow property, which is used to characterize whether or not the secrets of system have been leaked to the intruders. Over the past ten years, opacity of discrete event systems (DESs) modeled as automata and Petri nets have been well investigated under the assumption that the communication channels between systems and intruders are perfect. However, in a shared network, the communication delays and losses are inevitable usually. In this paper, we investigate the problem of opacity of networked discrete event systems (NDESs). We propose the notions of current-state opacity, initial-state opacity, initial-final-state opacity, and infinite-step opacity for NDESs. We also present the verification algorithms for these notions. Some examples are provided to illustrate the results obtained.
Sign-in/Register to access full text options 
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.
