Complexity of deciding detectability in discrete event systems
TLDR
It is shown that it is not the case by considering DESs represented as deterministic finite automata without non-trivial cycles, which are structurally the simplest deadlock-freeDESs, that even for such very simple DESs, checking weak (periodic) detectability remains intractable.About:
This article is published in Automatica.The article was published on 2018-07-01 and is currently open access. It has received 48 citations till now.read more
Citations
More filters
Journal ArticleDOI
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
TL;DR: In this paper, it was shown that weak detectability, opacity, and A-diagnosability for modular discrete event systems are EXPSPACE-complete, and hence there is neither a polynomial-time nor a polygonal space algorithm for solving them.
Journal ArticleDOI
On detectability of labeled Petri nets and finite automata
Kuize Zhang,Alessandro Giua +1 more
TL;DR: In this article, it was shown that the problem of verifying strong detectability is decidable and EXPSPACE-hard for deterministic finite automata, where the decidability result holds under mild promptness assumption.
Journal ArticleDOI
Deciding detectability for labeled Petri nets
TL;DR: It is shown that for DESs modeled by labeled Petri nets, checking strong detectability is decidable whereas checking weak detectable is undecidable, and a result on checking current-state opacity for labeled PetRI nets is strengthened.
Posted Content
Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems
TL;DR: It is shown that for modular systems the problems are EXPSPACE-complete, and hence there is neither a polynomial-time nor a poynomial-space algorithm solving them.
Posted Content
Deciding Detectability for Labeled Petri Nets
TL;DR: In this paper, the authors investigated the verification of two detectability properties (strong detectability and weak detectability) for DESs modeled by labeled Petri nets and showed that strong detectability is decidable and weak detection is undecidable.
References
More filters
MonographDOI
Computational Complexity: A Modern Approach
Sanjeev Arora,Boaz Barak +1 more
TL;DR: This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.
Journal ArticleDOI
Nondeterministic space is closed under complementation
TL;DR: It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda.
Proceedings ArticleDOI
Lower bounds for natural proof systems
TL;DR: A lower space bound of n/log(n) is shown for the proof system for the PTIME complete theory and a lower length bound of 2cn/log('n'): length of polynomial space for the PSPACE complete theory.
Journal ArticleDOI
The method of forced enumeration for nondeterministic automata
TL;DR: Every family of languages, recognized by nondeterministic L(n) tape-bounded Turing machines, where L( n)≥logn, is closed under complement, and as a special case, the family of context-sensitive languages isclosed under complement.
Journal ArticleDOI
Observability of discrete event dynamic systems
C.M. Ozveren,Alan S. Willsky +1 more
TL;DR: In this article, a polynomial test for observability is given and a notion of resiliency is defined for observers, and a test for resilient observability and a procedure for the construction of a resilient observer are presented.