Overview of discrete event systems opacity: Models, validation, and quantification

被引:152
作者
Jacob, Romain [1 ]
Lesage, Jean-Jacques [1 ]
Faure, Jean-Marc [2 ]
机构
[1] Univ Paris Saclay, Univ Paris 11, ENS Cachan, LURPA, F-94235 Cachan, France
[2] Univ Paris Saclay, Univ Paris 11, ENS Cachan, LURPA,Supmeca, F-94235 Cachan, France
关键词
Opacity; Discrete event systems; Validation; Verification; Enforcement; Quantification; Secrecy; Privacy; Security; ENFORCING SUPERVISORY STRATEGIES; VERIFICATION; SECRECY;
D O I
10.1016/j.arcontrol.2016.04.015
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Over the last decade, opacity of discrete event systems (DES) has become a very fertile field of research. Driven by safety and privacy concerns in network communications and online services, much theoretical work has been conducted in order to design opaque systems. A system is opaque if an external observer in unable to infer a "secret" about the system behavior. This paper aims to review the most commonly used techniques of opacity validation for deterministic models and opacity quantification for probabilistic ones. Available complexity results are also provided. Finally, we review existing tools for opacity validation and current applications. (C) 2016 International Federation of Automatic Control. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:135 / 146
页数:12
相关论文
共 74 条
[1]  
Alur R, 2006, LECT NOTES COMPUT SC, V4052, P107
[2]  
[Anonymous], CSTR1304 NEWC U
[3]  
[Anonymous], P IEEE INT C ROB AUT
[4]  
[Anonymous], THESIS
[5]  
[Anonymous], ABS14090871 CORR
[6]  
[Anonymous], ACM Transactions on Information and System Security (TISSEC), DOI DOI 10.1145/290163.290168
[7]  
[Anonymous], 2005, IACR CRYPTOL EPRINT
[8]  
[Anonymous], P 19 INT S MATH THEO
[9]  
[Anonymous], THESIS U RENNES 1
[10]  
[Anonymous], 2011, THESIS U ILLINOIS UR