The following pages link to Quantifying opacity (Q5740626):
Displaying 15 items.
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Accurate approximate diagnosis of (controllable) stochastic systems (Q832093) (← links)
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems (Q1716666) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- Probabilistic system opacity in discrete event systems (Q1788695) (← links)
- Enforcement of opacity by public and private insertion functions (Q1797032) (← links)
- Opacity of networked discrete event systems (Q2053901) (← links)
- Information control in networked discrete event systems and its application to battery management systems (Q2197580) (← links)
- A novel approach for supervisor synthesis to enforce opacity of discrete event systems (Q2672457) (← links)
- A general language-based framework for specifying and verifying notions of opacity (Q2673762) (← links)
- (Q5136302) (← links)
- Privacy-preserving co-synthesis against sensor-actuator eavesdropping intruder (Q6100443) (← links)
- Online prognosis of stochastic discrete event systems with guaranteed performance bound (Q6136112) (← links)
- Enforcing opacity by insertion functions under multiple energy constraints (Q6198145) (← links)
- Quantifying opacity of discrete event systems modeled with probabilistic Petri nets (Q6539394) (← links)
