polish bibliography

Author: schillic

docs/src/refs.bib

@@ -215,6 +215,37 @@ @article{AlthoffSB10
   doi={10.1016/j.nahs.2009.03.009}
 }
 
+@inproceedings{AlthoffGK11,
+  author       = {Matthias Althoff and
+                  Colas Le Guernic and
+                  Bruce H. Krogh},
+  editor       = {Marco Caccamo and
+                  Emilio Frazzoli and
+                  Radu Grosu},
+  title        = {Reachable set computation for uncertain time-varying linear systems},
+  booktitle    = {{HSCC}},
+  pages        = {93--102},
+  publisher    = {{ACM}},
+  year         = {2011},
+  url          = {https://doi.org/10.1145/1967701.1967717},
+  doi          = {10.1145/1967701.1967717}
+}
+
+@inbook{AlthoffKS11,
+  author       = {Matthias Althoff and
+                  Bruce H. Krogh and
+                  Olaf Stursberg},
+  editor       = {Andreas Rauh and
+                  Ekaterina Auer},
+  title        = {Analyzing Reachability of Linear Dynamic Systems with Parametric Uncertainties},
+  booktitle    = {Modeling, Design, and Simulation of Systems with Uncertainties},
+  pages        = {69--94},
+  publisher    = {Springer},
+  year         = {2011},
+  url          = {https://doi.org/10.1007/978-3-642-15956-5_4},
+  doi          = {10.1007/978-3-642-15956-5_4}
+}
+
 @inproceedings{FrehseGDCRLRGDM11,
   author       = {Goran Frehse and
                   Colas Le Guernic and
@@ -254,7 +285,7 @@ @inproceedings{AlthoffK12
   doi          = {10.1145/2185632.2185643}
 }
 
-@inproceedings{Frehse012,
+@inproceedings{FrehseR12,
   author       = {Goran Frehse and
                   Rajarshi Ray},
   editor       = {Maurice Heemels and
@@ -455,6 +486,21 @@ @inproceedings{MitchellBB19
   doi          = {10.1145/3302504.3313354}
 }
 
+@misc{JordanD21,
+  author       = {Matt Jordan and
+                  Alex Dimakis},
+  editor       = {Marina Meila and
+                  Tong Zhang},
+  title        = {Provable {L}ipschitz Certification for Generative Models},
+  booktitle    = {{ICML}},
+  series       = {PMLR},
+  volume       = {139},
+  pages        = {5118--5126},
+  publisher    = {{PMLR}},
+  year         = {2021},
+  url          = {http://proceedings.mlr.press/v139/jordan21a.html}
+}
+
 @article{KochdumperA21,
   author       = {Niklas Kochdumper and
                   Matthias Althoff},
@@ -530,49 +576,7 @@ @article{HuangLBS2025
   title       = {Reachability analysis for linear systems with uncertain parameters using polynomial zonotopes},
   journal     = {Nonlinear Analysis: Hybrid Systems},
   volume      = {56},
-  pages       = {101571},
   year        = {2025},
-  issn        = {1751-570X},
-  url         = {https://www.sciencedirect.com/science/article/pii/S1751570X24001080},
+  url         = {https://doi.org/10.1016/j.nahs.2024.101571},
   doi         = {10.1016/j.nahs.2024.101571}
 }
-
-@misc{JordanD21,
-  author       = {Matt Jordan and
-                  Alex Dimakis},
-  editor       = {Marina Meila and
-                  Tong Zhang},
-  title        = {Provable {L}ipschitz Certification for Generative Models},
-  booktitle    = {{ICML}},
-  series       = {PMLR},
-  volume       = {139},
-  pages        = {5118--5126},
-  publisher    = {{PMLR}},
-  year         = {2021},
-  url          = {http://proceedings.mlr.press/v139/jordan21a.html}
-}
-
-@inproceedings{AlthoffGCKH11,
-  author       = {Althoff, Matthias and Le Guernic, Colas and Krogh, Bruce H.},
-  title        = {Reachable set computation for uncertain time-varying linear systems},
-  booktitle    = {Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control},
-  series       = {HSCC '11},
-  pages        = {93–102},
-  year         = {2011},
-  isbn         = {9781450306294},
-  doi          = {10.1145/1967701.1967717},
-  publisher    = {Association for Computing Machinery},
-  url          = {https://doi.org/10.1145/1967701.1967717},
-  }
-  
-  @article{AlthoffKS11,
-  author       = {Althoff, Matthias and Krogh, Bruce and Stursberg, Olaf},
-  title        = {Analyzing Reachability of Linear Dynamic Systems with Parametric Uncertainties},
-  journal      = {Mathematical Engineering},
-  volume       = {3},
-  year         = {2011},
-  month        = {05},
-  pages        = {69-94},
-  isbn         = {978-3-642-15955-8},
-  doi          = {10.1007/978-3-642-15956-5_4}
-}

src/Approximations/overapproximate.jl

@@ -293,7 +293,7 @@ The idea is to solve the univariate optimization problem `ρ(di, X ∩ Hi)` for
 each half-space of the set `P` and then take the minimum.
 This gives an overapproximation of the exact support function.
 
-This algorithm is inspired from [Frehse012](@citet).
+This algorithm is inspired from [FrehseR12](@citet).
 
 ### Notes
 
@@ -885,14 +885,14 @@ end
     overapproximate(MZP::MatrixZonotopeProduct{N,S},
                          ::Type{<:MatrixZonotope}) where {N,S<:AbstractMatrix{N}}
 
-Overapproximate the product of matrix zonotopes, following Equation 4.10 in [AlthoffKS11](@citet).
+Overapproximate the product of matrix zonotopes, following [AlthoffKS11; Equation 4.10](@citet).
 
 ### Input
 
 - `MZP` -- a `MatrixZonotopeProduct`
 - `MatrixZonotope` -- target type
 
-### Output 
+### Output
 
 A matrix zonotope overapproximating the matrix zonotope product
 """
@@ -919,7 +919,7 @@ function overapproximate(MZP::MatrixZonotopeProduct{N,S},
             gens[j] = center(A) * generators(B)[j]
         end
 
-        # Gᵢ ⋅ Hⱼ block 
+        # Gᵢ ⋅ Hⱼ block
         idx = nB + 1
         @inbounds for Gi in generators(A), Hj in generators(B)
             gens[idx] = Gi * Hj
@@ -945,7 +945,7 @@ function load_intervalmatrices_overapproximation_matrixzonotope()
         - `A` -- a matrix zonotope
         - `IntervalMatrix` -- target type
 
-        ### Output 
+        ### Output
 
         An interval matrix overapproximating the matrix zonotope
         """

src/Approximations/overapproximate_expmap.jl

@@ -169,22 +169,22 @@ function load_intervalmatrices_overapproximation_expmap()
         - `MatrixZonotope` -- target type
         - `k` -- (default: `2`) the order of the Taylor expansion
 
-        ### Output 
+        ### Output
 
         A matrix zonotope overapproximating the matrix zonotope exponential
 
         ### Algorithm
 
         The expansion
 
-        ```math 
+        ```math
         exp(\\mathcal{A}) ⊆ \\sum_i^k \\frac{\\mathcal{A}^i}{i!} + E_k
         ```
 
-        is computed by overapproximating the matrix zonotope powers ``A^i`` 
-        for ``i=0, …, k``. 
-        The remainder term ``E_k`` is computed through interval arithmetic 
-        following Proposition 4.1 by [AlthoffKS11](@citet). 
+        is computed by overapproximating the matrix zonotope powers ``A^i``
+        for ``i=0, …, k``.
+        The remainder term ``E_k`` is computed through interval arithmetic
+        following [AlthoffKS11; Proposition 4.1](@citet).
         """
         function overapproximate(expA::MatrixZonotopeExp{N,T}, ::Type{<:MatrixZonotope},
                                  k::Int=2) where {N,T<:AbstractMatrixZonotope{N}}

src/Approximations/overapproximate_zonotope.jl

@@ -1251,7 +1251,7 @@ end  # load_overapproximate_ICP()
                                                   MAT<:MatrixZonotope{NM}}
 
 Overapproximate the linear map of a zonotope through a matrix zonotope,
-following Proposition 4 in [AlthoffGCKH11](@citet).
+following [AlthoffGK11; Proposition 4](@citet).
 
 ### Input
 

src/LazyOperations/Intersection.jl

@@ -376,7 +376,7 @@ The algorithms are based on solving the associated optimization problem
 where ``D_h = \\{ λ : λ ≥ 0 \\}`` if ``H`` is a half-space or
 ``D_h = \\{ λ : λ ∈ ℝ \\}`` if ``H`` is a hyperplane.
 
-For additional information we refer to [Frehse012, LeGuernic09, RockafellarW98](@citet)
+For additional information we refer to [FrehseR12, LeGuernic09, RockafellarW98](@citet)
 """
 @validate function ρ(d::AbstractVector, cap::Intersection{N,S1,S2};
                      algorithm::String="line_search",
@@ -417,7 +417,7 @@ The idea is to solve the univariate optimization problem `ρ(di, X ∩ Hi)` for
 each half-space in the polyhedron and then take the minimum. This gives an
 overapproximation of the exact support value.
 
-This algorithm is inspired from [Frehse012](@citet).
+This algorithm is inspired from [FrehseR12](@citet).
 
 ### Notes
 

src/MatrixSets/MatrixZonotope.jl

@@ -19,7 +19,7 @@ Mathematically a matrix zonotope is defined as the set of matrices
 ```
 
 It can be written in shorthand notation as ``\\mathcal{A} = \\braket{A^{(0)},A^{(1)}, ..., A^{(p)} }_{MZ}.
-Matrix zonotopes were introduced in [AlthoffGCKH11](@citet).
+Matrix zonotopes were introduced in [AlthoffGK11](@citet).
 
 ### Examples