Discrete-event systems subject to unknown sensor attacks

• Published in: Discrete event dynamic systems Vol. 32; no. 1; pp. 143 - 158
• Main Authors: Alves, Michel R. C., Pena, Patrícia N., Rudie, Karen
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.03.2022; Springer Nature B.V
• Subjects: Algorithms; Control; Convex and Discrete Geometry; Discrete event systems; Electrical Engineering; Machines; Manufacturing; Mathematics; Mathematics and Statistics; Operations Research/Decision Theory; Processes; Supervisory control; Systems Theory; Visual observation; Attacks on output symbols; Supervisory control; Discrete-event system; P-observability
• DOI: 10.1007/s10626-021-00351-3
• ISSN: 0924-6703

This 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.