On Verification of Strong Periodic D-Detectability for Discrete Event Systems
@article{Balun2019OnVO, title={On Verification of Strong Periodic D-Detectability for Discrete Event Systems}, author={Jivr'i Balun and T. Masopust}, journal={ArXiv}, year={2019}, volume={abs/1912.07312} }
Detectability of discrete event systems has been introduced as a generalization of other state-estimation properties studied in the literature, including stability or observability. It is a property whether the current and subsequent states of a systems can be determined based on observations. Since the requirement to exactly determine the current and subsequent states may be too strict in some applications, a relaxed notion of D-detectability has been introduced, distinguishing only certain… CONTINUE READING
Figures and Topics from this paper
References
SHOWING 1-10 OF 29 REFERENCES
Generalized detectability for discrete event systems
- Mathematics, Computer Science
- Syst. Control. Lett.
- 2011
- 68
- Highly Influential
Detectability of Discrete Event Systems
- Mathematics, Computer Science
- IEEE Transactions on Automatic Control
- 2007
- 55
- PDF
Complexity of Deciding Detectability in Discrete Event Systems
- Mathematics, Computer Science
- Autom.
- 2018
- 23
- PDF
Delayed Detectability of Discrete Event Systems
- Mathematics, Computer Science
- IEEE Transactions on Automatic Control
- 2013
- 38
The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete
- Mathematics, Computer Science
- Autom.
- 2017
- 26
State Estimation and Detectability of Networked Discrete Event Systems with Multi-Channel Communication Networks
- Computer Science
- 2019 American Control Conference (ACC)
- 2019
- 8
Verification complexity of a class of observational properties for modular discrete events systems
- Mathematics, Computer Science
- Autom.
- 2017
- 23
- PDF