-
Notifications
You must be signed in to change notification settings - Fork 16
References
A curated list of references can be found in https://juliareach.github.io/ReachabilityAnalysis.jl/dev/references/
-
Reachability of Uncertain Linear Systems Using Zonotopes Antoine Girard
-
Computing Reachable Sets of Hybrid Systems Using a Combination of Zonotopes and Polytopes. Matthias Althoff, Olaf Stursberg, and Martin Buss
-
Combining zonotopes and support functions for efficient reachability analysis of linear systems
-
http://ljk.imag.fr/membres/Antoine.Girard/Publications/hscc2006a.pdf
-
Invariant, Viability and Discriminating Kernel Under-Approximation via Zonotope Scaling Ian M. Mitchell, Jacob Budzis, Andriy Bolyachevets
http://ceur-ws.org/Vol-2560/paper26.pdf
Tags: underapproximate, underapproximating, polynomial, semidefinite programming.
- https://github.com/JuliaReach/Reachability.jl/issues/416
- https://dl.acm.org/citation.cfm?id=3178133
- http://lcs.ios.ac.cn/~znj/papers/HSCC2018b.pdf
- https://arxiv.org/abs/1903.07274
- https://arxiv.org/pdf/1903.05311.pdf
- https://hal.archives-ouvertes.fr/hal-01650701/document
- https://www.ennoruijters.nl/imrmc.pdf
- https://ieeexplore.ieee.org/abstract/document/6225315
- https://ieeexplore.ieee.org/abstract/document/7353640
- https://www.ennoruijters.nl/imrmc.pdf
- https://arxiv.org/abs/2001.11330
- https://link.springer.com/article/10.1007/s00498-020-00254-y
- Bounds on the reachable sets of nonlinear control systems✩
- Exploiting nonlinear invariants and path constraints to achieve tighter reachable set enclosures using differential inequalities
- https://arxiv.org/abs/2001.00080
- https://link.springer.com/chapter/10.1007/978-3-030-41131-2_6
- https://arxiv.org/abs/2003.05617
- https://arxiv.org/abs/2003.05912
- https://arxiv.org/pdf/2003.01226.pdf
- https://arxiv.org/abs/1610.06940
- Algorithms for verifying deep neural networks
- https://arxiv.org/pdf/2001.03662.pdf
- http://qav.comlab.ox.ac.uk/papers/hkww17.pdf
- Fast neural network verification via shadow prices. See also the post in AI-facebook.
- https://arxiv.org/pdf/2003.02957.pdf
- https://arxiv.org/pdf/2003.02905.pdf
- https://dl.acm.org/doi/abs/10.1145/996566.996790
- https://arxiv.org/pdf/1904.02765.pdf
- https://arxiv.org/pdf/2002.04192.pdf
- http://www.i6.in.tum.de/Main/Publications/Elguindy2017b.pdf
-
https://link.springer.com/chapter/10.1007/978-3-030-41131-2_6-
-
https://www.cs.cmu.edu/afs/cs/user/reids/www/verification/index.html
-
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.538.9218&rep=rep1&type=pdf
-
Kochdumper, Niklas, and Matthias Althoff. Reachability analysis for hybrid systems with nonlinear guard sets.. Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control. 2020.
-
Over- and Under-Approximations of Reachable Sets with Series Representations of Evolution Functions
-
Safe Over- and Under-Approximation of Reachable Sets for Autonomous Dynamical Systems: 16th International Conference, FORMATS 2018, Beijing, China, September 4–6, 2018, Proceedings
-
Computing Safe Sets of Linear Sampled-Data Systems. Felix Gruber, Matthias Althoff
- Robust optimal control using dynamic programming and guaranteed Euler's method Jawher Jerray, Laurent Fribourg, Étienne André
-
Verification of Hybrid Systems, Goran Frehse, Universite Grenoble 1, Verimag, with work from Thao Dang, Antoine Girard and Colas Le Guernic, MOVEP’08, June 25, 2008. slides
-
Formal Verification of Piecewise Affine Hybrid Systems. Goran Frehse. DigiCosme Spring School, May 12, 2016. slides.
-
Reachability Analysis of Hybrid Systems. Goran Frehse. CPS Summer School, Grenoble, 2014. slides.