Checking Algebraic Reachability of Polynomial and Rational Systems

被引：0
|
作者：
Nemcova, Jana [1 ]
van Schuppen, Jan H. [2 ]
机构：
[1] Univ Chem & Technol Prague, Dept Math, Tech 5, Prague 16628, Czech Republic
[2] Van Schuppen Control Res, Gouden Leeuw 143, NL-1103 KB Amsterdam, Netherlands
来源：
IFAC PAPERSONLINE | 2017年 / 50卷 / 01期
关键词：
Polynomial systems; rational systems; algebraic reachability; 1ST INTEGRALS; CONTROLLABILITY;
D O I：
10.1016/j.ifacol.2017.08.2144
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The overview of possible approaches to check algebraic reachability of polynomial and rational systems is provided. The respective methods are demonstrated on a number of examples chosen with the emphasis on tutorial presentation of the results and on applications. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
下载
收藏
页码：12119 / 12124
页数：6
相关论文
共 50 条
  • [1] Petri net reachability checking is polynomial with optimal abstraction hierarchies
    Küngas, P
    ABSTRACTION, REFORMULATION AND APPROXIMATION, PROCEEDINGS, 2005, 3607 : 149 - 164
  • [2] Reachability computation for polynomial dynamical systems
    Dreossi, Tommaso
    Dang, Thao
    Piazza, Carla
    FORMAL METHODS IN SYSTEM DESIGN, 2017, 50 (01) : 1 - 38
  • [3] Reachability computation for polynomial dynamical systems
    Tommaso Dreossi
    Thao Dang
    Carla Piazza
    Formal Methods in System Design, 2017, 50 : 1 - 38
  • [4] Approximate reachability computation for polynomial systems
    Dang, T
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, PROCEEDINGS, 2006, 3927 : 138 - 152
  • [5] Backward Reachability for Polynomial Systems on a Finite Horizon
    Yin, He
    Arcak, Murat
    Packard, Andrew
    Seiler, Peter
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2021, 66 (12) : 6025 - 6032
  • [6] ON THE POLYNOMIAL COMPLEXITY OF THE EQUIVALENCE CHECKING PROBLEM IN ALGEBRAIC MODELS OF PROGRAMS
    Podlovchenko, R. I.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (05) : 653 - 659
  • [7] Reachability analysis of rational eigenvalue linear systems
    Xu, Ming
    Chen, Liangyu
    Zeng, Zhenbing
    Li, Zhi-bin
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2010, 41 (12) : 1411 - 1419
  • [8] POLYNOMIAL AND RATIONAL INTEGRABILITY OF POLYNOMIAL HAMILTONIAN SYSTEMS
    Llibre, Jaume
    Stoica, Cristina
    Valls, Claudia
    ELECTRONIC JOURNAL OF DIFFERENTIAL EQUATIONS, 2012,
  • [9] Polynomial time checking for generation of finite distributions of rational probabilities
    Kolpakov, R
    STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2005, 3777 : 48 - 57
  • [10] Reachability Analysis of Nonlinear Differential-Algebraic Systems
    Althoff, Matthias
    Krogh, Bruce H.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2014, 59 (02) : 371 - 383
12345