TimQu
|
fd8c99b989
|
Introducing Environment in MinMaxSolvers and ModelCheckers
|
8 years ago |
|
TimQu
|
d9e62a66cc
|
cdf export for single objective formulas
|
8 years ago |
|
TimQu
|
c9beea4f33
|
better lower/upper result bounds
|
8 years ago |
|
TimQu
|
86253fe88a
|
moved multidimensional unfolding implementation from multiobjective into helper namespace
|
8 years ago |
|
TimQu
|
117d1b5c99
|
clean up single objective reward bounded case
|
8 years ago |
|
TimQu
|
016fedd58e
|
Better progress info
|
8 years ago |
|
TimQu
|
33585c811f
|
MinMax Solver requirements now respect whether the solution is known to be unique or not.
|
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
|
5c1de03d14
|
fixed min prob computation for single objective case
|
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
|
23686a0f09
|
reward bounded cumulative reward formulas + fixes for dimensions that do not need memory
|
8 years ago |
dehnert
|
55c787e0d8
|
proper EC elimination in hybrid helper
|
8 years ago |
|
dehnert
|
e557a8e069
|
started on EC elimination for hybrid engine
|
8 years ago |
|
TimQu
|
b788c1b403
|
reuse scheduler from previous epoch as initial hint
|
8 years ago |
|
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 |
|
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
|
52d729b1c7
|
upper bounds computation for reachability rewards in sparse MDPs
|
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 |
|
dehnert
|
cb849a9ab8
|
started on computing upper bounds for rewards for interval value iteration
|
8 years ago |
|
dehnert
|
df0b5fbfa5
|
fixed multiply-reduce operations in the presence of empty row groups
|
8 years ago |
|
dehnert
|
d25cc4b05f
|
first version of sound value iteration
|
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
|
47ab74a16b
|
implemented single objective queries
|
8 years ago |
|
dehnert
|
9d95d2adcf
|
first version of multiply-and-reduce (only for native)
|
8 years ago |
|
dehnert
|
3c844a487f
|
some more optimizations
|
8 years ago |
|
dehnert
|
5fafe835cb
|
started on some optimizations for conditionals in MDPs
|
8 years ago |
|
dehnert
|
7c24607427
|
started on symbolic solver requirements
|
8 years ago |
|
dehnert
|
e81d979d56
|
hybrid MDP helper respecting solver requirements
|
8 years ago |
|
dehnert
|
a3cbaedcc1
|
intermediate commit to switch workplace
|
8 years ago |
|
dehnert
|
12b10af672
|
started on hybrid MDP helper respecting solver requirements
|
8 years ago |
|
dehnert
|
4c5cdfeafc
|
Sparse MDP helper now also respects solver requirements for reachability rewards
|
8 years ago |
|
dehnert
|
74eeaa7f81
|
computing unbounded until on MDPs with the sparse helper now respects solver requirements
|
8 years ago |
|
dehnert
|
569b0122b8
|
introduced different minmax equation system types for requirement retrieval
|
8 years ago |
|
dehnert
|
4adee85fa5
|
added checking requirements of MinMax solvers to model checker helpers
|
8 years ago |
|
TimQu
|
9ca14a54fc
|
templated the LpSolvers
|
8 years ago |
|
TimQu
|
25843ee53b
|
added setting 'lramethod'
|
8 years ago |
|
TimQu
|
5b10b027fc
|
implemented VI based Long-run-average method for MDPs
|
8 years ago |
|
dehnert
|
f5ba5204c9
|
adding some debug functionality to DdManager to corner dynamic reordering issue with CUDD
|
8 years ago |
|
TimQu
|
aebe9fa3c3
|
LP-based long run average rewards for MDPs
|
8 years ago |
|
TimQu
|
2f49255db6
|
Improved storage::Scheduler. We can now consider arbitrary finite memory schedulers, potentially employing randomization.
|
8 years ago |
|
TimQu
|
8a7609fb83
|
fixed Rmin computation with exact sparse engine when very high rewards occur
|
8 years ago |
