文章基本信息

标题：Insertion Functions with Memory for Opacity Enforcement ⁎
本地全文：下载
作者：Christoforos Keroglou ; Laurie Ricker ; Stéphane Lafortune 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2018
卷号：51
期号：7
页码：394-399
DOI：10.1016/j.ifacol.2018.06.331
语种：English
出版社：Elsevier
摘要：AbstractWe investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing opacity under the assumption that the insertion functions were based on the observed system strings. Now, we investigate an extension of the previous method introducing ak-memory insertion mechanism. In this case, we storekconsecutive events and we compute an insertion function for aklength event sequence. Thek-memory insertion mechanism can be applied to a broader class of systems than the previously proposed insertion mechanism. The first contribution of this paper is the introduction ofik-enforceability. A system isik-enforceable if we can applyk-memory insertion mechanism to enforce privacy. The second contribution of this paper is the development of a verification algorithm for ik-enforceability.
关键词：KeywordsOpacityDiscrete Event SystemsPrivacyFinite Automata