In this paper we deal with problems of controller parametrization in the context of behavioral systems. Given a full plant behavior, a subbehavior of the manifest plant behavior is called regularly implementable if it can be achieved as the controlled behavior resulting from the interconnection of the full plant behavior with a suitable controller behavior, in such a way that the controller does not impose restrictions that are already present in the plant. We establish a parametrization of all controllers that regularly implement a given behavior. We also obtain a parametrization of all stabilizing controllers.

No abstract

No abstract

In this correspondence, we will establish polynomial algorithms for computation of controllers in the behavioral approach to control, in particular for the computation of controllers that regularly implement a given desired behavior and for controllers that achieve pole placement and stabilization by behavioral full interconnection and partial interconnection. These synthesis problems were studied before in articles by Belur and Trentelman, Rocha and Wood, and Willems in the reference section. In the algorithms, we will apply ideas around the unimodular and stable embedding problems. The algorithms that are presented in this correspondence can be implemented by means of the Polynomial Toolbox of Matlab.Index Terms-Behavioral systems, controller design, regular implementation, stabilization and pole placement, unimodular embedding problem.A polynomial p is called is called Hurwitz if its zeroes are contained in the open left half complex plane 0 := f 2 jRe() < 0g. A square polynomial matrix P is called Hurwitz if det(P) is Hurwitz. Manuscript

No abstract