Pith. sign in

REVIEW 2 cited by

Reachability Analysis and Safety Verification for Neural Network Control Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.09944 v1 pith:IS4KWTAN submitted 2018-05-25 cs.SY cs.SY

Reachability Analysis and Safety Verification for Neural Network Control Systems

classification cs.SY cs.SY
keywords neuralcontrolnetworkreachablesystemssafetyalgorithmanalysis
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Autonomous cyber-physical systems (CPS) rely on the correct operation of numerous components, with state-of-the-art methods relying on machine learning (ML) and artificial intelligence (AI) components in various stages of sensing and control. This paper develops methods for estimating the reachable set and verifying safety properties of dynamical systems under control of neural network-based controllers that may be implemented in embedded software. The neural network controllers we consider are feedforward neural networks called multilayer perceptrons (MLP) with general activation functions. As such feedforward networks are memoryless, they may be abstractly represented as mathematical functions, and the reachability analysis of the network amounts to range (image) estimation of this function provided a set of inputs. By discretizing the input set of the MLP into a finite number of hyper-rectangular cells, our approach develops a linear programming (LP) based algorithm for over-approximating the output set of the MLP with its input set as a union of hyper-rectangular cells. Combining the over-approximation for the output set of an MLP based controller and reachable set computation routines for ordinary difference/differential equation (ODE) models, an algorithm is developed to estimate the reachable set of the closed-loop system. Finally, safety verification for neural network control systems can be performed by checking the existence of intersections between the estimated reachable set and unsafe regions. The approach is implemented in a computational software prototype and evaluated on numerical examples.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. HyParLyVe: Hyperplane Partitioning for Neural Lyapunov Verification

    eess.SY 2026-05 unverdicted novelty 7.0

    HyParLyVe verifies neural Lyapunov candidates soundly and completely by modeling shallow ReLU networks as hyperplane arrangements, enabling finite vertex evaluations for positive definiteness and bounded optimization ...

  2. ReachNN: Reachability Analysis of Neural-Network Controlled Systems

    eess.SY 2019-06 unverdicted novelty 6.0

    ReachNN abstracts feedforward neural networks with Bernstein polynomials and provides error bounds to compute reachable sets for verifying neural-network controlled systems with general Lipschitz-continuous activation...