Abstract
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 flaws in his results by providing a counterexample. 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.
Original language | English |
---|---|
Publisher | ArXiv |
Pages | 1-8 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 10 Jul 2024 |
Keywords / Materials (for Non-textual outputs)
- discrete event systems
- supervisory control
- simulation relation
- maximally permissive supervisor