Please use this identifier to cite or link to this item:
|Title:||State space approach to behavioral systems theory: the Dirac-Bergmann algorithm|
|Publisher:||ELSEVIER SCIENCE BV|
|Citation:||SYSTEMS & CONTROL LETTERS, 50(2), 149-162|
|Abstract:||This paper develops an approach to behavioral systems theory in which a state space representation of behaviors is utilised. This representation is a first order hybrid representation of behaviors called pencil representation. An algorithm well known after Dirac and Bergmann (DB) is shown to be central in obtaining a constraint free and observable (CFO) state space representation of a behavior. Results and criteria for asymptotic stability, controllability, inclusions and Markovianity of behaviors are derived in terms of the matrices of this representation which involve linear algebraic processes in their computation. (C) 2003|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.