Saved in:
Bibliographic Details
Main Authors: Wang, Yu, Zhu, Zhaohui, van Glabbeek, Rob, Takai, Shigemasa, Zhang, Jinjin, Tan, Lixing
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2407.08068
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913724745383936
author Wang, Yu
Zhu, Zhaohui
van Glabbeek, Rob
Takai, Shigemasa
Zhang, Jinjin
Tan, Lixing
author_facet Wang, Yu
Zhu, Zhaohui
van Glabbeek, Rob
Takai, Shigemasa
Zhang, Jinjin
Tan, Lixing
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2407_08068
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle More on Maximally Permissive Similarity Control of Discrete Event Systems
Wang, Yu
Zhu, Zhaohui
van Glabbeek, Rob
Takai, Shigemasa
Zhang, Jinjin
Tan, Lixing
Formal Languages and Automata Theory
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.
title More on Maximally Permissive Similarity Control of Discrete Event Systems
topic Formal Languages and Automata Theory
url https://arxiv.org/abs/2407.08068