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:35, 1 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    kernel representation
    0 references
    controlled invariant subspace
    0 references
    structured system
    0 references