Merge pull request #534 from JuliaReach/schillic/490

#490 - Decomposition of one-block partitions
JuliaReach · Mar 10, 2019 · b81c820 · b81c820
2 parents 36fa9f4 + f970c28
commit b81c820
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 4 deletions.
diff --git a/src/ReachSets/ContinuousPost/BFFPSV18/check_property.jl b/src/ReachSets/ContinuousPost/BFFPSV18/check_property.jl
@@ -38,8 +38,9 @@ function check_property(S::IVP{<:AbstractDiscreteSystem},
     N = ceil(Int, options[:T] / options[:δ])
 
     # Cartesian decomposition of the initial set
-    if length(partition) == 1 && length(partition[1]) == n
-        info("- No decomposition of X0 needed")
+    if length(partition) == 1 && length(partition[1]) == n &&
+            options[:block_options_init] == LinearMap
+        info("- Skipping decomposition of X0")
         Xhat0 = [S.x0]
     else
         info("- Decomposing X0")

diff --git a/src/ReachSets/ContinuousPost/BFFPSV18/reach.jl b/src/ReachSets/ContinuousPost/BFFPSV18/reach.jl
@@ -53,8 +53,9 @@ function reach(S::Union{IVP{<:LDS{NUM}, <:LazySet{NUM}},
     N = ceil(Int, options[:T] / options[:δ])
 
     # Cartesian decomposition of the initial set
-    if length(partition) == 1 && length(partition[1]) == n
-        info("- No decomposition of X0 needed")
+    if length(partition) == 1 && length(partition[1]) == n &&
+            options[:block_options_init] == LinearMap
+        info("- Skipping decomposition of X0")
         Xhat0 = LazySet{NUM}[S.x0]
     else
         info("- Decomposing X0")