Cover Image

The Reachability Problem for Neural-Network Control Systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schilling, Christian, Zimmermann, Martin
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Computational Complexity Logic in Computer Science Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial Logical Zonotope: A Set Representation for Reachability Analysis of Logical Systems
by: Alanwar, Amr, et al.
Published: (2023)

The Descriptive Complexity of Graph Neural Networks
by: Grohe, Martin
Published: (2023)

Compositional Inductive Invariant Based Verification of Neural Network Controlled Systems
by: Zhou, Yuhao, et al.
Published: (2023)

The Complexity of Verifying Feedforward Neural Networks in Quantised Settings
by: Alsmann, Eric, et al.
Published: (2026)

Verifying Quantized Graph Neural Networks is PSPACE-complete
by: Sälzer, Marco, et al.
Published: (2025)

Provably Explaining Neural Additive Models
by: Bassan, Shahaf, et al.
Published: (2026)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
by: Lemke, Caroline, et al.
Published: (2025)

Neural Proofs for Sound Verification and Control of Complex Systems
by: Abate, Alessandro
Published: (2025)

Provably Safe Neural Network Controllers via Differential Dynamic Logic
by: Teuber, Samuel, et al.
Published: (2024)

Efficient Shield Synthesis via State-Space Transformation
by: Brorholt, Asger Horn, et al.
Published: (2024)

Safe Reach Set Computation via Neural Barrier Certificates
by: Abate, Alessandro, et al.
Published: (2024)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
by: Bournez, Olivier
Published: (2026)

A General Framework for Verification and Control of Dynamical Models via Certificate Synthesis
by: Edwards, Alec, et al.
Published: (2023)

Fossil 2.0: Formal Certificate Synthesis for the Verification and Control of Dynamical Models
by: Edwards, Alec, et al.
Published: (2023)

Solvable Initial Value Problems Ruled by Discontinuous Ordinary Differential Equations
by: Bournez, Olivier, et al.
Published: (2024)

Local vs. Global Interpretability: A Computational Complexity Perspective
by: Bassan, Shahaf, et al.
Published: (2024)

Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation
by: Amir, Guy, et al.
Published: (2024)

Is uniform expressivity too restrictive? Towards efficient expressivity of graph neural networks
by: Khalife, Sammy, et al.
Published: (2024)

Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory
by: Zubić, Nikola, et al.
Published: (2024)

On the Computational Tractability of the (Many) Shapley Values
by: Marzouk, Reda, et al.
Published: (2025)

What makes an Ensemble (Un) Interpretable?
by: Bassan, Shahaf, et al.
Published: (2025)

Verification of Autonomous Neural Car Control with KeYmaera X
by: Prebet, Enguerrand, et al.
Published: (2025)

BURNS: Backward Underapproximate Reachability for Neural-Feedback-Loop Systems
by: Sidrane, Chelsea, et al.
Published: (2025)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
by: Blanc, Manon, et al.
Published: (2023)

Measuring robustness of dynamical systems. Relating time and space to length and precision
by: Blanc, Manon, et al.
Published: (2023)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

The Computational Complexity of Satisfiability in State Space Models
by: Alsmann, Eric, et al.
Published: (2025)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
by: Sälzer, Marco, et al.
Published: (2024)

Reachability Analysis Using Constrained Polynomial Logical Zonotopes
by: Hafez, Ahmad, et al.
Published: (2024)

Network Satisfaction Problems Solved by k-Consistency
by: Bodirsky, Manuel, et al.
Published: (2023)

The Descriptive Complexity of Relation Modification Problems
by: Chudigiewitsch, Florian, et al.
Published: (2026)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

Verification of Nonblockingness in Bounded Petri Nets With Minimax Basis Reachability Graphs
by: Gu, Chao, et al.
Published: (2020)

The Expressive Power of Transformers with Chain of Thought
by: Merrill, William, et al.
Published: (2023)

k-Inductive Neural Barrier Certificates for Unknown Nonlinear Dynamics
by: Wooding, Ben, et al.
Published: (2026)

Reachability In Simple Neural Networks
by: Sälzer, Marco, et al.
Published: (2022)

TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems
by: Sidrane, Chelsea, et al.
Published: (2024)

Formal Verification of Linear Temporal Logic Specifications Using Hybrid Zonotope-Based Reachability Analysis
by: Hadjiloizou, Loizos, et al.
Published: (2024)

Of Good Demons and Bad Angels: Guaranteeing Safe Control under Finite Precision
by: Teuber, Samuel, et al.
Published: (2025)

Set Descriptive Complexity of Solvable Functions
by: Gozzi, Riccardo, et al.
Published: (2024)