The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
From MaRDI portal
Publication:2409237
DOI10.1016/J.AUTOMATICA.2017.03.023zbMATH Open1372.93143OpenAlexW2606674369MaRDI QIDQ2409237FDOQ2409237
Authors: Kuize Zhang 
Publication date: 11 October 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.03.023
Recommendations
Complexity and performance of numerical algorithms (65Y20) Discrete event control/observation systems (93C65)
Cites Work
- Supervisory Control of a Class of Discrete Event Processes
- Finite-automaton aperiodicity is PSPACE-complete
- Observability of discrete event dynamic systems
- An introduction to formal languages and automata.
- Detectability of Discrete Event Systems
- Delayed Detectability of Discrete Event Systems
- Generalized detectability for discrete event systems
Cited In (15)
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Deciding detectability for labeled Petri nets
- Trajectory detectability of discrete-event systems
- Verification of C-detectability using Petri nets
- Analysis of strong and strong periodic detectability of bounded labeled Petri nets
- On detectability of labeled Petri nets and finite automata
- Complexity of deciding detectability in discrete event systems
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- On verification of D-detectability for discrete event systems
- Matrix approach to detectability of discrete event systems
- An improved approach for verifying delayed detectability of discrete-event systems
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- Path detectability verification for time-dependent systems with application to flexible manufacturing systems
- Detectability of labeled weighted automata over monoids
- On the verification of detectability for timed discrete event systems
This page was built for publication: The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409237)
