Synthesis of covert actuator attackers for free

In this paper, we shall formulate and address a problem of covert actuator attacker synthesis for cyber-physical systems that are modeled by discrete-event systems. We assume the actuator attacker partially observes the execution of the closed-loop system and is able to modify each control command i...

Full description

Saved in:
Bibliographic Details
Main Authors: Lin, Liyong, Zhu, Yuting, Su, Rong
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/161646
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-161646
record_format dspace
spelling sg-ntu-dr.10356-1616462022-09-13T05:24:03Z Synthesis of covert actuator attackers for free Lin, Liyong Zhu, Yuting Su, Rong School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Cyber-Physical Systems Discrete-Event Systems In this paper, we shall formulate and address a problem of covert actuator attacker synthesis for cyber-physical systems that are modeled by discrete-event systems. We assume the actuator attacker partially observes the execution of the closed-loop system and is able to modify each control command issued by the supervisor on a specified attackable subset of controllable events. We provide straightforward but in general exponential-time reductions, due to the use of subset construction procedure, from the covert actuator attacker synthesis problems to the Ramadge-Wonham supervisor synthesis problems. It then follows that it is possible to use the many techniques and tools already developed for solving the supervisor synthesis problem to solve the covert actuator attacker synthesis problem for free. In particular, we show that, if the attacker cannot attack unobservable events to the supervisor, then the reductions can be carried out in polynomial time. We also provide a brief discussion on some other conditions under which the exponential blowup in state size can be avoided. Finally, we show how the reduction based synthesis procedure can be extended for the synthesis of successful covert actuator attackers that also eavesdrop the control commands issued by the supervisor. Ministry of Education (MOE) This work is financially supported by Singapore Ministry of Education Academic Research Grant RG91/18-(S)-SU RONG (VP), which is gratefully acknowledged. 2022-09-13T05:24:03Z 2022-09-13T05:24:03Z 2020 Journal Article Lin, L., Zhu, Y. & Su, R. (2020). Synthesis of covert actuator attackers for free. Discrete Event Dynamic Systems, 30(4), 561-577. https://dx.doi.org/10.1007/s10626-020-00312-2 0924-6703 https://hdl.handle.net/10356/161646 10.1007/s10626-020-00312-2 2-s2.0-85084261275 4 30 561 577 en RG91/18-(S)-SU RONG (VP) Discrete Event Dynamic Systems © 2020 Springer Science Business Media, LLC, part of Springer Nature. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
Cyber-Physical Systems
Discrete-Event Systems
spellingShingle Engineering::Electrical and electronic engineering
Cyber-Physical Systems
Discrete-Event Systems
Lin, Liyong
Zhu, Yuting
Su, Rong
Synthesis of covert actuator attackers for free
description In this paper, we shall formulate and address a problem of covert actuator attacker synthesis for cyber-physical systems that are modeled by discrete-event systems. We assume the actuator attacker partially observes the execution of the closed-loop system and is able to modify each control command issued by the supervisor on a specified attackable subset of controllable events. We provide straightforward but in general exponential-time reductions, due to the use of subset construction procedure, from the covert actuator attacker synthesis problems to the Ramadge-Wonham supervisor synthesis problems. It then follows that it is possible to use the many techniques and tools already developed for solving the supervisor synthesis problem to solve the covert actuator attacker synthesis problem for free. In particular, we show that, if the attacker cannot attack unobservable events to the supervisor, then the reductions can be carried out in polynomial time. We also provide a brief discussion on some other conditions under which the exponential blowup in state size can be avoided. Finally, we show how the reduction based synthesis procedure can be extended for the synthesis of successful covert actuator attackers that also eavesdrop the control commands issued by the supervisor.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Lin, Liyong
Zhu, Yuting
Su, Rong
format Article
author Lin, Liyong
Zhu, Yuting
Su, Rong
author_sort Lin, Liyong
title Synthesis of covert actuator attackers for free
title_short Synthesis of covert actuator attackers for free
title_full Synthesis of covert actuator attackers for free
title_fullStr Synthesis of covert actuator attackers for free
title_full_unstemmed Synthesis of covert actuator attackers for free
title_sort synthesis of covert actuator attackers for free
publishDate 2022
url https://hdl.handle.net/10356/161646
_version_ 1744365413523783680