LazySets.jl: Scalable Symbolic-Numeric Set Computations

From MaRDI portal
Publication:6379368

arXiv2110.01711MaRDI QIDQ6379368

Author name not available (Why is that?)

Publication date: 4 October 2021

Abstract: LazySets.jl is a Julia library that provides ways to symbolically represent sets of points as geometric shapes, with a special focus on convex sets and polyhedral approximations. LazySets provides methods to apply common set operations, convert between different set representations, and efficiently compute with sets in high dimensions using specialized algorithms based on the set types. LazySets is the core library of JuliaReach, a cutting-edge software addressing the fundamental problem of reachability analysis: computing the set of states that are reachable by a dynamical system from all initial states and for all admissible inputs and parameters. While the library was originally designed for reachability and formal verification, its scope goes beyond such topics. LazySets is an easy-to-use, general-purpose and scalable library for computations that mix symbolics and numerics. In this article we showcase the basic functionality, highlighting some of the key design choices.




Has companion code repository: https://github.com/JuliaReach/LazySets.jl








This page was built for publication: LazySets.jl: Scalable Symbolic-Numeric Set Computations

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