Saved in:
Bibliographic Details
Main Authors: Wang, Yu, Zhu, Zhaohui, van Glabbeek, Rob, Zhang, Jinjin, Li, Yixuan
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.09360
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914550513664000
author Wang, Yu
Zhu, Zhaohui
van Glabbeek, Rob
Zhang, Jinjin
Li, Yixuan
author_facet Wang, Yu
Zhu, Zhaohui
van Glabbeek, Rob
Zhang, Jinjin
Li, Yixuan
contents In order to guarantee that a supervised system satisfies safety requirements of the specification, as well as requirements saying that in certain states certain events must be enabled, this paper introduces required events for discrete event systems and reconsiders the similarity control problem while taking all requirements from the specification into account. The notion of a covariant-contravariant simulation, which is finer than the conventional notion of simulation, is adopted to act as the behavioral relation of supervisory control theory. A necessary and sufficient condition for the solvability of this problem is established and a method for synthesizing a maximally permissive supervisor is provided.
format Preprint
id arxiv_https___arxiv_org_abs_2602_09360
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle The Similarity Control Problem with Required Events
Wang, Yu
Zhu, Zhaohui
van Glabbeek, Rob
Zhang, Jinjin
Li, Yixuan
Formal Languages and Automata Theory
In order to guarantee that a supervised system satisfies safety requirements of the specification, as well as requirements saying that in certain states certain events must be enabled, this paper introduces required events for discrete event systems and reconsiders the similarity control problem while taking all requirements from the specification into account. The notion of a covariant-contravariant simulation, which is finer than the conventional notion of simulation, is adopted to act as the behavioral relation of supervisory control theory. A necessary and sufficient condition for the solvability of this problem is established and a method for synthesizing a maximally permissive supervisor is provided.
title The Similarity Control Problem with Required Events
topic Formal Languages and Automata Theory
url https://arxiv.org/abs/2602.09360