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

• Autores: Kuize Zhang
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 81, 2017, págs. 217-220
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Abstract In Shu and Lin, 2011, exponential time (actually polynomial space) algorithms for determining the weak detectability and weak periodic detectability of nondeterministic discrete event systems (DESs) are designed. In this paper, we prove that the problems of determining the weak detectability and weak periodic detectability of deterministic DESs are both PSPACE-hard (hence PSPACE-complete). Then as corollaries, the problems of determining the weak detectability and weak periodic detectability of nondeterministic DESs are also PSPACE-hard (hence PSPACE-complete).