Pub Date : 2022-04-04DOI: 10.48550/arXiv.2204.01286
Jivr'i Balun, Tomas Masopust
Opacity is an important system-theoretic property expressing whether a system may reveal its secret to a passive observer (an intruder) who knows the structure of the system but has only limited observations of its behavior. Several notions of opacity have been discussed in the literature, including current-state opacity, k-step opacity, and infinite-step opacity. We investigate weak and strong k-step opacity, the notions that generalize both current-state opacity and infinite-step opacity, and ask whether the intruder is not able to decide, at any instant, when respectively whether the system was in a secret state during the last k observable steps. We design a new algorithm verifying weak k-step opacity, the complexity of which is lower than the complexity of existing algorithms and does not depend on the parameter k, and show how to use it to verify strong k-step opacity by reducing strong k-step opacity to weak k-step opacity. The complexity of the resulting algorithm is again better than the complexity of existing algorithms and does not depend on the parameter k.
{"title":"Verifying Weak and Strong k-Step Opacity in Discrete-Event Systems","authors":"Jivr'i Balun, Tomas Masopust","doi":"10.48550/arXiv.2204.01286","DOIUrl":"https://doi.org/10.48550/arXiv.2204.01286","url":null,"abstract":"Opacity is an important system-theoretic property expressing whether a system may reveal its secret to a passive observer (an intruder) who knows the structure of the system but has only limited observations of its behavior. Several notions of opacity have been discussed in the literature, including current-state opacity, k-step opacity, and infinite-step opacity. We investigate weak and strong k-step opacity, the notions that generalize both current-state opacity and infinite-step opacity, and ask whether the intruder is not able to decide, at any instant, when respectively whether the system was in a secret state during the last k observable steps. We design a new algorithm verifying weak k-step opacity, the complexity of which is lower than the complexity of existing algorithms and does not depend on the parameter k, and show how to use it to verify strong k-step opacity by reducing strong k-step opacity to weak k-step opacity. The complexity of the resulting algorithm is again better than the complexity of existing algorithms and does not depend on the parameter k.","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"217 1","pages":"111153"},"PeriodicalIF":0.0,"publicationDate":"2022-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83003893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-01DOI: 10.1016/j.automatica.2021.110111
M. Ghanes, J. Moreno, J. Barbot
{"title":"Arbitrary order differentiator with varying homogeneity degree","authors":"M. Ghanes, J. Moreno, J. Barbot","doi":"10.1016/j.automatica.2021.110111","DOIUrl":"https://doi.org/10.1016/j.automatica.2021.110111","url":null,"abstract":"","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"15 1","pages":"110111"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73105357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-01DOI: 10.1016/j.automatica.2021.110153
Ci Chen, F. Lewis, Bo Li
{"title":"Homotopic policy iteration-based learning design for unknown linear continuous-time systems","authors":"Ci Chen, F. Lewis, Bo Li","doi":"10.1016/j.automatica.2021.110153","DOIUrl":"https://doi.org/10.1016/j.automatica.2021.110153","url":null,"abstract":"","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"56 1","pages":"110153"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86834166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-01DOI: 10.1016/j.automatica.2021.110154
Yong Xu, Weijun Lv, Weiqun Lin, Renquan Lu, D. Quevedo
{"title":"On extended state estimation for nonlinear uncertain systems with round-robin protocol","authors":"Yong Xu, Weijun Lv, Weiqun Lin, Renquan Lu, D. Quevedo","doi":"10.1016/j.automatica.2021.110154","DOIUrl":"https://doi.org/10.1016/j.automatica.2021.110154","url":null,"abstract":"","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"1 1","pages":"110154"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90448545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-01DOI: 10.1016/j.automatica.2022.110169
G. Pillonetto, A. Chiuso
{"title":"Linear system identification using the sequential stabilizing spline algorithm","authors":"G. Pillonetto, A. Chiuso","doi":"10.1016/j.automatica.2022.110169","DOIUrl":"https://doi.org/10.1016/j.automatica.2022.110169","url":null,"abstract":"","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"24 1","pages":"110169"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73898032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-01DOI: 10.1016/j.automatica.2021.110109
Weiwei Hu, M. Demetriou, Xin Tian, N. Gatsonis
{"title":"Hybrid domain decomposition filters for advection-diffusion PDEs with mobile sensors","authors":"Weiwei Hu, M. Demetriou, Xin Tian, N. Gatsonis","doi":"10.1016/j.automatica.2021.110109","DOIUrl":"https://doi.org/10.1016/j.automatica.2021.110109","url":null,"abstract":"","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"37 1","pages":"110109"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78058468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-01DOI: 10.1016/j.automatica.2021.110147
V. Marco, J. Kalkkuhl, J. Raisch, T. Seel
{"title":"Regularized adaptive Kalman filter for non-persistently excited systems","authors":"V. Marco, J. Kalkkuhl, J. Raisch, T. Seel","doi":"10.1016/j.automatica.2021.110147","DOIUrl":"https://doi.org/10.1016/j.automatica.2021.110147","url":null,"abstract":"","PeriodicalId":13196,"journal":{"name":"IEEE Robotics Autom. Mag.","volume":"90 1","pages":"110147"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78404028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：