The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete

DOI10.1016/j.automatica.2017.03.023zbMath1372.93143OpenAlexW2606674369MaRDI QIDQ2409237

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

zbMATH Keywords

discrete event systemfinite automatonPSPACE-hardnessweak (periodic) detectability

Mathematics Subject Classification ID

Related Items (13)

An improved approach for verifying delayed detectability of discrete-event systems ⋮ Initial-state detectability and initial-state opacity of unambiguous weighted automata ⋮ On detectability of labeled Petri nets and finite automata ⋮ Trajectory detectability of discrete-event systems ⋮ Complexity of detectability, opacity and A-diagnosability for modular discrete event systems ⋮ Deciding detectability for labeled Petri nets ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ Verification of C-detectability using Petri nets ⋮ Complexity of deciding detectability in discrete event systems ⋮ Analysis of strong and strong periodic detectability of bounded labeled Petri nets ⋮ On verification of D-detectability for discrete event systems ⋮ Matrix approach to detectability of discrete event systems ⋮ Detectability of labeled weighted automata over monoids

Cites Work

• Unnamed Item
• Generalized detectability for discrete event systems
• Finite-automaton aperiodicity is PSPACE-complete
• Observability of discrete event dynamic systems
• Supervisory Control of a Class of Discrete Event Processes
• Detectability of Discrete Event Systems
• Delayed Detectability of Discrete Event Systems

This page was built for publication: The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete