TimQu
|
776ce4c8bb
|
Checking requirements of a linear equation solver now depends on whether we want to do multiplication or equation solving. This was necessary to get the correct requirements of a MinMaxSolver that only uses the underlying linear equation solver for multiplication.
|
8 years ago |
|
TimQu
|
bb63ac6089
|
Linear equation solver + game solvers now respect the environment as well
|
8 years ago |
|
TimQu
|
6d23c79737
|
Making libstorm compile again
|
8 years ago |
|
TimQu
|
fd8c99b989
|
Introducing Environment in MinMaxSolvers and ModelCheckers
|
8 years ago |
|
TimQu
|
17d6835477
|
removed acyclic minmax method as it is not much better then gauss-seidel style multiplications
|
8 years ago |
|
TimQu
|
d85a845b7d
|
Fixed cases where a solver guarantee was not established although it was needed by the termination condition
|
8 years ago |
|
TimQu
|
33585c811f
|
MinMax Solver requirements now respect whether the solution is known to be unique or not.
|
8 years ago |
|
TimQu
|
5071df5c82
|
made sound value iteration work and respect the correct precision
|
8 years ago |
dehnert
|
da02237769
|
work towards symbolic rational search
|
8 years ago |
|
dehnert
|
58ca07584d
|
rational search for native linear equation solver and several involved fixes
|
8 years ago |
|
dehnert
|
afd2acd06b
|
more work on Kwek-Mehlhorn approach
|
8 years ago |
|
dehnert
|
254bc05e94
|
more work on RationalSearch
|
8 years ago |
|
dehnert
|
088c2d8b15
|
fixed missing suffix
|
8 years ago |
|
dehnert
|
b3f0aa511e
|
started on Kwek-Mehlhorn-based exact value computation
|
8 years ago |
|
dehnert
|
7f56c82523
|
moved to providing solve goals in sparse model checkers and helpers
|
8 years ago |
|
dehnert
|
d25cc4b05f
|
first version of sound value iteration
|
8 years ago |
|
dehnert
|
00f88ed452
|
gauss-seidel-style value iteration
|
8 years ago |
|
dehnert
|
9d95d2adcf
|
first version of multiply-and-reduce (only for native)
|
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
|
3829b58e0d
|
introduced top-level solve equations function to centrally check for requirements
|
8 years ago |
|
dehnert
|
72234e96b2
|
started on requirements for MinMax solvers
|
8 years ago |
|
dehnert
|
e278c3ef69
|
moving from internal reference to pointer in StandardMinMax solver
equipped MinMax solvers with default constructors
|
8 years ago |
|
dehnert
|
8cdbf281fa
|
make minmax solvers use policy iteration when --exact is set and no other method was explicitly set
|
8 years ago |
|
TimQu
|
499b25c3ea
|
removed methods 'getPrecision' and 'getRelative' from the abstract MinMax solver interface. Not every solver needs these methods.
|
8 years ago |
|
TimQu
|
39549f6ebd
|
Moved some functionality of StandardMinMaxSolver into a subclass
|
8 years ago |
