- Previous Article
- Next Article
- Table of Contents
International Journal of Control, Vol.65, No.5, 885-897, 1996
A Graph-Theoretic Method for Computing a Formal Representation of the Largest Controlled Invariant Subspace of a Structured System
The paper discusses a method to compute a kernel representation of the largest controlled invariant subspace in the kernel of the output mapping of a structured system. The graph of the structured system is used to make the relevant equations, and then a formula manipulation package can be used to compute a condensed kernel representation, or even an image representation, of the largest controlled invariant subspace.