Metraipolis › archive › dc_8411bd6bbb11
CA-Observability of Discrete Event Systems under Cyber Attacks — arXiv:2610.08263
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08263
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T21:07:18.225Z
- SHA-256 of the archived text
07fcd29783820d20ae3fb51f6f812482b14631b7b9d77738f30a9bfe39fea3df- Stable URL of this page
https://metraipolis.com/documento/dc_8411bd6bbb11
How to cite
CA-Observability of Discrete Event Systems under Cyber Attacks — arXiv:2610.08263 — arXiv (en), https://arxiv.org/abs/2610.08263 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8411bd6bbb11 (Metraipolis archive dc_8411bd6bbb11, sha256 07fcd29783820d20ae3fb51f6f812482b14631b7b9d77738f30a9bfe39fea3df)
BibTeX
@misc{dc8411bd6bbb11,
title = {CA-Observability of Discrete Event Systems under Cyber Attacks — arXiv:2610.08263},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08263},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8411bd6bbb11; sha256 07fcd29783820d20ae3fb51f6f812482b14631b7b9d77738f30a9bfe39fea3df},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08263. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In a previous paper, we investigate the control problem of discrete event systems under cyber attacks, where CA-controllability and CA-observability are proposed. We prove that a discrete event system can be controlled to generate a specification language K if and only if K is CA-controllable and CA-observable. While CA controllability can be "converted" to (conventional) controllability, CA-observability cannot be "converted" to (conventional) observability. In this paper, we further investigate CA-observability. We develop a method and an algorithm to check CA-observability. The method involves constructing an augmented automaton whose states are pairs of the current state and state estimate of the supervised system. We prove that K is CA-observable if and only if the language generated by the augmented automaton is equal to K. An algorithm is then developed to check CA-observability. We also investigate the properties of CA-observability. We show that CA-observability is not closed under (set) in tersection. Note that (conventional) observability is closed under intersection. We further show that CA-observability is not closed under union. This is similar to observability. If K is not CA-controllable and CA-observable, we pro pose a method to calculate a CA-controllable and CA observable sublanguage. We first calculate the supremal CA-controllable sublanguage for K which can be described by a sub-automaton of the automaton for K. We then propose a state-estimate-based supervisor based on the subautomaton, which ensures the supervised system stays within K. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2610.08263 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T20:38:49.117Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).