×

The matching problem for behavioral systems. (English) Zbl 0863.93003

Kybernetika 31, No. 6, 613-621 (1995); errata ibid. 33, No. 1, 132 (1997).
The authors study the matching problem in a general behavioral context and found conditions for the existence of solutions under suitable hypotheses. A concept of series composition between systems is defined by using the notions of pullback and pushout (in the categorical sense). Some conditions (necessary and sufficient) for the existence of solutions of the matching problem for I/O behavioral systems and AR-systems are given.

MSC:

93A99 General systems theory
93A10 General systems
18B20 Categories of machines, automata
PDF BibTeX XML Cite
Full Text: EuDML Link

References:

[1] G. Conte A. M. Perdon, B. Wyman: Fixed poles in transfer function equations. SIAM J. Control Optim. 26 (1988), 356-368. · Zbl 0642.93028
[2] G. Conte C. H. Moog, A. M. Perdon: Model matching and factorization for non-linear systems: a structural approach. SIAM J. Control Optim. 29 (1991), 769-785. · Zbl 0733.93025
[3] G. Conte, A. M. Perdon: Composition of I/O behavioral systems. Proc. MTNS 93, Regensburg 1993. · Zbl 0925.93056
[4] G. Conte, A. M. Perdon: Matching of behavioral systems. Proc. 2nd IEEE Mediterranean Conference, Crete 1994. · Zbl 0925.93056
[5] S. MacLane: Category for the Working Mathematicians. Springer-Verlag, Berlin 1971.
[6] Oberst: Multidimensional constant linear systems. Acta Appl. Math. 20 (1990). · Zbl 0715.93014
[7] X. Wang, J. Rosenthal: A cell structure for the set of autoregressive systems. Linear Algebra Appl., to appear · Zbl 0801.93005
[8] J. C. Willems: Paradigms and puzzles in the theory of dynamical systems. IEEE Trans. Automat. Control 55 (1991), 259-294. · Zbl 0737.93004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.