On the Notion of Uncontrollable Marking in Supervisory Control of Petri Nets
On the Notion of Uncontrollable Marking in Supervisory Control of Petri Nets
复制标题
DOI：
10.1109/tac.2014.2320801
复制
发表时间：
2014-04
影响因子：
6.8
通讯作者：
Bruno Lacerda;P. Lima
中科院分区：
文献类型：
--
作者：
Bruno Lacerda;P. Lima
通过一个反例，我们证明了在有关Petri网监督控制理论的文献中通常使用的不可控标记的概念是不合理的。我们还说明了如何修正这个定义，并为检查表示为确定性Petri网语言的规格说明的可控性问题提供了一个可判断性证明的改编。
We show that the notion of uncontrollable marking commonly used in the literature on supervisory control theory of Petri nets is not sound, by means of a counter-example. We also show how the definition can be corrected and provide an adaptation of a decidability proof for the problem of checking controllability for specifications expressed as deterministic Petri net languages.