Undecidability in decentralized supervision

Abstract 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.

[1]  Stéphane Lafortune,et al.  On the synthesis of communicating controllers with decentralized information structures for discrete-event systems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[2]  J. G. Thistle.  Supervisory control of discrete event systems , 1996 .

[3]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  浅井 徹.  39th IEEE Conference on Decision and Control , 2001 .

[5]  J. G. Thistle,et al.  Effective control synthesis for DES under partial observations , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[6]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[7]  A. G. Kefalas,et al.  Think globally, act locally , 1998 .

[8]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

[9]  Michel Verhaegen,et al.  Proceedings of the 37th IEEE Conference on Decision and Control , 1998 .

[10]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[11]  S. Tripakis,et al.  Undecidable problems of decentralized observation and control , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[12]  J. Willems,et al.  The computational complexity of decentralized discrete-event control problems , 1995, IEEE Trans. Autom. Control..

[13]  W. Murray Wonham,et al.  Think Globally, Act Locally: Decentralized Supervisory Control , 1991, 1991 American Control Conference.

[14]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[15]  Stéphane Lafortune,et al.  Minimal communication in a distributed discrete-event system , 2003, IEEE Trans. Autom. Control..

[16]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.