Current-State Opacity Formulations in Probabilistic Finite Automata
From MaRDI portal
Publication:2983295
DOI10.1109/TAC.2013.2279914zbMath1360.68570MaRDI QIDQ2983295
Christoforos N. Hadjicostis, Anooshiravan Saboori
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items (25)
Accurate approximate diagnosis of (controllable) stochastic systems ⋮ Current-state opacity and initial-state opacity of modular discrete event systems ⋮ Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures ⋮ A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers ⋮ Compositional synthesis of opacity-preserving finite abstractions for interconnected systems ⋮ Strong current-state and initial-state opacity of discrete-event systems ⋮ Game current-state opacity formulation in probabilistic resource automata ⋮ Online prognosis of stochastic discrete event systems with guaranteed performance bound ⋮ Differential privacy for symbolic systems with application to Markov chains ⋮ Information control in networked discrete event systems and its application to battery management systems ⋮ Privacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observers ⋮ Detection-averse optimal and receding-horizon control for Markov decision processes ⋮ Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems ⋮ Probabilistic opacity for Markov decision processes ⋮ Reachability and controllability analysis of probabilistic finite automata via a novel matrix method ⋮ Current-state opacity modelling and verification in partially observed Petri nets ⋮ Opacity for linear constraint Markov chains ⋮ Probabilistic system opacity in discrete event systems ⋮ Enforcement of opacity by public and private insertion functions ⋮ On-line verification of current-state opacity by Petri nets and integer linear programming ⋮ Relative predictability of failure event occurrences and its opacity-based test algorithm ⋮ Opacity of networked discrete event systems ⋮ Enforcing current-state opacity through shuffle and deletions of event observations ⋮ Unnamed Item ⋮ Stabilization of probabilistic finite automata based on semi-tensor product of matrices
This page was built for publication: Current-State Opacity Formulations in Probabilistic Finite Automata
