Hybrid Systems: Computation and Control
From MaRDI portal
(Redirected from Publication:5898985)
Hybrid Systems: Computation and Control (scientific article; zbMATH DE number 5147953)
Hybrid Systems: Computation and Control (scientific article; zbMATH DE number 5147953)
Recommendations
Cited in
(16)- Computation of polytopic invariants for polynomial dynamical systems using linear programming
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- Conservative time discretization: a comparative study
- Computational techniques for reachability analysis of Max-Plus-Linear systems
- Approximate bisimulation relations for constrained linear systems
- Reachability analysis of continuous-time piecewise affine systems
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Reachability of weakly nonlinear systems using Carleman linearization
- Reachability analysis of linear systems with stepwise constant inputs
- Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems
- Reachability of Affine Systems on Polytopes
- Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices
- Numerical verification of affine systems with up to a billion dimensions
- Hybrid Systems: Computation and Control
- Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis
- Understanding deadlock and livelock behaviors in hybrid control systems
This page was built for publication: Hybrid Systems: Computation and Control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898985)
