Supervisory Controller Synthesis for Nonterminating Processes Is an Obliging Game
IEEE Transactions on Automatic Control(2023)
摘要
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.
更多查看译文
关键词
Control systems,supervisory control,computers science
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要