• DocumentCode
    397717
  • Title

    Abstractions of constrained linear systems

  • Author

    Tanner, Herbert G. ; Pappas, George J.

  • Author_Institution
    Dept. of Electr. & Syst. Eng., Pennsylvania Univ., Philadelphia, PA, USA
  • Volume
    4
  • fYear
    2003
  • fDate
    4-6 June 2003
  • Firstpage
    3381
  • Abstract
    Simulation relations are powerful abstraction techniques in computer science that reduce the complexity of analysis and design of labeled transition systems. In this paper, we define and characterize simulation relations for discrete-time linear systems in the presence of state and input constraints. Given a discrete-time linear system and the associated constraints, we consider a control-abstract embedding into a transition system. We then establish necessary and sufficient conditions for one constrained linear system to simulate the transitions of the other. Checking the simulation conditions is formulated as a linear programming problem, which can be efficiently solved for systems of large dimensions. We provide an example where our approach is applied to the hybrid model of the electronic throttle control (ETC) system.
  • Keywords
    control system analysis computing; discrete time systems; linear programming; linear systems; analysis complexity; constrained linear systems abstraction; control-abstract embedding; discrete-time linear system; electronic throttle control; labeled transition system; linear programming problem; Computational modeling; Computer science; Continuous time systems; Control system synthesis; Control systems; Design engineering; Linear programming; Linear systems; Power engineering and energy; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference, 2003. Proceedings of the 2003
  • ISSN
    0743-1619
  • Print_ISBN
    0-7803-7896-2
  • Type

    conf

  • DOI
    10.1109/ACC.2003.1244054
  • Filename
    1244054