Initial-state detectability and initial-state opacity of unambiguous weighted automata
From MaRDI portal
Publication:2664211
DOI10.1016/j.automatica.2021.109490zbMath1461.93051OpenAlexW3127064320MaRDI QIDQ2664211
Aiwen Lai, Sébastien Lahaye, Zhiwu Li
Publication date: 20 April 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109490
Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Observability (93B07)
Cites Work
- Unnamed Item
- Determinization of timed Petri nets behaviors
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- Verification of initial-state opacity in security applications of discrete event systems
- Generalized detectability for discrete event systems
- Handbook of weighted automata
- Verification of detectability in probabilistic finite automata
- Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Deciding detectability for labeled Petri nets
- Detectability of networked discrete event systems
- State estimation of max-plus automata with unobservable events
- Compositions of (max,+) automata
- 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
- The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Modeling and analysis of timed Petri nets using heaps of pieces
- A polynomial algorithm for testing diagnosability of discrete-event systems
- Diagnosability of discrete-event systems
- Performance evaluation of (max,+) automata
- Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach
- Delayed Detectability of Discrete Event Systems
This page was built for publication: Initial-state detectability and initial-state opacity of unambiguous weighted automata
