A dynamic algorithm for approximate flow computations
From MaRDI portal
Recommendations
Cited in
(17)- Adaptive reachability algorithms for nonlinear systems using abstraction error analysis
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- Flowpipe approximation and clustering in space-time
- Computing distances between reach flowpipes
- An algorithm for computing Bingham flows
- Verification of Hybrid Systems
- Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
- scientific article; zbMATH DE number 1148567 (Why is no real title available?)
- scientific article; zbMATH DE number 1522821 (Why is no real title available?)
- Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices
- Relating syntactic and semantic perturbations of hybrid automata
- Efficient Approximation of Flow Problems With Multiple Scales in Time
- Algorithmic results for potential‐based flows: Easy and hard cases
- Reachability computation for polynomial dynamical systems
- Hybrid Systems: Computation and Control
- Adaptive parameter tuning for reachability analysis of nonlinear systems
- Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions
This page was built for publication: A dynamic algorithm for approximate flow computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986721)
