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.
翻译:LazySets.jl 是一个Julia 图书馆, 提供如何象征性地代表几何形状的一组点数, 特别侧重于 convex 数据集和多面近似值。 LazySets 提供方法, 应用共同的一组操作, 在不同组别之间转换, 并使用基于设定类型的特殊算法以高维数有效计算。 LazySets 是JuliaReach的核心库, 这是一种处理可访问性分析基本问题的尖端软件: 计算所有初始州动态系统可以覆盖的一组状态, 以及所有可允许的投入和参数。 虽然图书馆最初设计为可访问性和正式验证设计, 但其范围超出了这些主题。 LazySets 是一个方便使用、 通用和可扩展的计算库, 用于混合符号和数字。 在文章中, 我们展示了基本功能, 突出一些关键设计选项 。