Decidability of opacity verification problems in labeled Petri net systems

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.

[1]  Christoforos N. Hadjicostis,et al.  Verification of initial-state opacity in security applications of discrete event systems , 2013, Inf. Sci..

[2]  Stéphane Lafortune,et al.  Comparative analysis of related notions of opacity in centralized and coordinated architectures , 2013, Discret. Event Dyn. Syst..

[3]  Franck Cassez,et al.  The Dark Side of Timed Opacity , 2009, ISA.

[4]  Christoforos N. Hadjicostis,et al.  Verification of $K$-Step Opacity and Analysis of Its Complexity , 2009, IEEE Transactions on Automation Science and Engineering.

[5]  C. Reutenauer.  The Mathematics of Petri Nets , 1990 .

[6]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.

[7]  Jean-Jacques Lesage,et al.  Overview of discrete event systems opacity: Models, validation, and quantification , 2016, Annu. Rev. Control..

[8]  Yliès Falcone,et al.  Enforcement and validation (at runtime) of various notions of opacity , 2014, Discrete Event Dynamic Systems.

[9]  Benoît Caillaud,et al.  Concurrent Secrets , 2007, 2006 8th International Workshop on Discrete Event Systems.

[10]  Alessandro Giua,et al.  Verification of State-Based Opacity Using Petri Nets , 2017, IEEE Transactions on Automatic Control.

[11]  Zhiwu Li,et al.  Verification of language-based opacity in Petri nets using verifier , 2016, 2016 American Control Conference (ACC).

[12]  Philippe Darondeau,et al.  Supervisory Control for Opacity , 2010, IEEE Transactions on Automatic Control.

[13]  Alessandro Giua,et al.  Verification of initial-state opacity in Petri nets , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[14]  Alessandro Giua,et al.  Supervisory enforcement of current-state opacity with uncomparable observations , 2016, 2016 13th International Workshop on Discrete Event Systems (WODES).

[15]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[16]  Stéphane Lafortune,et al.  Synthesis of insertion functions for enforcement of opacity security properties , 2014, Autom..

[17]  Christoforos N. Hadjicostis,et al.  Notions of security and opacity in discrete event systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[18]  Alessandro Giua,et al.  Verification of current-state opacity using Petri nets , 2015, 2015 American Control Conference (ACC).

[19]  Feng Lin,et al.  Opacity of discrete event systems and its applications , 2011, Autom..

[20]  Maciej Koutny,et al.  Opacity Generalised to Transition Systems , 2005, Formal Aspects in Security and Trust.

[21]  Hervé Marchand,et al.  Synthesis of opaque systems with static and dynamic masks , 2012, Formal Methods Syst. Des..

[22]  A. Saboori,et al.  Verification of initial-state opacity in security applications of DES , 2008, 2008 9th International Workshop on Discrete Event Systems.

[23]  Christoforos N. Hadjicostis,et al.  Verification of K-step opacity and analysis of its complexity , 2011, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[24]  Alessandro Giua,et al.  On the Equivalence of Observation Structures for Petri Net Generators , 2016, IEEE Transactions on Automatic Control.