Pages that link to "Item:Q497279"
From MaRDI portal
The following pages link to Verification of initial-state opacity in security applications of discrete event systems (Q497279):
Displaying 33 items.
- Verification of initial-state opacity in security applications of discrete event systems (Q497279) (← links)
- \(k\)-memory-embedded insertion mechanism for opacity enforcement (Q826781) (← links)
- Enforcement and validation (at runtime) of various notions of opacity (Q896497) (← links)
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems (Q1716666) (← links)
- Probabilistic system opacity in discrete event systems (Q1788695) (← links)
- Detectability of networked discrete event systems (Q1790664) (← links)
- Enforcement of opacity by public and private insertion functions (Q1797032) (← links)
- Supervisor synthesis to thwart cyber attack with bounded sensor reading alterations (Q1797083) (← links)
- On-line verification of current-state opacity by Petri nets and integer linear programming (Q1797108) (← links)
- Current-state opacity modelling and verification in partially observed Petri nets (Q1987252) (← links)
- Opacity of networked discrete event systems (Q2053901) (← links)
- Verification of approximate opacity for switched systems: a compositional approach (Q2060871) (← links)
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets (Q2060875) (← links)
- Online verification of \(K\)-step opacity by Petri nets in centralized and decentralized structures (Q2081818) (← links)
- A framework for current-state opacity under dynamic information release mechanism (Q2125535) (← links)
- Privacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observers (Q2197587) (← links)
- Enforcing opacity of regular predicates on modal transition systems (Q2348369) (← links)
- Decidability of opacity verification problems in labeled Petri net systems (Q2407162) (← links)
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures (Q2407177) (← links)
- A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers (Q2407182) (← links)
- Initial-state detectability and initial-state opacity of unambiguous weighted automata (Q2664211) (← links)
- Compositional synthesis of opacity-preserving finite abstractions for interconnected systems (Q2665387) (← links)
- Strong current-state and initial-state opacity of discrete-event systems (Q2682301) (← links)
- State Estimation and Fault Detection Using Petri Nets (Q3011880) (← links)
- Relative predictability of failure event occurrences and its opacity-based test algorithm (Q4967673) (← links)
- Current-state opacity and initial-state opacity of modular discrete event systems (Q5056544) (← links)
- Networked opacity for finite state machine with bounded communication delays (Q6071273) (← links)
- Verification and enforcement of current-state opacity based on a state space approach (Q6099923) (← links)
- State-based opacity of labeled real-time automata (Q6122597) (← links)
- Game current-state opacity formulation in probabilistic resource automata (Q6125209) (← links)
- Matrix approach for verification of opacity of partially observed discrete event systems (Q6135550) (← links)
- Dynamics based privacy preservation in decentralized optimization (Q6163983) (← links)
- Enforcing opacity by insertion functions under multiple energy constraints (Q6198145) (← links)
