Hybridization methods for the analysis of nonlinear systems
From MaRDI portal
Publication:868432
DOI10.1007/s00236-006-0035-7zbMath1134.93026OpenAlexW2154679417MaRDI QIDQ868432
Thao Dang, Eugene Asarin, Antoine Girard
Publication date: 5 March 2007
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-006-0035-7
Related Items
Template-Based Unbounded Time Verification of Affine Hybrid Automata, Verification of Hybrid Systems, Set-based control for disturbed piecewise affine systems with state and actuation constraints, Abstraction based verification of stability of polyhedral switched systems, Hybrid Tools for Hybrid Systems – Proving Stability and Safety at Once, Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration, Robust constrained control of piecewise affine systems through set‐based reachability computations, Adaptive parameter tuning for reachability analysis of nonlinear systems, Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space, Stability analysis of planar probabilistic piecewise constant derivative systems, Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces, Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization, Decentralized abstractions for multi-agent systems under coupled constraints, Determination of inner and outer bounds of reachable sets through subpavings, Reachability and stabilization of discrete-time affine systems with disturbances, Reachability analysis of nonlinear systems using hybridization and dynamics scaling, Computing reachable states for nonlinear biological models, Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement, Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques, Computing reachable sets for uncertain nonlinear monotone systems, Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration, Bracketing backward reach sets of a dynamical system, Adaptive reachability algorithms for nonlinear systems using abstraction error analysis, Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
Uses Software
Cites Work
- The algorithmic analysis of hybrid systems
- What's decidable about hybrid automata?
- Nonlinear systems. Analysis, stability, and control
- A theory of timed automata
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Switching in systems and control
- An introduction to hybrid dynamical systems
- HyTech: A model checker for hybrid systems
- Kronos: A verification tool for real-time systems
- Uppaal in a nutshell
- Counterexample-guided predicate abstraction of hybrid systems
- Hybrid computation
- Some Combinatorial Lemmas in Topology
- Reachability Analysis Using Polygonal Projections
- Computation of piecewise quadratic Lyapunov functions for hybrid systems
- A unified framework for hybrid control: model and optimal control theory
- Analysis of Non-polynomial Systems Using the Sum of Squares Decomposition
- Impulse differential inclusions: a viability approach to hybrid systems
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Formal Methods in Computer-Aided Design
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Symbolic reachability computation for families of linear vector fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
