A graph theoretic method for computing a formal representation of the largest controlled invariant subspace of a structured system (Q5688052)

From MaRDI portal
Revision as of 00:18, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 969933
Language Label Description Also known as
English
A graph theoretic method for computing a formal representation of the largest controlled invariant subspace of a structured system
scientific article; zbMATH DE number 969933

    Statements

    A graph theoretic method for computing a formal representation of the largest controlled invariant subspace of a structured system (English)
    0 references
    11 August 1997
    0 references
    algorithm
    0 references
    kernel representation
    0 references
    controlled invariant subspace
    0 references
    structured system
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references