Symbolic reachability computation for families of linear vector fields

DOI10.1006/jsco.2001.0472zbMath0983.93004OpenAlexW1994475353WikidataQ57582185 ScholiaQ57582185MaRDI QIDQ5945290

Sergio Yovine, Gerardo Lafferriere, George J. Pappas

Publication date: 27 January 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0472

zbMATH Keywords

symbolic computation quantifier elimination eigenvalue problems linear control system reachable set

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Eigenvalue problems (93B60) Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03) Control/observation systems governed by ordinary differential equations (93C15) Applications of computability and recursion theory (03D80) Quantifier elimination, model completeness, and related topics (03C10)

Related Items

Synthesizing invariant barrier certificates via difference-of-convex programming, Reachability and optimal control for linear hybrid automata: a quantifier elimination approach, Algorithmic analysis of polygonal hybrid systems. I: Reachability, Geometry and topology of parameter space: Investigating measures of robustness in regulatory networks, Verification of Hybrid Systems, Pegasus: sound continuous invariant generation, Conservative time discretization: a comparative study, Hybridization methods for the analysis of nonlinear systems, Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems, Positive root isolation for poly-powers by exclusion and differentiation, Formal Modelling, Analysis and Verification of Hybrid Systems, Characterization and computation of control invariant sets for linear impulsive control systems, A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems, Exact safety verification of hybrid systems using sums-of-squares representation, Adaptive parameter tuning for reachability analysis of nonlinear systems, Limit cycles of linear vector fields on \(( \mathbb{S}^2)^m \times \mathbb{R}^N\), On the decidability of reachability in continuous time linear time-invariant systems, Interrupt timed automata: verification and expressiveness, Understanding deadlock and livelock behaviors in hybrid control systems, \(\epsilon\)-semantics computations on biological systems, Quantifier-free encoding of invariants for hybrid systems, Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates, Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination, Barrier certificates revisited, Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools, Abstractions for hybrid systems, Constructing invariants for hybrid systems, Reachability computation for polynomial dynamical systems, Sampling-based Algorithm for Testing and Validating Robot Controllers, MetiTarski: An automatic theorem prover for real-valued special functions, Unnamed Item, Span-reachability and observability of bilinear hybrid systems, Unnamed Item, Synthesis of controllers for target problems of hybrid systems using approximate computation, Inclusion dynamics hybrid automata, Interrupt Timed Automata, Reachability analysis of rational eigenvalue linear systems, First-order orbit queries, Theory and computational techniques for analysis of discrete-time control systems with disturbances, A semantic model for interacting cyber-physical systems, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming, Some decidable results on reachability of solvable systems

Uses Software

Cites Work