Supervisory Controller Synthesis for Nonterminating Processes Is an Obliging Game

• 成果类型: Article
• 署名作者: Majumdar, Rupak; Schmuck, Anne-Kathrin
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2022.3143108
• 发表日期: 2023
• 页码: 385-392
• 关键词: Control systems; Supervisory control; computers science

摘要

In this article, we present a new algorithm to solve the supervisory control problem over nonterminating processes modeled as $\omega$-regular automata. A solution to this problem was obtained by Thistle in 1995, which uses complex manipulations of automata. We show a new solution to the problem through a reduction to obliging games, which, in turn, can be reduced to $\omega$-regular reactive synthesis. Therefore, our reduction results in a symbolic algorithm based on manipulating sets of states.