More on Maximally Permissive Similarity Control of Discrete Event Systems
Formal Languages and Automata Theory
2025-03-11 v2
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 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.
Keywords
Cite
@article{arxiv.2407.08068,
title = {More on Maximally Permissive Similarity Control of Discrete Event Systems},
author = {Yu Wang and Zhaohui Zhu and Rob van Glabbeek and Shigemasa Takai and Jinjin Zhang and Lixing Tan},
journal= {arXiv preprint arXiv:2407.08068},
year = {2025}
}
Comments
10 pages