• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IFAC PapersOnLine >Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets
【24h】

Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets

机译：使用Petri网的基于语言的不透明性验证的深度搜索方法

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The rapidly growing use of modern computer-integrated systems involving critical assets underscores the need for developing measures to guarantee their security against malicious attacks. This paper deals with the problem of language-based opacity formulation and verification in the framework of discrete event systems modeled with partially observed Petri nets (POPNs). In this context, a secret behavior is defined as a sub-language that should be hidden from an intruder who partially observes the system’s evolution. A Petri net system is qualified as language opaque if no observation leads to an event sequence estimation that is entirely contained in a secret. In this paper, we develop a depth-first search algorithm that verifies the language opacity of a POPN system. More specifically, the proposed algorithm checks the existence of a non-secret transition sequence that is observably equivalent to a secret one by performing a depth-first search on a portion of the system’s execution. Complexity analysis and experimental results are presented to illustrate the efficiency of the proposed approach.
机译：涉及关键资产的现代计算机集成系统的快速增长利用强调了需要制定措施，以保证其对恶意攻击的安全。本文涉及基于语言的不透明度制定和验证的分立事件系统框架，其与部分观察到的Petri网（Popns）建模。在这种情况下，秘密行为被定义为应从部分观察系统演变的入侵者隐藏的子语言。如果没有观察到秘密完全包含的事件序列估计，则培养净净系统被称为语言不透明。在本文中，我们开发了一个深度第一搜索算法，验证了POPN系统的语言不透明度。更具体地，所提出的算法通过在系统执行的一部分上执行深度首先搜索来检查非秘密转换序列的存在，该非秘密转换序列是可观察地等同于秘密的秘密。提出了复杂性分析和实验结果以说明所提出的方法的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号