Solvability of centralized supervisory control under partial observation

被引：11

作者：

Yoo, Tae-Sic

Lafortune, Stephane

机构：

[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA

[2] Idaho Natl Lab, Idaho Falls, ID 83403 USA

来源：

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS | 2006年 / 16卷 / 04期

基金：

美国国家科学基金会;

关键词：

supervisory control; partial observation; decidability; nonblocking;

D O I：

10.1007/s10626-006-0023-7

中图分类号：

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

学科分类号：

0812 ;

摘要：

The problem of synthesizing a nontrivial controllable and observable sublanguage of a given non-prefix-closed language is addressed. This problem arises in supervisory control of discrete-event systems, when the objective is to synthesize safe nonblocking supervisors for partially observed systems. The decentralized version of this problem is known to be unsolvable. We show that the centralized version of this problem is solvable by presenting a new algorithm that synthesizes a nontrivial controllable and observable sublanguage of the given non-prefix-closed language, if one exists. We also show that the union of all nonblocking solutions to the associated supervisory control problem can be expressed as the union of all regular nonblocking solutions.

引用

页码：527 / 553

页数：27

共 15 条

[1] Games for synthesis of controllers with partial observation [J].