Current-State Opacity Formulations in Probabilistic Finite Automata
From MaRDI portal
Cited in
(33)- Detection-averse optimal and receding-horizon control for Markov decision processes
- Current-state opacity modelling and verification in partially observed Petri nets
- Application of differential privacy in smart building systems
- Accurate approximate diagnosis of (controllable) stochastic systems
- Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
- Opacity of networked discrete event systems
- Online prognosis of stochastic discrete event systems with guaranteed performance bound
- Relative predictability of failure event occurrences and its opacity-based test algorithm
- Verification of current-state opacity and opaque time for labeled time Petri net systems
- Strong current-state and initial-state opacity of discrete-event systems
- Probabilistic opacity for Markov decision processes
- Differential privacy for symbolic systems with application to Markov chains
- Privacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observers
- Probabilistic disclosure: maximisation vs. minimisation
- Decidability of the initial-state opacity of real-time automata
- A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers
- Opacity of finite automata
- Reachability and controllability analysis of probabilistic finite automata via a novel matrix method
- New insights into opacity verification in timed discrete-event systems
- Opacity enforcement in discrete event systems using differential privacy
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Current-state opacity and initial-state opacity of modular discrete event systems
- Stabilization of probabilistic finite automata based on semi-tensor product of matrices
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- Enforcing current-state opacity through shuffle and deletions of event observations
- Opacity for linear constraint Markov chains
- Probabilistic system opacity in discrete event systems
- Enforcement of opacity by public and private insertion functions
- Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
- Information control in networked discrete event systems and its application to battery management systems
- Quantifying opacity of discrete event systems modeled with probabilistic Petri nets
- Game current-state opacity formulation in probabilistic resource automata
- Infinite-step opacity and K-step opacity of stochastic discrete-event systems
This page was built for publication: Current-State Opacity Formulations in Probabilistic Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983295)
