dehnert
|
bba2832e5b
|
finished Walker-Chae method
|
7 years ago |
TimQu
|
47ab74a16b
|
implemented single objective queries
|
7 years ago |
|
TimQu
|
8b466f1fa7
|
extended multidimensional bounded until formulas to have different subformulas in each dimension
|
7 years ago |
|
dehnert
|
5440d164b2
|
started on Walker-Chae algorithm
|
7 years ago |
|
dehnert
|
c77b9ce404
|
gauss-seidel style multiplication for gmm++
|
7 years ago |
|
dehnert
|
43643b9699
|
bump gmm++ version to 5.2 (from 5.0)
|
7 years ago |
|
dehnert
|
d27954622a
|
slightly changed handling of gauss-seidel invocations in linear equation solver
|
7 years ago |
|
dehnert
|
6e548627ee
|
adding storm-pgcl as a dependency to target binaries
|
7 years ago |
|
dehnert
|
00f88ed452
|
gauss-seidel-style value iteration
|
7 years ago |
|
TimQu
|
cbe73081f8
|
zig zag epoch computation order
|
7 years ago |
|
TimQu
|
6ae05560fc
|
setting solutions in place
|
7 years ago |
|
dehnert
|
9d95d2adcf
|
first version of multiply-and-reduce (only for native)
|
7 years ago |
|
dehnert
|
e37d5869ef
|
extracted static version to separate cmake file
|
7 years ago |
|
dehnert
|
dd035f7f5e
|
allow for summand in matrix-vector multiplication
|
7 years ago |
|
TimQu
|
488479b5a7
|
better objectiveRewardFilter
|
7 years ago |
|
TimQu
|
cd6a79de23
|
used cache memory when checking each epoch
|
7 years ago |
|
TimQu
|
13ade58fa0
|
using pair<uint, uint> in the map instead of vectors of size 2
|
7 years ago |
|
dehnert
|
3c844a487f
|
some more optimizations
|
7 years ago |
|
TimQu
|
3a309caafc
|
epochs are now uints instead of vector<int>s
|
7 years ago |
|
dehnert
|
5fafe835cb
|
started on some optimizations for conditionals in MDPs
|
7 years ago |
|
TimQu
|
27ee299f63
|
more efficient comparison of epoch classes
|
7 years ago |
|
TimQu
|
cf91a34970
|
use cached memory for the epoch results
|
7 years ago |
|
TimQu
|
9735ff98d0
|
SolutionType is now a single vector instead of a struct
|
7 years ago |
|
TimQu
|
d6099a91a7
|
Further optimizations for setEpoch + started to work on single objective mode
|
7 years ago |
|
TimQu
|
57e604a815
|
optimized setCurrentEpoch a little
|
7 years ago |
|
TimQu
|
e4ac32a6fc
|
fixed selection of considered state in reduced model and optimized setting the stepsolutions
|
7 years ago |
|
dehnert
|
45e0796228
|
updated changelog
|
7 years ago |
|
TimQu
|
11fc1d29eb
|
more output for statistics
|
7 years ago |
|
dehnert
|
cffc3e606e
|
Merge branch 'master' into solver_requirements
|
7 years ago |
|
TimQu
|
1985a29c5d
|
Merge branch 'master' into reward-bounded-multi-objective
|
7 years ago |
|
TimQu
|
b7e2aec82c
|
Fixed issue where variable names were reserved symbols of Exprtk
|
7 years ago |
|
TimQu
|
ff8c7813bb
|
commented out failing tests in the fragmentchecker
|
7 years ago |
|
dehnert
|
83fdffadc6
|
adapted tests; in particular enabled previously disabled rewards test
|
7 years ago |
|
dehnert
|
9bda631795
|
symbolic MDP helper respecting solver requirements
|
7 years ago |
|
dehnert
|
7c24607427
|
started on symbolic solver requirements
|
7 years ago |
|
dehnert
|
e81d979d56
|
hybrid MDP helper respecting solver requirements
|
7 years ago |
|
TimQu
|
1bb8b3b497
|
only store the results that will be needed eventually
|
7 years ago |
|
TimQu
|
62e4558af1
|
reduced number of states considered in the epoch model
|
7 years ago |
|
TimQu
|
8e56efed3a
|
reduced the number of states in the product model
|
7 years ago |
|
TimQu
|
999fd0752c
|
The model memory product can now retrieve the reachable states without actually building the product
|
7 years ago |
|
TimQu
|
11a4f8d016
|
restructured initialization of modelmemory product
|
7 years ago |
|
dehnert
|
a3cbaedcc1
|
intermediate commit to switch workplace
|
7 years ago |
|
TimQu
|
90a7ea4907
|
printing timing information
|
7 years ago |
|
dehnert
|
12b10af672
|
started on hybrid MDP helper respecting solver requirements
|
7 years ago |
|
TimQu
|
61a6b178b7
|
restricted the number of reachable product states
|
7 years ago |
|
dehnert
|
3c4de8ace3
|
moved requirements to new file
|
7 years ago |
|
dehnert
|
4c5cdfeafc
|
Sparse MDP helper now also respects solver requirements for reachability rewards
|
7 years ago |
|
dehnert
|
f327ff75e9
|
showing progress for bisimulation
|
7 years ago |
|
dehnert
|
74eeaa7f81
|
computing unbounded until on MDPs with the sparse helper now respects solver requirements
|
7 years ago |
|
TimQu
|
40edc0ca4d
|
assert that there are no endcomponents with positive rewards
|
7 years ago |
