Work

More on Maximally Permissive Similarity Control of Discrete Event Systems

Year: 2024

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2407.08068

Authors: Wang, Yu, Zhu, Zhaohui, van Glabbeek, Rob, Takai, Shigemasa, Zhang, Jinjin, Tan, Lixing

Institutions: Nanjing University of Aeronautics and Astronautics, University of Edinburgh, UNSW Sydney, The University of Osaka, Nanjing Audit University, Taizhou University, Taizhou University

Language: English

Topic: Petri Nets in System Modeling

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4400611397

Cites:

Cited by: 1

Related to: 10