Numerical verification of affine systems with up to a billion dimensions

DOI10.1145/3302504.3311792OpenAlexW3098919244MaRDI QIDQ5239215

Taylor T. Johnson, Hoang-Dung Tran, Stanley Bak

Publication date: 22 October 2019

Published in: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.01583

zbMATH Keywords

hybrid systemsreachabilityformal verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (7)

Multi-agent Safety Verification Using Symmetry Transformations ⋮ Conservative time discretization: a comparative study ⋮ A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems ⋮ Quantitative Verification for Neural Networks using ProbStars ⋮ Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes ⋮ Reachability analysis of nonlinear systems using hybridization and dynamics scaling ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

This page was built for publication: Numerical verification of affine systems with up to a billion dimensions