对抗环境下度量区间时间逻辑目标的鲁棒满足

IF 0.6 Q4 ECONOMICS
Games Pub Date : 2023-03-30 DOI:10.3390/g14020030
Luyao Niu, B. Ramasubramanian, Andrew Clark, R. Poovendran
{"title":"对抗环境下度量区间时间逻辑目标的鲁棒满足","authors":"Luyao Niu, B. Ramasubramanian, Andrew Clark, R. Poovendran","doi":"10.3390/g14020030","DOIUrl":null,"url":null,"abstract":"This paper studies the synthesis of controllers for cyber-physical systems (CPSs) that are required to carry out complex time-sensitive tasks in the presence of an adversary. The time-sensitive task is specified as a formula in the metric interval temporal logic (MITL). CPSs that operate in adversarial environments have typically been abstracted as stochastic games (SGs); however, because traditional SG models do not incorporate a notion of time, they cannot be used in a setting where the objective is time-sensitive. To address this, we introduce durational stochastic games (DSGs). DSGs generalize SGs to incorporate a notion of time and model the adversary’s abilities to tamper with the control input (actuator attack) and manipulate the timing information that is perceived by the CPS (timing attack). We define notions of spatial, temporal, and spatio-temporal robustness to quantify the amounts by which system trajectories under the synthesized policy can be perturbed in space and time without affecting satisfaction of the MITL objective. In the case of an actuator attack, we design computational procedures to synthesize controllers that will satisfy the MITL task along with a guarantee of its robustness. In the presence of a timing attack, we relax the robustness constraint to develop a value iteration-based procedure to compute the CPS policy as a finite-state controller to maximize the probability of satisfying the MITL task. A numerical evaluation of our approach is presented on a signalized traffic network to illustrate our results.","PeriodicalId":35065,"journal":{"name":"Games","volume":"14 1","pages":"30"},"PeriodicalIF":0.6000,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust Satisfaction of Metric Interval Temporal Logic Objectives in Adversarial Environments\",\"authors\":\"Luyao Niu, B. Ramasubramanian, Andrew Clark, R. Poovendran\",\"doi\":\"10.3390/g14020030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the synthesis of controllers for cyber-physical systems (CPSs) that are required to carry out complex time-sensitive tasks in the presence of an adversary. The time-sensitive task is specified as a formula in the metric interval temporal logic (MITL). CPSs that operate in adversarial environments have typically been abstracted as stochastic games (SGs); however, because traditional SG models do not incorporate a notion of time, they cannot be used in a setting where the objective is time-sensitive. To address this, we introduce durational stochastic games (DSGs). DSGs generalize SGs to incorporate a notion of time and model the adversary’s abilities to tamper with the control input (actuator attack) and manipulate the timing information that is perceived by the CPS (timing attack). We define notions of spatial, temporal, and spatio-temporal robustness to quantify the amounts by which system trajectories under the synthesized policy can be perturbed in space and time without affecting satisfaction of the MITL objective. In the case of an actuator attack, we design computational procedures to synthesize controllers that will satisfy the MITL task along with a guarantee of its robustness. In the presence of a timing attack, we relax the robustness constraint to develop a value iteration-based procedure to compute the CPS policy as a finite-state controller to maximize the probability of satisfying the MITL task. A numerical evaluation of our approach is presented on a signalized traffic network to illustrate our results.\",\"PeriodicalId\":35065,\"journal\":{\"name\":\"Games\",\"volume\":\"14 1\",\"pages\":\"30\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Games\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/g14020030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/g14020030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了在对手存在的情况下执行复杂的时间敏感任务所需的网络物理系统(CPSs)控制器的合成。时间敏感任务被指定为度量间隔时间逻辑(MITL)中的公式。在对抗性环境中操作的CPS通常被抽象为随机游戏(SG);然而,由于传统的SG模型没有包含时间的概念,因此不能在目标对时间敏感的环境中使用。为了解决这个问题,我们引入了持续随机对策(DSG)。DSG将SG概括为包含时间的概念,并对对手篡改控制输入(致动器攻击)和操纵CPS感知的定时信息(定时攻击)的能力进行建模。我们定义了空间、时间和时空鲁棒性的概念,以量化在不影响MITL目标满意度的情况下,在合成策略下系统轨迹在空间和时间上可能受到干扰的量。在执行器攻击的情况下,我们设计计算程序来合成满足MITL任务的控制器,同时保证其鲁棒性。在存在定时攻击的情况下,我们放松了鲁棒性约束,开发了一个基于值迭代的过程,将CPS策略计算为有限状态控制器,以最大限度地提高满足MITL任务的概率。在信号交通网络上对我们的方法进行了数值评估,以说明我们的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust Satisfaction of Metric Interval Temporal Logic Objectives in Adversarial Environments
This paper studies the synthesis of controllers for cyber-physical systems (CPSs) that are required to carry out complex time-sensitive tasks in the presence of an adversary. The time-sensitive task is specified as a formula in the metric interval temporal logic (MITL). CPSs that operate in adversarial environments have typically been abstracted as stochastic games (SGs); however, because traditional SG models do not incorporate a notion of time, they cannot be used in a setting where the objective is time-sensitive. To address this, we introduce durational stochastic games (DSGs). DSGs generalize SGs to incorporate a notion of time and model the adversary’s abilities to tamper with the control input (actuator attack) and manipulate the timing information that is perceived by the CPS (timing attack). We define notions of spatial, temporal, and spatio-temporal robustness to quantify the amounts by which system trajectories under the synthesized policy can be perturbed in space and time without affecting satisfaction of the MITL objective. In the case of an actuator attack, we design computational procedures to synthesize controllers that will satisfy the MITL task along with a guarantee of its robustness. In the presence of a timing attack, we relax the robustness constraint to develop a value iteration-based procedure to compute the CPS policy as a finite-state controller to maximize the probability of satisfying the MITL task. A numerical evaluation of our approach is presented on a signalized traffic network to illustrate our results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Games
Games Decision Sciences-Statistics, Probability and Uncertainty
CiteScore
1.60
自引率
11.10%
发文量
65
审稿时长
11 weeks
期刊介绍: Games (ISSN 2073-4336) is an international, peer-reviewed, quick-refereeing open access journal (free for readers), which provides an advanced forum for studies related to strategic interaction, game theory and its applications, and decision making. The aim is to provide an interdisciplinary forum for all behavioral sciences and related fields, including economics, psychology, political science, mathematics, computer science, and biology (including animal behavior). To guarantee a rapid refereeing and editorial process, Games follows standard publication practices in the natural sciences.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信