Finite-Memory Supervisory Control of Discrete Event Systems for LTL[F] Specifications
成果类型:
Article
署名作者:
Sakakibara, Ami; Urabe, Natsuki; Ushio, Toshimitsu
署名单位:
Sapienza University Rome; University of Osaka; Max Planck Society
刊物名称:
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
ISSN/ISSBN:
0018-9286
DOI:
10.1109/TAC.2021.3139221
发表日期:
2022
页码:
6896-6903
关键词:
Discrete event systems (DESs)
linear temporal logic (LTL) [F] specifications
ranking functions
safety games
Supervisory control
摘要:
In this article, we study a supervisory control problem under a constraint on memory size as well as a constraint described by a class of quantitative linear temporal logic, which enables us to consider how well the specification is satisfied. Our control objective is to design a finite-memory supervisor such that the satisfaction value of the specification formula on the controlled system is larger than or equal to a given threshold. We adopt a Safraless synthesis methodology and reduce the problem to solving a safety game parameterized with the memory size of a supervisor. On the safety game, we compute a winning strategy by leveraging a ranking function. Our definition of the ranking function relies on the product automaton, which captures both the behavior of the controlled plant and that of an automaton transformed from the specification and the threshold.