dehnert
|
df05711f3e
|
finished rational search for MinMax solver, preparing rational search for NativeLinearEquationSolver
|
8 years ago |
TimQu
|
c396ab0ca5
|
more solver requirements for multi-objective model checking
|
8 years ago |
|
TimQu
|
64ca58494d
|
considered solver requirements for multiobjective model checking
|
8 years ago |
|
dehnert
|
cb15db041c
|
add missing include
|
8 years ago |
|
dehnert
|
2d41de479e
|
added progress outputs to iterative solvers
|
8 years ago |
|
dehnert
|
7f56c82523
|
moved to providing solve goals in sparse model checkers and helpers
|
8 years ago |
|
dehnert
|
c8e19d2e44
|
fixed priority queue implementation and upper reward bound computation
|
8 years ago |
|
dehnert
|
51e64b8ebd
|
started on Baier-style upper reward bound computation
|
8 years ago |
|
dehnert
|
52d729b1c7
|
upper bounds computation for reachability rewards in sparse MDPs
|
8 years ago |
|
TimQu
|
9039323fa9
|
optimized setting the epoch class
|
8 years ago |
|
dehnert
|
b4a0016362
|
zero-reward MEC elimination for reachability rewards
|
8 years ago |
|
dehnert
|
fe8c3820fd
|
started cleanup of reachability rewards in sparse MDP helper
|
8 years ago |
|
dehnert
|
e5572db54e
|
eliminating ECs for sound value iteration for until probabilities
|
8 years ago |
|
dehnert
|
b4bfd0c39f
|
performance improvement in DS-MPI; some cleanups
|
8 years ago |
|
TimQu
|
630acb7459
|
parsing of until formulas with multiple bounds
|
8 years ago |
|
TimQu
|
36c3a4d9ef
|
Avoided conversion of memory states. They are now directly represented as 64 bit integers
|
8 years ago |
|
dehnert
|
19ac4a360f
|
intermediate commit
|
8 years ago |
|
TimQu
|
37d5dceaab
|
added small check
|
8 years ago |
|
TimQu
|
7fc65707a9
|
set the maximal value for each dimension. Also support for dependent dimensions
|
8 years ago |
|
TimQu
|
8f8f0bf804
|
corrected the search for the set of reachble epoch classes
|
8 years ago |
|
TimQu
|
d0209a804b
|
Setting reachable product states now also uses the transformMemoryState method
|
8 years ago |
|
dehnert
|
cb849a9ab8
|
started on computing upper bounds for rewards for interval value iteration
|
8 years ago |
|
dehnert
|
9d98bf5fa8
|
automatically switching solvers if soundness is enforced
|
8 years ago |
|
dehnert
|
df0b5fbfa5
|
fixed multiply-reduce operations in the presence of empty row groups
|
8 years ago |
|
TimQu
|
17a45a43eb
|
better transformation of memory states
|
8 years ago |
|
dehnert
|
d25cc4b05f
|
first version of sound value iteration
|
8 years ago |
|
TimQu
|
7d4a438e82
|
Fixes for lower bounds
|
8 years ago |
|
dehnert
|
ec61e110f2
|
introducing solver formats to enable linear equation solvers to take the fixed point rather than the equation system formulation
|
8 years ago |
|
TimQu
|
b054b67312
|
first version for lower bounded properties
|
8 years ago |
|
TimQu
|
4ba20d11d4
|
more functionality for epoch manager
|
8 years ago |
|
TimQu
|
d129683c61
|
gathered dimension related data into a struct. Also started with lower reward bounds
|
8 years ago |
|
TimQu
|
41cf4e76db
|
The solutions are now stored epoch-wise and will be erased as soon as all predecessor epochs are computed
|
8 years ago |
|
TimQu
|
3044aaa3f5
|
The product model is now handled in a separate class
|
8 years ago |
|
TimQu
|
1ccc241462
|
computations on epochs are now handled in a separate class
|
8 years ago |
|
TimQu
|
d3e50b8769
|
optimized productInState Computation
|
8 years ago |
|
TimQu
|
47ab74a16b
|
implemented single objective queries
|
8 years ago |
|
TimQu
|
8b466f1fa7
|
extended multidimensional bounded until formulas to have different subformulas in each dimension
|
8 years ago |
|
dehnert
|
00f88ed452
|
gauss-seidel-style value iteration
|
8 years ago |
|
TimQu
|
cbe73081f8
|
zig zag epoch computation order
|
8 years ago |
|
TimQu
|
6ae05560fc
|
setting solutions in place
|
8 years ago |
|
dehnert
|
9d95d2adcf
|
first version of multiply-and-reduce (only for native)
|
8 years ago |
|
TimQu
|
488479b5a7
|
better objectiveRewardFilter
|
8 years ago |
|
TimQu
|
cd6a79de23
|
used cache memory when checking each epoch
|
8 years ago |
|
TimQu
|
13ade58fa0
|
using pair<uint, uint> in the map instead of vectors of size 2
|
8 years ago |
|
dehnert
|
3c844a487f
|
some more optimizations
|
8 years ago |
|
TimQu
|
3a309caafc
|
epochs are now uints instead of vector<int>s
|
8 years ago |
|
dehnert
|
5fafe835cb
|
started on some optimizations for conditionals in MDPs
|
8 years ago |
|
TimQu
|
27ee299f63
|
more efficient comparison of epoch classes
|
8 years ago |
|
TimQu
|
cf91a34970
|
use cached memory for the epoch results
|
8 years ago |
|
TimQu
|
9735ff98d0
|
SolutionType is now a single vector instead of a struct
|
8 years ago |
