Name
Abstract | ||
|---|---|---|
Detectability of discrete event systems, defined as the ability to determine the current and subsequent states, is very important in diagnosis, control, and many other applications. So far only detectability of non-networked discrete event systems has been defined and investigated. Non-networked discrete event systems assume that all the communications are reliable and instantaneous without any delays or losses. This assumption is often violated in networked systems. In this paper, we study detectability for networked discrete event systems. We investigate the impact of communication delays and losses on detectability. We define two classes of detectabilities: network detectability for determining the state of a networked discrete event systems and network D-detectability for distinguishing certain pairs of states of the systems. Necessary and sufficient conditions for network detectability and network D-detectability are derived. Methods to check network detectability and network D-detectability are also developed. Examples are given to illustrate the results. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10626-018-0268-y | Discrete Event Dynamic Systems |
Keywords | Field | DocType |
Discrete event systems,Networked systems,Detectability,State estimation,Diagnosability | Mathematical optimization,Algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 3 | 0924-6703 |
Citations | PageRank | References |
1 | 0.35 | 33 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yazeed Sasi | 1 | 1 | 0.35 |
| Feng Lin | 2 | 177 | 18.34 |