Divergence Properties of Labeled Petri Nets and Their Relevance for Diagnosability Analysis

Divergence Properties of Labeled Petri Nets and Their Relevance for Diagnosability Analysis
复制标题

DOI:
10.1109/tac.2019.2947650
复制
发表时间:
2020-07
影响因子:
6.8
通讯作者:
A. Giua;S. Lafortune;C. Seatzu
A. Giua;S. Lafortune;C. Seatzu
中科院分区:
计算机科学2区
文献类型:
--
作者:
A. Giua;S. Lafortune;C. Seatzu

文献摘要

被引文献

相似文献

在这篇文章中,我们专注于标记Petri网和形式化的两个属性,语言分歧和标记分歧,讨论其相关性的可诊断性分析。特别是,我们回顾了结果的可诊断性和$K$-可诊断性提出的一篇文章,题为“一种新的方法,可诊断性分析的Petri网使用验证器网”,我们合著。我们证明了这些结果适用于无语言分歧的网络,这是一篇文章中没有明确提到的假设。此外,我们还提供了一个替代的结构假设--该假设不需要测试无发散性的行为属性--在该假设下,上述结果成立。
In this note, we focus on labeled Petri nets and formalize two properties, language divergence and marking divergence, discussing their relevance for diagnosability analysis. In particular, we review the results for diagnosability and $K$-diagnosability presented in an article entitled “A new approach for diagnosability analysis of Petri nets using verifier nets” that we coauthored. We show that these results apply to nets that are language divergence-free, an assumption that was not explicitly mentioned in that article. In addition, we also provide an alternative structural assumption—which does not require testing the behavioral property of divergence-freeness—under which the above results hold.