Graph Theoretic Method for Computing a Formal Representation of the LargestControlled Invariant Subspace of a Structured System

摘要

In the paper the authors discuss a method to compute a kernel representation ofthe 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, whereupon a formula manipulation package can be used to compute a condensed kernel representation, or even a image representation, of the largest controlled invariant subspace mentioned above.