Algorithms for exact and approximate linear abstractions of polynomial continuous systems
From MaRDI portal
Publication:4561454
DOI10.1145/3178126.3178137zbMath1417.93147OpenAlexW2788825088MaRDI QIDQ4561454
Publication date: 6 December 2018
Published in: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) (Search for Journal in Brave)
Full work available at URL: https://local.disia.unifi.it/wp_disia/2018/wp_disia_2018_03.pdf
Linearizations (93B18) Control/observation systems governed by ordinary differential equations (93C15)
Related Items (4)
Linearization, model reduction and reachability in nonlinear ODEs ⋮ Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ Automatic pre- and postconditions for partial differential equations ⋮ On the Coalgebra of Partial Differential Equations
This page was built for publication: Algorithms for exact and approximate linear abstractions of polynomial continuous systems