Some decidable results on reachability of solvable systems
From MaRDI portal
Publication:2871582
DOI10.1080/03081079.2012.757604zbMath1278.93046OpenAlexW2032269072MaRDI QIDQ2871582
Ming Xu, Jiaqi Zhu, Zhi-Bin Li
Publication date: 8 January 2014
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079.2012.757604
nonlinear systemshybrid systemssymbolic computationreachability analysisdecision proceduressolvable mappings
Nonlinear systems in control theory (93C10) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items
Positive root isolation for poly-powers by exclusion and differentiation, Multiphase until formulas over Markov reward models: an algebraic approach, Analyzing ultimate positivity for solvable systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On mean square boundedness of stochastic linear systems with bounded controls
- The algorithmic analysis of hybrid systems
- What's decidable about hybrid automata?
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Overapproximating reachable sets by Hamilton-Jacobi projections
- Generating all polynomial invariants in simple loops
- Circular arithmetic and the determination of polynomial zeros
- Barrier certificates for nonlinear model validation
- Reachability analysis of rational eigenvalue linear systems
- Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
- Delay-dependent stabilization for linear time-delay uncertain systems with saturating actuators
- Reliable stabilization of stochastic time-delay systems with nonlinear disturbances
- Model-checking continuous-time Markov chains
- Symbolic reachability computation for families of linear vector fields
