A graph theoretic method for computing a formal representation of the largest controlled invariant subspace of a structured system
Jacob W. van der Woude · International Journal of Control · 1996
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.