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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:34, 7 March 2024

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