Parsimonious, Simulation Based Verification of Linear Systems

DOI10.1007/978-3-319-41528-4_26MaRDI QIDQ4633548zbMATH OpenOpenAlexFDO

Authors Parasara Sridhar Duggirala, Mahesh Viswanathan

Publication date 3 May 2019

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41528-4_26

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Linear systems in control theory (93C05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Control/observation systems involving computers (process control, etc.) (93C83)

Recommendations

• An algorithm for automatically selecting a suitable verification method for linear systems
• Model checking simulation rules for linearizability
• Simulation-equivalent reachability of large linear systems with inputs
• Solvers for the verified solution of parametric linear systems
• Parametric systems: verification and synthesis
• Proving linearizability using forward simulations
• Rigorous simulation-based analysis of linear hybrid systems
• scientific article; zbMATH DE number 5688927

Cited in

(26)

• Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
• Order-reduction abstractions for safety verification of high-dimensional linear systems
• Simulation-equivalent reachability of large linear systems with inputs
• Extracting counterexamples induced by safety violation in linear hybrid systems
• Proofs from simulations and modular annotations
• Rigorous simulation-based analysis of linear hybrid systems
• Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems
• Systematic Simulation Using Sensitivity Analysis
• Multi-agent safety verification using symmetry transformations
• Numerical verification of affine systems with up to a billion dimensions
• Adaptive parameter tuning for reachability analysis of nonlinear systems
• Constrained polynomial zonotopes
• The octatope abstract domain for verification of neural networks
• Quantitative Verification for Neural Networks using ProbStars
• Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions
• Verification of Recurrent Neural Networks with Star Reachability
• Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes
• Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
• Schatten-\(p\) radius: optimality criterion and optimization for basic ellipsotopes with application to zonotopes and ellipsoids
• The hexatope and octatope abstract domains for neural network verification
• Quantitative verification of learning-enabled systems using ProbStar reachability
• Sparse intersection checking for sparse polynomial zonotopes
• Reachability of Koopman linearized systems using explicit kernel approximation and polynomial zonotope refinement
• Reachability analysis of recurrent neural networks
• Reachability analysis for linear systems with uncertain parameters using polynomial zonotopes
• Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems

This page was built for publication: Parsimonious, Simulation Based Verification of Linear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633548)