Estimation and inference in discrete event systems. A model-based approach with finite automata
From MaRDI portal
(Redirected from Publication:5243063)
Recommendations
Cited in
(36)- Estimation of discrete-event systems using interval computation
- Verification of approximate opacity for switched systems: a compositional approach
- On verification of D-detectability for discrete event systems
- Detectability of labeled weighted automata over monoids
- K-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
- Enforcement for infinite-step opacity and K-step opacity via insertion mechanism
- A framework for current-state opacity under dynamic information release mechanism
- Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection
- State estimation of max-plus automata with unobservable events
- A general language-based framework for specifying and verifying notions of opacity
- Strong current-state and initial-state opacity of discrete-event systems
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- Distributed diagnosis of discrete-event systems under dynamic event observations
- State-based opacity of labeled real-time automata
- Online prognosis of stochastic discrete event systems with guaranteed performance bound
- Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
- Probabilistic verification of diagnosability for a certain class of timed stochastic systems
- A language-based diagnosis framework for permanent and intermittent faults
- Diagnosability of fault patterns with labeled stochastic Petri nets
- On the verification of detectability for timed discrete event systems
- State estimation for constant-time labeled automata under dense time
- Obfuscation mechanism for simultaneous public event information release and private event information hiding in discrete event systems
- Tamper-tolerant diagnosability analysis and tampering detectability in discrete event systems under cost constraints
- Optimal sensor selection for diagnosability enforcement of discrete event systems using labeled Petri net
- A symbolic approach to the verification and enforcement of current-state opacity using labelled Petri nets
- Timed initial-state detectability of discrete-event systems by algebraic method
- State estimation for discrete-event systems with reliable states under sequential attacks
- Detectability of discrete event systems under sensor attacks
- Polynomial-time verification of pattern diagnosability for timed discrete event systems
- Joint opacity and opacity against state-estimate-intersection-based intrusion of discrete-event systems
- Always guarding you: strong initial-and-final-state opacity of discrete-event systems
- Verification and transformation for a trajectory-based weak K-step opacity
- Prognosability verification and enforcement in labeled Petri nets under observation delays and intermittent losses
- Enforcing opacity with publicly known edit functions under incomparable observations
- Observer design and opacity verification for a class of timed automata
- Models and estimation for systems with recurrent events and usage processes
This page was built for publication: Estimation and inference in discrete event systems. A model-based approach with finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243063)
