关于离散事件系统最大许可相似性控制的进一步研究
More on Maximally Permissive Similarity Control of Discrete Event Systems
AI总结：
本文指出Takai相似性控制构造在规范非像有限时失效，引入饱和(G, R)-自动机并建立元定理，从而修正其缺陷。
摘要：
Takai提出了一种为相似性控制问题构造最大许可监督器的方法（IEEE Transactions on Automatic Control, 66(7):3197-3204, 2021）。本文指出，当规范不是像有限（image-finite）时，该构造（不一定）有效。受Takai构造的启发，本文引入了（饱和）(G, R)-自动机的概念，并基于该概念给出了关于相似性控制问题的（最大许可）监督器的元定理。作为这些元定理的一个应用，Takai工作中的缺陷得到了修正。
英文摘要：
Takai proposed a method for constructing a maximally permissive supervisor for the similarity control problem (IEEE Transactions on Automatic Control, 66(7):3197-3204, 2021). This paper points out that this construction does not(necessarily) work when the specification is not image-finite. Inspired by Takai's construction, the notion of a (saturated) (G, R)-automaton is introduced and metatheorems concerning (maximally permissive) supervisors for the similarity control problem are provided in terms of this notion. As an application of these metatheorems, the flaws in Takai's work are corrected.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
