期刊
SYSTEMS & CONTROL LETTERS
卷 54, 期 5, 页码 503-509出版社
ELSEVIER
DOI: 10.1016/j.sysconle.2004.10.002
关键词
discrete event systems; supervision; decentralized control; distributed control; undecidability
It is well known that supervisor synthesis problems involving partial observations generally have high computational complexity, but was only recently shown (in the preliminary version of this article) that the solvability of decentralized supervisor synthesis problems may be undecidable, even in cases where all pertinent languages are represented as finite automata. The result is established by reduction from the halting problem for Turing machines. Alternative proofs, discovered independently by other authors, employ a reduction from Post's correspondence problem. (c) 2004 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据