Decidability of opacity verification problems in labeled Petri net systems
From MaRDI portal
Publication:2407162
DOI10.1016/j.automatica.2017.01.013zbMath1370.93172OpenAlexW2603068814MaRDI QIDQ2407162
Zhiwu Li, Yin Tong, Alessandro Giua, Carla Seatzu
Publication date: 28 September 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.01.013
Discrete event control/observation systems (93C65) Authentication, digital signatures and secret sharing (94A62)
Related Items (13)
Current-state opacity and initial-state opacity of modular discrete event systems ⋮ Performance safety enforcement in stochastic event graphs against boost and slow attacks ⋮ Compositional synthesis of opacity-preserving finite abstractions for interconnected systems ⋮ State-based opacity of labeled real-time automata ⋮ Information control in networked discrete event systems and its application to battery management systems ⋮ Enforcing opacity by insertion functions under multiple energy constraints ⋮ Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems ⋮ Deciding detectability for labeled Petri nets ⋮ Current-state opacity modelling and verification in partially observed Petri nets ⋮ Performance safety enforcement in strongly connected timed event graphs ⋮ Current-state opacity enforcement in discrete event systems under incomparable observations ⋮ Opacity of networked discrete event systems ⋮ Optimization-based assessment of initial-state opacity in Petri nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Control of discrete-event systems. Automata and Petri net perspectives
- Synthesis of opaque systems with static and dynamic masks
- Synthesis of insertion functions for enforcement of opacity security properties
- Verification of initial-state opacity in security applications of discrete event systems
- Opacity of discrete event systems and its applications
- Enforcement and validation (at runtime) of various notions of opacity
- Concurrent secrets
- On the Equivalence of Observation Structures for Petri Net Generators
- Supervisory Control for Opacity
- Verification of State-Based Opacity Using Petri Nets
This page was built for publication: Decidability of opacity verification problems in labeled Petri net systems