Discrete-event systems subject to unknown sensor attacks

Página do item simplificado
dc.creatorMichel Rodrigo das Chagas Alves
dc.creatorPatrícia N. Pena
dc.creatorKaren Rudie
dc.date.accessioned2025-06-04T14:11:13Z
dc.date.accessioned2025-09-08T23:40:46Z
dc.date.available2025-06-04T14:11:13Z
dc.date.issued2022
dc.identifier.doihttps://doi.org/10.1007/s10626-021-00351-3
dc.identifier.issn15737594
dc.identifier.urihttps://hdl.handle.net/1843/82775
dc.languageeng
dc.publisherUniversidade Federal de Minas Gerais
dc.relation.ispartofDiscrete Event Dynamic Systems
dc.rightsAcesso Aberto
dc.subjectSistemas de tempo discreto
dc.subject.otherDiscrete-event system
dc.subject.otherSupervisory control
dc.subject.otherAttacks on output symbols
dc.subject.otherP-observability
dc.titleDiscrete-event systems subject to unknown sensor attacks
dc.typeArtigo de periódico
local.citation.epage158
local.citation.issue1
local.citation.spage143
local.citation.volume32
local.description.resumoThis work is set in the context of supervisory control of discrete-event systems under partial observation. Attackers that are able to insert or erase occurrences of particular output symbols can tamper with the supervisor’s observation and by doing so, can lead the controlled system to undesirable states. We consider a scenario with multiple attackers, each one being an element of a set, called the attack set. We also assume that only one of the attackers within an attack set is acting, although we don’t know which one. According to previous results in the literature, a supervisor that enforces a given legal language, regardless of which attacker is acting, can be designed if the legal language is controllable and satisfies a property called P-observability for an attack set. The latter is an extended notion of observability and is related with the supervisor’s ability to always distinguish between outputs that require different control actions, even if the outputs were attacked. We present a new approach for checking if a given language is P-observable for an attack set, by first introducing a visual representation as well as some definitions that capture the attack’s effect. Additionally, we present two algorithms that together allow us to verify if a given language is P-observable for an attack set, when it is represented as an automaton.
local.publisher.countryBrasil
local.publisher.departmentENG - DEPARTAMENTO DE ENGENHARIA ELETRÔNICA
local.publisher.initialsUFMG
local.url.externahttps://link.springer.com/article/10.1007/s10626-021-00351-3

Arquivos

Licença do pacote

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
License.txt
Tamanho:
1.99 KB
Formato:
Plain Text
Descrição:
Baixar

Coleções

Artigo de Periódico

Logo UFMG