More on Maximally Permissive Similarity Control of Discrete Event Systems
<|reference_start|>More on Maximally Permissive Similarity Control of Discrete Event Systems: 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.<|reference_end|>
@article{wang2024more,
    title={More on Maximally Permissive Similarity Control of Discrete Event
  Systems},
    author={Yu Wang, Zhaohui Zhu, Rob van Glabbeek, Jinjin Zhang, Lixing Tan},
    journal={arXiv preprint arXiv:2407.08068},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.08068},
    primaryClass={cs.FL}
}