# DevCalls

When: [Each Thursday 19h00 CET](https://time.is/compare/1900_in_CET/local) :new:
- [JuliaReach Google calendar link](https://calendar.google.com/calendar/u/2?cid=anVsaWFyZWFjaC5kZXZAZ21haWwuY29t)

### Future tasks

- Revive web page
- Revise documentation (e.g., of LazySets)
- Reachability algorithm with polynomial zonotopes ([implementation in CORA](https://github.com/TUMcps/CORA/tree/master/matrixSet/%40matZonotope))
- Discrete post in ReachabilityAnalysis
- Revise matrix exponential (several packages)
- ReachabilityAnalysis: [Fix interface when t0 != 0](https://github.com/JuliaReach/ReachabilityAnalysis.jl/issues/829)

### Open PRs

[All open PRs in JuliaReach](https://github.com/pulls?q=is%3Apr+user%3AJuliaReach+archived%3Afalse+is%3Aopen)

#### Simple

- MathematicalPredicates: [Fix piracy with `contains`](https://github.com/JuliaReach/MathematicalPredicates.jl/pull/50)

#### Advanced

- RangeEnclosures:
- [Add vector output for some solvers](https://github.com/JuliaReach/RangeEnclosures.jl/pull/175)
- [add relative tolerance to BranchAndBoundEnclosure](https://github.com/JuliaReach/RangeEnclosures.jl/pull/179)
- [allow skipping derivative computations](https://github.com/JuliaReach/RangeEnclosures.jl/pull/180)
- HybridSystems: [Define global statedim and inputdim for HybridSystem](https://github.com/blegat/HybridSystems.jl/pull/60)

## Next meeting (?/?/2025)

- PRs:
-

## 25/9/2024

- PRs:
- LazySets:
- [#3282 - Remove + and - methods for Interval](https://github.com/JuliaReach/LazySets.jl/pull/3614)
- [Let `remove_redundant_constraints` return `nothing`](https://github.com/JuliaReach/LazySets.jl/pull/3623)
- [#3126 - Point in `Polygon` check](https://github.com/JuliaReach/LazySets.jl/pull/3628)
- [Remove redundant `convert` methods](https://github.com/JuliaReach/LazySets.jl/pull/3561)
- [Fix direction in alternative `Line` constructor](https://github.com/JuliaReach/LazySets.jl/pull/3567)
- [#3419 - Fast `low`/`high`/`extrema` for polyhedra](https://github.com/JuliaReach/LazySets.jl/pull/3617)
- [Revise documentation of `Interval` operations](https://github.com/JuliaReach/LazySets.jl/pull/3551)

## 18/9/2024

- PRs:
- ReachabilityAnalysis:
- [Use outsourced `@required` macro from `ReachabilityBase`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/871)
- [Outsource common `NSTEPS` code to function](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/858)

## 26/6/2024

- PRs:
- LazySets:
- [Rename functions with `is_` consistently](https://github.com/JuliaReach/LazySets.jl/pull/3627)
- [Support `is_interior_point` for mixed numeric types](https://github.com/JuliaReach/LazySets.jl/pull/3526)
- [Remove symbol aliases of concrete operations](https://github.com/JuliaReach/LazySets.jl/pull/3528)
- [Remove redundant `VectorIterator`](https://github.com/JuliaReach/LazySets.jl/pull/3529)
- [Add tests for `API` module](https://github.com/JuliaReach/LazySets.jl/pull/3530)
- [Fix `overapproximate` of `SSPZ` with `Zonotope` and `dom`](https://github.com/JuliaReach/LazySets.jl/pull/3531)
- [`SymEngine` code to create `HalfSpace`/`Hyperplane`](https://github.com/JuliaReach/LazySets.jl/pull/3532)
- [Remove membership test of number in `Interval`](https://github.com/JuliaReach/LazySets.jl/pull/3534)
- [Outsource `EmptySet` to its own module](https://github.com/JuliaReach/LazySets.jl/pull/3536)
- [Add more and better operations for `Interval`](https://github.com/JuliaReach/LazySets.jl/pull/3533)
- [Outsource `Ball1` to its own module](https://github.com/JuliaReach/LazySets.jl/pull/3547)
- [Outsource `Ball2` to its own module](https://github.com/JuliaReach/LazySets.jl/pull/3549)
- [Outsource `Ballp` to its own module](https://github.com/JuliaReach/LazySets.jl/pull/3548)
- [Outsource `BallInf` to its own module](https://github.com/JuliaReach/LazySets.jl/pull/3550)
- [Remove `RotatedHyperrectangle`](https://github.com/JuliaReach/LazySets.jl/pull/3592)
- [Disallow `box_approximation` for unbounded sets](https://github.com/JuliaReach/LazySets.jl/pull/3553)
- [Add commits since last release to README](https://github.com/JuliaReach/LazySets.jl/pull/3639)
- [Merge metaprogramming loops](https://github.com/JuliaReach/LazySets.jl/pull/3613)
- [Remove unused `minmax` function](https://github.com/JuliaReach/LazySets.jl/pull/3620)
- [Rename and move helper function](https://github.com/JuliaReach/LazySets.jl/pull/3621)
- [#3631 - Support `VPolygon` constructor from `SMatrix`](https://github.com/JuliaReach/LazySets.jl/pull/3632)
- [Add polyhedral check for `complement` method](https://github.com/JuliaReach/LazySets.jl/pull/3562)
- [#3495 - Avoid repeated creation of `zero_box`/`sym_box`](https://github.com/JuliaReach/LazySets.jl/pull/3609)
- [Split `convert.jl` into smaller files](https://github.com/JuliaReach/LazySets.jl/pull/3618)
- [Finish `linear_map` of `Hyperplane`](https://github.com/JuliaReach/LazySets.jl/pull/3612)
- [#3629 - Fix `intersection` of `LineSegments`](https://github.com/JuliaReach/LazySets.jl/pull/3630)
- ReachabilityAnalysis:
- [Merge and generalize `overapproximate` methods with `HPolytope`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/844)
- [Fix some minor warnings](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/842)
- [Revise `GLGM06` documentation](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/857)
- [Remove redundant variables in algorithms](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/845)
- [Use `preallocate` argument in `GLGM06`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/846)
- [Simplify `get` code from `kwargs` dictionary](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/860)
- [Fix argument order of `_convert_or_overapproximate`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/843)
- [Do not pass redundant `max_order` to algorithm](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/847)
- [Revise discretization module](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/841)
- [Fix ambiguities with `cluster`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/839)
- [Remove confusing membership method](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/840)
- [Resolve static kwargs snippets](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/859)
- ReachabilityBase:
- [Remove redundant `VectorIterator`](https://github.com/JuliaReach/ReachabilityBase.jl/pull/73)
- [#44 - Add `@required` macro](https://github.com/JuliaReach/ReachabilityBase.jl/pull/76)
- IntervalMatrices:
- [Avoid redefinition of `==` in tests](https://github.com/JuliaReach/IntervalMatrices.jl/pull/233)
- [Fix ambiguities with `\`](https://github.com/JuliaReach/IntervalMatrices.jl/pull/246)
- [Fix some piracies](https://github.com/JuliaReach/IntervalMatrices.jl/pull/245)
- [Outsource init code and add tests for IntervalArithmetic; unsupport :fast multiplication](https://github.com/JuliaReach/IntervalMatrices.jl/pull/237)
- [Rename `get` -> `matrix`](https://github.com/JuliaReach/IntervalMatrices.jl/pull/247)
- [Remove piracy for `==`](https://github.com/JuliaReach/IntervalMatrices.jl/pull/254)
- [Fix ambiguities with matrix multiplication](https://github.com/JuliaReach/IntervalMatrices.jl/pull/255)
- RangeEnclosures:
- [Restrict DynamicPolynomials to < v0.6](https://github.com/JuliaReach/RangeEnclosures.jl/pull/186)
- MathematicalSystems:
- [Remove unreachable code](https://github.com/JuliaReach/MathematicalSystems.jl/pull/300)
- CarlemanLinearization:
- [Revise code for spectral bounds](https://github.com/JuliaReach/CarlemanLinearization.jl/pull/62)
- SpaceExParser:
- [Outsource SymEngine code to LazySets](https://github.com/JuliaReach/SpaceExParser.jl/pull/108)
- [Fix piracies with MathematicalSystems](https://github.com/JuliaReach/SpaceExParser.jl/pull/102)
- MathematicalSystems:
- [Export `mapping`](https://github.com/JuliaReach/MathematicalSystems.jl/pull/305)
- [Add all system getters to IVP](https://github.com/JuliaReach/MathematicalSystems.jl/pull/306)

## 18/6/2024

- PRs:
- LazySets:
- [Outsource `Interval` to its own module](https://github.com/JuliaReach/LazySets.jl/pull/3520)
- [Allow passing `nothing` argument to tests](https://github.com/JuliaReach/LazySets.jl/pull/3522)
- [Move API in docs](https://github.com/JuliaReach/LazySets.jl/pull/3527)

## 14/5/2024

- ARCH-COMP 2024 status
- PRs:
- LazySets:
- [Non-uniform `split` for hyperrectangles](https://github.com/JuliaReach/LazySets.jl/pull/3505)
- [Fix `reduce_order` for SPZ of smaller order](https://github.com/JuliaReach/LazySets.jl/pull/3492)
- [Add `permute` for Zonotope](https://github.com/JuliaReach/LazySets.jl/pull/3485)
- [Add `permute` for HalfSpace, HPolytope, HPolyhedron](https://github.com/JuliaReach/LazySets.jl/pull/3487)
- [Fix membership test in zonotope without generators](https://github.com/JuliaReach/LazySets.jl/pull/3488)
- [Better equivalence check of singleton and zonotope](https://github.com/JuliaReach/LazySets.jl/pull/3489)
- [Fix projection of polyhedron in unconstrained dimensions](https://github.com/JuliaReach/LazySets.jl/pull/3501)
- [Outsource `basetype` to ReachabilityBase](https://github.com/JuliaReach/LazySets.jl/pull/3503)
- [Let `remove_redundant_generators` remove almost-zero columns](https://github.com/JuliaReach/LazySets.jl/pull/3504)
- [Zonotope overapproximation of intersection between zonotope and axis-aligned half-space based on ICP](https://github.com/JuliaReach/LazySets.jl/pull/3457)
- [`minkowski_sum` for SPZ and zonotopic set](https://github.com/JuliaReach/LazySets.jl/pull/3493)
- [Extrema approximation for SPZ](https://github.com/JuliaReach/LazySets.jl/pull/3494)
- [Add JuliaHub and PkgEval badges](https://github.com/JuliaReach/LazySets.jl/pull/3512)
- [Add `center` to `API` module](https://github.com/JuliaReach/LazySets.jl/pull/3513)
- [Add `radius` for `Interval`](https://github.com/JuliaReach/LazySets.jl/pull/3515)
- [Make `Interval`'s `diameter` consistent with `radius`](https://github.com/JuliaReach/LazySets.jl/pull/3514)
- [Revise and test `convert` to `Interval`](https://github.com/JuliaReach/LazySets.jl/pull/3517)
- [More tests for `split` of `Interval`](https://github.com/JuliaReach/LazySets.jl/pull/3518)
- [Tests for `issubset` between `Interval`s](https://github.com/JuliaReach/LazySets.jl/pull/3519)
- [Export missing function `permute`](https://github.com/JuliaReach/LazySets.jl/pull/3521)
- [Add space in error message](https://github.com/JuliaReach/LazySets.jl/pull/3523)
- [Fix `Array` package source in tests](https://github.com/JuliaReach/LazySets.jl/pull/3524)
- [Revise `translate` and `translate!`](https://github.com/JuliaReach/LazySets.jl/pull/3525)
- ReachabilityAnalysis:
- [Remove `basetype` (available in ReachabilityBase)](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/831)
- [Simplify code for UnionSet and UnionSetArray](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/834)
- [#726 - Outsource `SingleEntryVector` code to ReachabilityBase](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/832)
- [Fix conflict with `⊂`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/836)
- Avoid `using` packages:
- [RangeEnclosures](https://github.com/JuliaReach/RangeEnclosures.jl/pull/171)
- [BernsteinExpansions](https://github.com/JuliaReach/BernsteinExpansions.jl/pull/61)
- [StabilityRegions](https://github.com/JuliaReach/StabilityRegions.jl/pull/34)
- [IntervalMatrices](https://github.com/JuliaReach/IntervalMatrices.jl/pull/250)
- [SpaceExParser](https://github.com/JuliaReach/SpaceExParser.jl/pull/100)
- ReachabilityBenchmarks:
- [Replace `relpath` macro by `ReachabilityBase.current_path`](https://github.com/JuliaReach/ReachabilityBenchmarks/pull/220)
- [Update old SX models](https://github.com/JuliaReach/ReachabilityBenchmarks/pull/221)
- CarlemanLinearization: [Remove IterTools (functionality available in Base)](https://github.com/JuliaReach/CarlemanLinearization.jl/pull/64)
- ReachabilityModels: [Revise code](https://github.com/JuliaReach/ReachabilityModels.jl/pull/120)

## 9/5/2024

- ARCH-COMP 2024 status

## 24/4/2024

- PRs:
- LazySets:
- [Use Unicode symbols in documentation](https://github.com/JuliaReach/LazySets.jl/pull/3496)
- [isempty and convex_hull for Polygon](https://github.com/JuliaReach/LazySets.jl/pull/3499)
- [Let binary `convex_hull` with `EmptySet` fall back to the unary method](https://github.com/JuliaReach/LazySets.jl/pull/3500)
- [Outsource documentation to API module](https://github.com/JuliaReach/LazySets.jl/pull/3497)
- ReachabilityAnalysis:
- [Remove old helper function](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/828)
- [Remove RecursiveArrayTools](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/820)
- ReachabilityBase:
- [Add CartesianIterator](https://github.com/JuliaReach/ReachabilityBase.jl/pull/68)
- [Let `nonzero_columns` filter approximately zero columns](https://github.com/JuliaReach/ReachabilityBase.jl/pull/67)
- [Add Basetype module](https://github.com/JuliaReach/ReachabilityBase.jl/pull/66)
- [Support `@current_path` with only one argument](https://github.com/JuliaReach/ReachabilityBase.jl/pull/60)
- [Type consistency for `distance` and `SingleEntryVector` method](https://github.com/JuliaReach/ReachabilityBase.jl/pull/62)
- [Arithmetic for SingleEntryVectors](https://github.com/JuliaReach/ReachabilityBase.jl/pull/63)

## 10/4/2024

- ARCH-COMP 2024 status
- PRs:
- ReachabilityAnalysis:
- [Outsource code to LazySets](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/824)
- [Replace DifferentialEquations by OrdinaryDiffEq](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/823)
- LazySets:
- [Add missing `convert` methods for `HPolytope`/`HPolyhedron`](https://github.com/JuliaReach/LazySets.jl/pull/3491)
- [`convert` from Taylor model to SparsePolynomialZonotope](https://github.com/JuliaReach/LazySets.jl/pull/3440)
- [`convert` from SparsePolynomialZonotope to Taylor model](https://github.com/JuliaReach/LazySets.jl/pull/3447)
- [Replace `Integer` -> `Int`](https://github.com/JuliaReach/LazySets.jl/pull/3443)
- [Generalize order-reducing overapproximate](https://github.com/JuliaReach/LazySets.jl/pull/3444)
- [Conversion from zonotopic set to Hyperrectangle](https://github.com/JuliaReach/LazySets.jl/pull/3484)
- [Use exact LP solver for integer sets](https://github.com/JuliaReach/LazySets.jl/pull/3486)
- [Bring back IntervalConstraintProgramming in tests](https://github.com/JuliaReach/LazySets.jl/pull/3482)

## 5/4/2024

- ARCH-COMP 2024 status
- PRs:
- ReachabilityAnalysis:
- Upgrade `TMJets` and TaylorX packages: [#808](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/808), [#819](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/819)
- Spacecraft model: [#814](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/814) ~~or [#815](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/815)~~
- [Fix ambiguities](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/801)
- MathematicalSystems:
- [Collect `using`s and fix import](https://github.com/JuliaReach/MathematicalSystems.jl/pull/296)
- [Define helper functions in tests only once](https://github.com/JuliaReach/MathematicalSystems.jl/pull/291)
- [Fix unbound args](https://github.com/JuliaReach/MathematicalSystems.jl/pull/288)
- Reorder exports:
- [BernsteinExpansions](https://github.com/JuliaReach/BernsteinExpansions.jl/pull/62)
- [StabilityRegions](https://github.com/JuliaReach/StabilityRegions.jl/pull/33)
- [MathematicalSets](https://github.com/JuliaReach/MathematicalSets.jl/pull/39)
- [SpaceExParser](https://github.com/JuliaReach/SpaceExParser.jl/pull/99)

## 15/3/2024

- ReachabilityAnalysis: [Support new versions of Taylor* packages](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/808)
- PRs (reviewed during the week):
- Flowstar: [TaylorModels compat v0.7; new release v0.2.6](https://github.com/JuliaReach/Flowstar.jl/pull/35)
- LazySets:
- [Fix unbound args](https://github.com/JuliaReach/LazySets.jl/pull/3461)
- [Fix piracy with `<=`](https://github.com/JuliaReach/LazySets.jl/pull/3462)
- [Fix piracies with `activate_assertions` & `deactivate_assertions`](https://github.com/JuliaReach/LazySets.jl/pull/3463)
- [Remove redundant generators in zonotope overapproximations](https://github.com/JuliaReach/LazySets.jl/pull/3446)
- [Concrete translation of lazy operations](https://github.com/JuliaReach/LazySets.jl/pull/3474)
- [`reduce_order` for zonotope with static matrix](https://github.com/JuliaReach/LazySets.jl/pull/3467)
- [Generalize `reduce_order` with StaticArrays matrix](https://github.com/JuliaReach/LazySets.jl/pull/3476)
- [Remove calls to `uniqueID` (done in constructor)](https://github.com/JuliaReach/LazySets.jl/pull/3448)
- [Move PkgVersion code to central place](https://github.com/JuliaReach/LazySets.jl/pull/3459)
- [More convert methods for HPolytope/HPolyhedron](https://github.com/JuliaReach/LazySets.jl/pull/3466)
- [Use `eachindex` instead of `1:length` resp. `axes` instead of `1:size`](https://github.com/JuliaReach/LazySets.jl/pull/3464)
- [Remove `__precompile__()`](https://github.com/JuliaReach/LazySets.jl/pull/3470)
- [Revise `rectify`](https://github.com/JuliaReach/LazySets.jl/pull/3469)
- [Support `overapproximate` of unions instead of convex hulls](https://github.com/JuliaReach/LazySets.jl/pull/3458)
- [Make test conditional on IA version](https://github.com/JuliaReach/LazySets.jl/pull/3477)
- [Run doctests when building docs instead of tests](https://github.com/JuliaReach/LazySets.jl/pull/3478)
- [Fix piracy with `rand`](https://github.com/JuliaReach/LazySets.jl/pull/3481)
- [`decompose` for fixed target type with overapproximation](https://github.com/JuliaReach/LazySets.jl/pull/3468)
- ReachabilityAnalysis:
- [Support ntdiv splitting in TM-zonotope overapproximation](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/809)
- [Fix unbound args](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/799)
- [Avoid `using` packages and collect `using`s and `export`s](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/803)
- [Fix some ambiguities](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/811)
- [Fix some piracies](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/802)
- [Define `box_approximation` for `AbstractReachSet`s and `AbstractFlowpipe`s](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/805)
- [Import `flatten`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/812)
- [Use `==` instead of `isequal` and `eachindex` instead of `1:length`](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/800)
- RangeEnclosures:
- [Pass kwargs to default algorithm](https://github.com/JuliaReach/RangeEnclosures.jl/pull/174)

## 27/2/2024

- PRs:
- Aqua:
- https://github.com/JuliaReach/BernsteinExpansions.jl/pull/58
- https://github.com/JuliaReach/CarlemanLinearization.jl/pull/57
- https://github.com/JuliaReach/ControllerFormats.jl/pull/32
- https://github.com/JuliaReach/IntervalMatrices.jl/pull/238
- https://github.com/JuliaReach/MathematicalPredicates.jl/pull/45
- https://github.com/JuliaReach/MathematicalSets.jl/pull/37
- https://github.com/JuliaReach/MathematicalSystems.jl/pull/279
- Rename `sort`
- https://github.com/JuliaReach/NeuralNetworkReachability.jl/pull/16
- https://github.com/JuliaReach/RangeEnclosures.jl/pull/166
- https://github.com/JuliaReach/ReachabilityBenchmarks/pull/211
- https://github.com/JuliaReach/JuliaReachDevDocs/pull/55
- https://github.com/JuliaReach/JuliaReachTemplatePkg.jl/pull/31
- https://github.com/JuliaReach/ReachabilityBase.jl/pull/56
- https://github.com/JuliaReach/SpaceExParser.jl/pull/89
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/785
- https://github.com/JuliaReach/LazySets.jl/pull/3439
- add badge [](https://github.com/JuliaTesting/Aqua.jl)
- replace $ by ``` `` ```
- https://github.com/JuliaReach/BernsteinExpansions.jl/pull/59
- https://github.com/JuliaReach/IntervalMatrices.jl/pull/239
- https://github.com/JuliaReach/LazySets.jl/pull/3445
- https://github.com/JuliaReach/ReachabilityModels.jl/pull/116
- https://github.com/JuliaReach/ClosedLoopReachability.jl/pull/368
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/786
- MathematicalSystems: [Require Julia v1.5](https://github.com/JuliaReach/MathematicalSystems.jl/pull/280)
- ReachabilityBase: [Refactor to fix warning](https://github.com/JuliaReach/ReachabilityBase.jl/pull/57)
- CarlemanLinearization: [Refactor to avoid warning](https://github.com/JuliaReach/CarlemanLinearization.jl/pull/58)
- ReachabilityModels: [Remove unused packages](https://github.com/JuliaReach/ReachabilityModels.jl/pull/115)
- ReachabilityModels: [Prefix `Hybridsystems.` to avoid warnings](https://github.com/JuliaReach/ReachabilityModels.jl/pull/117)
- ReachabilityBenchmarks: [Format models and prefix `BenchmarkTools.` to avoid warnings](https://github.com/JuliaReach/ReachabilityBenchmarks/pull/212)
- ReachabilityAnalysis: [Minor fixes](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/784)
- Rename `IntervalMatrices.get` to `materialize`
- ReachabilityAnalysis: [Fix method-call errors in XFZ18](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/787)
- Add tests for `XFZ18`
- ReachabilityAnalysis: [Revise models](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/783)
- in the end: update models in tests
- most (now all) models have the `using`s hidden with `#!jl` - correct?
- idea: https://github.com/Ferrite-FEM/Ferrite.jl/blob/master/docs/src/literate-gallery/topology_optimization.jl (use `__@CODE__` to show all the code)
- Brusselator: many lines hidden with `#!jl`
- Spacecraft:
- Warning: maximum number of jumps reached; try increasing `max_jumps`
- r or r_c for v_x ??
- LotkaVolterraTangential: see TODO
- TransmissionLine: T = 0.7 * 1e-11 ??

## 16/2/2024

- PRs:
- https://github.com/JuliaReach/LazySets.jl/pull/3438
- https://github.com/JuliaReach/MathematicalSystems.jl/pull/278
- https://github.com/JuliaReach/RangeEnclosures.jl/pull/165
- started with matrix zonotopes (in [this branch](https://github.com/JuliaReach/LazySets.jl/compare/schillic/matrixset?expand=1))

## 9/2/2024

- PRs:
- revision of CI scripts; example: https://github.com/JuliaReach/BernsteinExpansions.jl/pull/55
- https://github.com/JuliaReach/ReachabilityBase.jl/pull/54
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/777
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/776
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/775
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/774
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/773
- https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/770
- https://github.com/JuliaReach/LazySets.jl/pull/3436

## 19/1/2024

- PRs:
- https://github.com/JuliaReach/LazySets.jl/pull/3426
- https://github.com/JuliaReach/LazySets.jl/pull/3428
- https://github.com/JuliaReach/RangeEnclosures.jl/pull/160
- https://github.com/JuliaReach/RangeEnclosures.jl/pull/162
- work on polynomial zonotopes

## 12/1/2024

- notebook hosting
- PR: https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/761
- opened [LKB23 project](https://github.com/orgs/JuliaReach/projects/8)
- create a notebook with examples
- implement matrix zonotope (special case of a matrix set, just as an interval matrix - probably could go to a new package for matrix sets)
- https://github.com/JuliaReach/LazySets.jl/issues/3018

## 5/1/2024

- post to Element with Zulip link
- PRs
- https://github.com/JuliaReach/LazySets.jl/pull/3415
- https://github.com/JuliaReach/LazySets.jl/pull/3417
- https://github.com/JuliaReach/LazySets.jl/pull/3418
- https://github.com/JuliaReach/RangeEnclosures.jl/pull/156
- https://github.com/JuliaReach/IntervalMatrices.jl/pull/225
- https://github.com/JuliaReach/IntervalMatrices.jl/pull/223
- Taylor algorithms should be updated (currently prevents ModelingToolkit from building)

### Plan for 2024

- nonlinear reachability (e.g., polynomial zonotopes)
- linear parametric reachability (e.g., polynomial zonotopes)
- AI controller reachability
- underapproximation
- unified documentation for JuliaReach / web page

## 24/11/2023

- fixed hidden line in documentation https://github.com/JuliaReach/ReachabilityAnalysis.jl/issues/751
- continued with notebook https://github.com/JuliaReach/Notebooks
- continued with discretization modules

## 17/11/2023

#### Creating a dynamic demo notebook

- https://github.com/JuliaReach/Notebooks

- Hosting
- JuliaHub
- Binder (https://github.com/fonsp/pluto-on-binder)
- Seems easiest. Free.
- https://github.com/JuliaPluto/PlutoSliderServer.jl
- https://binderhub.readthedocs.io/en/latest/
- https://github.com/JuliaPluto/static-export-template
- Our own deployment via juliareach.org and PlutoSliderServer
- Jolin.io ? https://www.jolin.io/en/service-offer/

- Define notebook(s)
- Linear reachability
- Loading data
- Plotting
- Nonlinear reachability

## 10/11/2023

- answered question about plotting a 3D set https://discourse.julialang.org/t/plotting-polyhedron-with-makie/41306/3
- started to create modules for discretization algorithms

## 03/11/2023

- spell checker
- uses https://github.com/marketplace/actions/github-spellcheck-action
- https://facelessuser.github.io/pyspelling/
- ReachabilityAnalysis:
- unused pictures https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/747/files
- storage/norm https://github.com/JuliaReach/ReachabilityAnalysis.jl/issues/743
- ReachabilityModels: `@relpath` https://github.com/JuliaReach/ReachabilityModels.jl/pull/94/files
- LazySets:
- `length` https://github.com/JuliaReach/LazySets.jl/pull/3388
- faster infinity norm https://github.com/JuliaReach/LazySets.jl/pull/3390

## 20/10/2023

- discussed [question about maximum norm](https://github.com/JuliaReach/ReachabilityAnalysis.jl/issues/743#issuecomment-1764872655)
- finished [`Exponentiation` module](https://github.com/JuliaReach/ReachabilityAnalysis.jl/pull/745)

## 13/10/2023

- https://github.com/JuliaReach/JuliaReachDevDocs/pull/51
- [approach](https://github.com/JuliaReach/ClosedLoopReachability.jl/blob/1fc2f67d9b52b51a6426efd014d19d26f81dae2f/docs/generate.jl#L22-L24) to `@relpath` in ClosedLoopReachability
- ReachabilityAnalysis.jl refactor: next steps
- [x] Discrete systems
- Idea would be to leverage dispatch on `post` by first adding a new method on `<:AbstractDiscreteSystem` which reuses the existing code. Then as a second step, make sure that one can directly call such `post` from within `solve` if a discrete system is given.
- issue: https://github.com/JuliaReach/ReachabilityAnalysis.jl/issues/749

## 06/10/2023

- Updating pkgs to Documenter 1.0
- [x] https://github.com/JuliaReach/LazySets.jl/pull/3381
- [x] https://github.com/JuliaReach/ReachabilityModels.jl/pull/93
- solution proposal: copy other files to build folder
- https://github.com/JuliaReach/IntervalMatrices.jl/pull/216
- Idea: JuliaReach.jl package which has a Manifest on it and pulls relevant packages. Providing an interface for new users.
- Downside: not registered
- Upside: providing a Manifest.toml gives more control that things 'just work'
- Repeatability package for p-boxes paper
- Integrating ProbabilisticReachability.jl into ReachabilityAnalysis.jl
- Large RA.jl refactor
- Example: https://github.com/ONSAS/ONSAS.jl

## 25/08/2023

- Review LazySets project: https://github.com/JuliaReach/LazySets.jl/projects/2
- Closed
- LazySets: Remove documentation of unexported `AbstractBallp` interface methods
- Issues with upgrading to IA 0.21
- https://github.com/JuliaReach/IntervalMatrices.jl/pull/216
- Approximate comparison of intervals
- Discussed about reviewing old LazySets issues and outsourcing those which are "meta" / open-ended to its own repo or docs, or meta-issue.

## 18/08/2023

- State of the webpage (juliareach.github.io/)
- Last renewal (Marcelo): 20,16 € , sáb, 29 jul, 08:01
- https://juliareach.com/ doesn't work, but juliareach.com works immediately, forwarding to https://juliareach.github.io/
- https://github.com/JuliaReach/JuliaReach-website contains the source code of the webpage
- https://github.com/JuliaReach/juliareach.github.io is the deployed version
- Next step: run webpage locally: https://github.com/JuliaReach/JuliaReach-website/wiki#set-up-guide
- We set up HackMD notes for JuliaReach dev calls
- https://hackmd.io/@juliareach/dev

#### Outstanding LazySets PRs

- Reviews
- about https://github.com/JuliaReach/LazySets.jl/pull/3352:
- Idea: define `union` or `union_set` that has logic similar to

l = length(sets)
filter!(!isempty, sets)
if length(sets) > 1
    if length(sets) < l
        sets = [X for X in sets]  # re-allocate set-specific array
    end
    return UnionSetArray(sets)
elseif length(sets) == 1
    return sets[1]
else
    N = promote_type(eltype(cup), eltype(X))
    return EmptySet{N}(dim(X))
end