Learn More
Computational complexity results are obtained for decentralized discrete-event system problems. These results generalize the earlier work of Tsitsiklis, who showed that for centralized supervisory control problems (under partial observation), solution existence is decidable in polynomial time for a special type of problem but becomes computationally(More)
We define feedforward control as a control policy in which the exoge-nous disturbances are known for all time at the moment when the control is applied. It is shown that disturbance decoupling by feedforward control is possible iff it is possible by PID control or iff approximate disturbance de-coupling by state feedback is possible.
—The problem discussed is that of designing a controller for a linear system that renders a quadratic functional nonnegative. Our formulation and solution of this problem is completely representation-free. The system dynamics are specified by a differential behavior, and the performance is specified through a quadratic differential form. We view control as(More)
— This paper analyzes the observer design problem in the behavioral context. Observability and detectability notions are first introduced and fully characterized. Necessary and sufficient conditions for the existence of an observer, possibly an asymptotic or an exact one, are introduced, and a complete pa-rameterization of all admissible observers is given.(More)