Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement

被引:26
作者
Mohajerani, Sahar [1 ]
Ji, Yiding [1 ]
Lafortune, Stephane [1 ]
机构
[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
基金
瑞典研究理事会; 美国国家科学基金会;
关键词
Automata; Observers; Supervisory control; Synchronization; Discrete-event systems; Computational modeling; Computational complexity; Abstraction; edit function; finite-state automata; modular systems; opacity; DISCRETE-EVENT SYSTEMS; INFINITE-STEP OPACITY; SUPERVISORY CONTROL; VERIFICATION; VALIDATION; COMPLEXITY; SECURITY; NOTIONS;
D O I
10.1109/TAC.2019.2946165
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article develops a novel compositional and abstraction-based approach to synthesize edit functions for opacity enforcement in modular discrete event systems. Edit functions alter the output of the system by erasing or inserting events in order to obfuscate the outside intruder, whose goal is to infer the secrets of the system from its observation. We synthesize edit functions to solve the opacity enforcement problem in a modular setting, which significantly reduces the computational complexity compared with the monolithic approach. Two abstraction methods called opaque observation equivalence and opaque bisimulation are first employed to abstract the individual components of the modular system and their observers. Subsequently, we propose a method to transform the synthesis of edit functions to the calculation of modular supremal nonblocking supervisors. We show that the edit functions synthesized in this manner correctly solve the opacity enforcement problem.
引用
收藏
页码:3349 / 3364
页数:16
相关论文
共 55 条
[1]  
[Anonymous], 1989, COMMUNICATION CONCUR
[2]   Probabilistic opacity for Markov decision processes [J].
Berard, Beatrice ;
Chatterjee, Krishnendu ;
Sznajder, Nathalie .
INFORMATION PROCESSING LETTERS, 2015, 115 (01) :52-59
[3]   Opacity generalised to transition systems [J].
Bryans, Jeremy W. ;
Koutny, Maciej ;
Mazare, Laurent ;
Ryan, Peter Y. A. .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2008, 7 (06) :421-435
[4]   Modelling Opacity Using Petri Nets [J].
Bryans, Jeremy W. ;
Koutny, Maciej ;
Ryan, Peter Y. A. .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 121 :101-115
[5]  
Cassandras C.G., 2008, INTRO DISCRETE EVENT
[6]   Synthesis of opaque systems with static and dynamic masks [J].
Cassez, Franck ;
Dubreil, Jeremy ;
Marchand, Herve .
FORMAL METHODS IN SYSTEM DESIGN, 2012, 40 (01) :88-115
[7]   Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems [J].
Chedor, Sebastien ;
Morvan, Christophe ;
Pinchinat, Sophie ;
Marchand, Herve .
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2015, 25 (1-2) :271-294
[8]   Quantification of Secrecy in Partially Observed Stochastic Discrete Event Systems [J].
Chen, Jun ;
Ibrahim, Mariam ;
Kumar, Ratnesh .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2017, 14 (01) :185-195
[9]   Enforcing opacity of regular predicates on modal transition systems [J].
Darondeau, Philippe ;
Marchand, Herve ;
Ricker, Laurie .
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2015, 25 (1-2) :251-270
[10]   Supervisory Control for Opacity [J].
Dubreil, Jeremy ;
Darondeau, Philippe ;
Marchand, Herve .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2010, 55 (05) :1089-1100