TimQu
|
50ba6866eb
|
checking solver requirements for PLA
|
7 years ago |
cdehnert
|
a8d32eb0be
|
Merge pull request #8 from kleinj/cmake-old-carl-fix
cmake for carl: handle missing carl version information
|
7 years ago |
|
cdehnert
|
93a3bff8e0
|
Merge branch 'master' into cmake-old-carl-fix
|
7 years ago |
dehnert
|
df05711f3e
|
finished rational search for MinMax solver, preparing rational search for NativeLinearEquationSolver
|
7 years ago |
|
dehnert
|
0c8866203c
|
tracking bugs, lots of debug output
|
7 years ago |
|
TimQu
|
c396ab0ca5
|
more solver requirements for multi-objective model checking
|
7 years ago |
|
TimQu
|
d58f751491
|
Merge branch 'master' into reward-bounded-multi-objective
|
7 years ago |
|
TimQu
|
64ca58494d
|
considered solver requirements for multiobjective model checking
|
7 years ago |
|
dehnert
|
afd2acd06b
|
more work on Kwek-Mehlhorn approach
|
7 years ago |
|
TimQu
|
4afaca7f84
|
fixed missing return statements
|
7 years ago |
|
TimQu
|
3f6464c59d
|
Enforce no end components when we want to compute a scheduler from a minmax equation system
|
7 years ago |
|
TimQu
|
4991a3ec5e
|
checking solver requirements for PLA
|
7 years ago |
|
TimQu
|
b3349dc344
|
fixed fill() method of bit vectors
|
7 years ago |
|
TimQu
|
4a66ab2e57
|
Merge branch 'master' into reward-bounded-multi-objective
|
7 years ago |
|
dehnert
|
254bc05e94
|
more work on RationalSearch
|
7 years ago |
|
dehnert
|
088c2d8b15
|
fixed missing suffix
|
7 years ago |
|
dehnert
|
b3f0aa511e
|
started on Kwek-Mehlhorn-based exact value computation
|
7 years ago |
|
dehnert
|
cb15db041c
|
add missing include
|
7 years ago |
|
dehnert
|
76fa67fd35
|
added missing include
|
7 years ago |
|
dehnert
|
c84a84cba4
|
corrected ms to s
|
7 years ago |
|
dehnert
|
20afe3d48b
|
Merge branch 'master' into conditional_optimizations
|
7 years ago |
|
dehnert
|
2d41de479e
|
added progress outputs to iterative solvers
|
7 years ago |
|
TimQu
|
4e79e8715b
|
Merge branch 'master' into pomdp_datastructures
|
7 years ago |
|
TimQu
|
142d034765
|
New methods for the SparseMatrix: SetRowGroupIndices and filterEntries
|
7 years ago |
|
TimQu
|
88339f4cff
|
invoking new functionalities in the cli. Also silenced some debug output
|
7 years ago |
|
TimQu
|
1d1a198f5e
|
generalizing the Selfloop elimination ideo to MECs
|
7 years ago |
|
TimQu
|
412ecbcd36
|
Qualitative analysis of pomdps
|
7 years ago |
|
dehnert
|
d8d3404b87
|
fixed termination criteria and equipped interval value iteration methods with check whether the method converged for the relevant states
|
7 years ago |
|
dehnert
|
7f56c82523
|
moved to providing solve goals in sparse model checkers and helpers
|
7 years ago |
hbruintjes
|
904e49dab3
|
Fix wrong type
|
7 years ago |
|
dehnert
|
e7b6587170
|
minor fixes for new relative convergence test
|
7 years ago |
|
dehnert
|
e719a37c6c
|
fixes related to relative termination criterion
|
7 years ago |
|
dehnert
|
99832d2694
|
only expanding epsilon in sound power methods when the absolute convergence criterion is used
|
7 years ago |
|
dehnert
|
c5884a27b4
|
fixed termination condition applications in a number of spots, fixed uint64 vs uint64_t issue
|
7 years ago |
|
dehnert
|
4fd472fdd6
|
added difference heuristic to sound VI in MinMax solver
|
7 years ago |
|
dehnert
|
c8e19d2e44
|
fixed priority queue implementation and upper reward bound computation
|
7 years ago |
|
dehnert
|
51e64b8ebd
|
started on Baier-style upper reward bound computation
|
7 years ago |
|
dehnert
|
52d729b1c7
|
upper bounds computation for reachability rewards in sparse MDPs
|
7 years ago |
|
TimQu
|
fcd277c42a
|
added an option that enables building of state valuations. Also include the state valuations when the model is exported to .dot format
|
7 years ago |
|
TimQu
|
9039323fa9
|
optimized setting the epoch class
|
7 years ago |
|
dehnert
|
68f14c728a
|
added missing check for existence of model
|
7 years ago |
|
dehnert
|
b4a0016362
|
zero-reward MEC elimination for reachability rewards
|
7 years ago |
|
dehnert
|
fe8c3820fd
|
started cleanup of reachability rewards in sparse MDP helper
|
7 years ago |
|
dehnert
|
e5572db54e
|
eliminating ECs for sound value iteration for until probabilities
|
7 years ago |
|
dehnert
|
b4bfd0c39f
|
performance improvement in DS-MPI; some cleanups
|
7 years ago |
|
TimQu
|
630acb7459
|
parsing of until formulas with multiple bounds
|
7 years ago |
|
TimQu
|
36c3a4d9ef
|
Avoided conversion of memory states. They are now directly represented as 64 bit integers
|
7 years ago |
|
dehnert
|
19ac4a360f
|
intermediate commit
|
7 years ago |
|
TimQu
|
37d5dceaab
|
added small check
|
7 years ago |
|
TimQu
|
7fc65707a9
|
set the maximal value for each dimension. Also support for dependent dimensions
|
7 years ago |
