Decidability of opacity verification problems in labeled Petri net systems
From MaRDI portal
Publication:2407162
Recommendations
- Verification of \(K\)-step and infinite-step opacity of bounded labeled Petri nets
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Current-state opacity modelling and verification in partially observed Petri nets
- Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
- Modelling opacity using Petri nets
Cites work
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 46872 (Why is no real title available?)
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Concurrent secrets
- Control of discrete-event systems. Automata and Petri net perspectives
- Enforcement and validation (at runtime) of various notions of opacity
- Modelling opacity using Petri nets
- On the Equivalence of Observation Structures for Petri Net Generators
- Opacity of discrete event systems and its applications
- Supervisory Control for Opacity
- Synthesis of insertion functions for enforcement of opacity security properties
- Synthesis of opaque systems with static and dynamic masks
- Verification of State-Based Opacity Using Petri Nets
- Verification of initial-state opacity in security applications of discrete event systems
Cited in
(20)- Deciding Selective Declassification of Petri Nets
- Current-state opacity modelling and verification in partially observed Petri nets
- Enforcing opacity by insertion functions under multiple energy constraints
- Opacity of networked discrete event systems
- Deciding detectability for labeled Petri nets
- Verification of \(K\)-step and infinite-step opacity of bounded labeled Petri nets
- Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
- Performance safety enforcement in strongly connected timed event graphs
- Modelling opacity using Petri nets
- The complexity of diagnosability and opacity verification for Petri nets
- The complexity of diagnosability and opacity verification for Petri nets
- Performance safety enforcement in stochastic event graphs against boost and slow attacks
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Current-state opacity and initial-state opacity of modular discrete event systems
- Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
- Information control in networked discrete event systems and its application to battery management systems
- scientific article; zbMATH DE number 7155812 (Why is no real title available?)
- Optimization-based assessment of initial-state opacity in Petri nets
- State-based opacity of labeled real-time automata
- Infinite-step opacity and K-step opacity of stochastic discrete-event systems
This page was built for publication: Decidability of opacity verification problems in labeled Petri net systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407162)
