TimQu
|
117d1b5c99
|
clean up single objective reward bounded case
|
8 years ago |
TimQu
|
016fedd58e
|
Better progress info
|
8 years ago |
TimQu
|
3215f25513
|
upper result bounds for cumulative reward formulas to enable interval iteration
|
8 years ago |
TimQu
|
d91d979d90
|
changed some output
|
8 years ago |
TimQu
|
70dc9ce7ac
|
Bypassing requirements check to make value iteration without a lower result bound work
|
8 years ago |
TimQu
|
e3a506ecc6
|
Property information output
|
8 years ago |
TimQu
|
4cadc61f19
|
less searches for epoch solutions
|
8 years ago |
TimQu
|
b56cd07d0e
|
Consider only a submap of all epochsolutions for faster search
|
8 years ago |
TimQu
|
5071df5c82
|
made sound value iteration work and respect the correct precision
|
8 years ago |
TimQu
|
9140c1dc0e
|
statistics and empty-epoch-matrix optimization also for single objective case
|
8 years ago |
TimQu
|
108e8e69e8
|
Changed statistics output a little. Optimized the case where the transition matrix of the epoch model is empty
|
8 years ago |
TimQu
|
23686a0f09
|
reward bounded cumulative reward formulas + fixes for dimensions that do not need memory
|
8 years ago |
TimQu
|
9901995280
|
Export of weight vector in the cdf
|
8 years ago |
TimQu
|
fb21ffca63
|
Respected whether the linear equation solver wants the fix point or eq sys formulation
|
8 years ago |
TimQu
|
64a804137e
|
export of cdf's
|
8 years ago |
TimQu
|
a4a8bc2e69
|
accessing the epoch manager and the dimensions from the outside
|
8 years ago |
TimQu
|
682a0483d2
|
helped gmm to converge...
|
8 years ago |
TimQu
|
4da61d972c
|
fixed correctly setting the result bounds for weight vector checker
|
8 years ago |
TimQu
|
b788c1b403
|
reuse scheduler from previous epoch as initial hint
|
8 years ago |
TimQu
|
952f49fb10
|
fix for interval iteration in weight vector checkers
|
8 years ago |
TimQu
|
11da1ddc14
|
upper bounds for expected reward objectives
|
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 |
TimQu
|
9039323fa9
|
optimized setting the epoch class
|
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 |
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 |
TimQu
|
17a45a43eb
|
better transformation of memory states
|
8 years ago |
TimQu
|
7d4a438e82
|
Fixes for lower bounds
|
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 |
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 |
TimQu
|
3a309caafc
|
epochs are now uints instead of vector<int>s
|
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 |