.png){kind=icon}
返回
Deciding detectability for labeled Petri nets
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2019.02.058.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Detectability of discrete event systems is a property to decide whether the current and subsequent states can be determined based on observations. We investigate the existence of algorithms for checking strong and weak detectability for systems modeled as labeled Petri nets. Strong detectability requires that we can always determine, after a finite number of observations, the current and subsequent markings of the system, while weak detectability requires that we can determine, after a finite number of observations, the current and subsequent markings for some trajectories of the system. We show that there is an algorithm to check strong detectability requiring exponential space, and that there is no algorithm to check weak detectability. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Discrete event systems
Petri nets
Detectability
Complexity
Decidability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets一种利用验证者网进行Petri网可诊断性分析的新方法
OAAI
OAAI分享收藏分享收藏
查看更多内容