On the Existence of Nonblocking Bounded Supervisors for Discrete-Event Systems

被引：0

作者：

Xiang, Zhaoyu ^{[1
]}

Chen, Yufeng ^{[1
]}

Wu, Naiqi ^{[1
]}

Li, Zhiwu ^{[1
,2
]}

机构：

[1] Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China

[2] Xidian Univ, Sch Electromech Engn, Xian 710071, Peoples R China

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2024年 / 69卷 / 11期

关键词：

Robots; Task analysis; Automobiles; Robot sensing systems; Path planning; Games; Discrete-event systems; Discrete-event system; finite-state automaton; reachability game; supervisory control;

D O I：

10.1109/TAC.2024.3407612

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This article investigates the supervisory control problem of discrete-event systems modeled with deterministic finite-state automata. Given a control specification represented by a nonempty regular sublanguage of the generated language of a plant, we aim to solve a synthesis problem for finding a nonblocking supervisor for the control specification to guarantee that there exists an integer such that the length of any string in the generated language of the plant under supervision is no greater than the integer, namely a bounded nonblocking supervisor. We show that the problem can be reduced to finding a positional winning strategy in a two-player reachability game. Examples are presented to illustrate the reported approach.

引用

页码：8003 / 8010

页数：8