Similarity-Based Supervisory Control of Discrete Event Systems
Yongzhi Cao, Mingsheng Ying

TL;DR
This paper introduces a metric-based extension to supervisory control theory for discrete event systems, allowing behavior modification based on similarity to handle uncontrollable events.
Contribution
It generalizes controllability to $ ext{d}$-controllability using a similarity metric, providing conditions and methods for optimizing system behavior.
Findings
Defined $ ext{d}$-controllability and its necessary and sufficient conditions
Analyzed properties of $ ext{d}$-controllable languages
Proposed an approach for optimizing realizations
Abstract
Due to the appearance of uncontrollable events in discrete event systems, one may wish to replace the behavior leading to the uncontrollability of pre-specified language by some quite similar one. To capture this similarity, we introduce metric to traditional supervisory control theory and generalize the concept of original controllability to -controllability, where indicates the similarity degree of two languages. A necessary and sufficient condition for a language to be -controllable is provided. We then examine some properties of -controllable languages and present an approach to optimizing a realization.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · Formal Methods in Verification · Distributed systems and fault tolerance
