TimQu
|
0332935451
|
Supporting TimeOperatorFormulas for MDPs and DTMCs in Sparse, Hybrid, and Dd engine
|
7 years ago |
|
TimQu
|
b5566fa861
|
more on total reward formulas for mdps
|
7 years ago |
|
TimQu
|
c2dd57cda5
|
total rewards for mdps
|
7 years ago |
|
TimQu
|
3310f51857
|
allowed for more fine grained solver requirements
|
7 years ago |
dehnert
|
acf297a811
|
fixing precision issue in sanity check and silencing min-max solver a bit
|
7 years ago |
|
TimQu
|
51884895c8
|
Removed linear equation solver factories in model checkers
|
7 years ago |
|
TimQu
|
56061c0bfa
|
Using multiplier in MDP Model checker helpers
|
7 years ago |
Matthias Volk
|
63a9f3a5ca
|
Fixed assertion by incorporating precision
|
7 years ago |
sjunges
|
7660a6c9f8
|
dont check != 0 in templated code
|
8 years ago |
|
TimQu
|
a1c10cac37
|
filtering reward zero states for MDPs
|
8 years ago |
|
TimQu
|
a2bd1e0026
|
renamed argument from getRequirements so that it is easier to understand
|
8 years ago |
|
TimQu
|
c59d2160ee
|
Implemented (multi-dimensional) cost bounded properties for DTMCs (sparse engine only)
|
8 years ago |
|
TimQu
|
149fc2e009
|
The solution to the minmax equation system becomes unique after eliminating end components.
|
8 years ago |
|
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
|
9771658dcc
|
only do end component elimination in MDP model checking if there are end components
|
8 years ago |
|
TimQu
|
42cea9c688
|
better subenvironments
|
8 years ago |
|
TimQu
|
6d23c79737
|
Making libstorm compile again
|
8 years ago |
|
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 |
