Decidability of opacity verification problems in labeled Petri net systems

• Autores: Yin- Tong, Zhiwu Li, Carla Seatzu, Alessandro Giua
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 80, 2017, págs. 48-53
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Abstract A system is said to be opaque if an intruder that observes its evolution through a mask cannot infer that the system’s evolution belongs to a given secret behavior. Opacity verification is the problem of determining whether the system is opaque with respect to a given secret or not. In this paper we address the decidability of the opacity verification problem. Using reduction approaches, we show that verification of initial-state, current-state, and language opacity is undecidable in labeled Petri nets.