TimQu
|
3898931540
|
Some sanity checks regarding linear equation solver requirements
|
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
|
e09cb86001
|
making sure that the default linear equation solver is not switched to native if we check e.g. an MDP with sound value iteration
|
8 years ago |
|
TimQu
|
1174454ffb
|
Computing upper reward bounds in hybrid dtmc checker
|
8 years ago |
|
TimQu
|
bb63ac6089
|
Linear equation solver + game solvers now respect the environment as well
|
8 years ago |
Joachim Klein
|
f56076aacf
|
Add virtual destructors to classes having virtual functions.
(Silences warnings from -Wdelete-non-virtual-dtor -Wnon-virtual-dtor)
|
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
|
a2716ed85b
|
environment in multi-objective model checking methods
|
8 years ago |
|
TimQu
|
fd8c99b989
|
Introducing Environment in MinMaxSolvers and ModelCheckers
|
8 years ago |
|
TimQu
|
31ba64f018
|
bugfixes
|
8 years ago |
|
TimQu
|
ccf7521250
|
Multi-dimensional cumulative reward formulas
|
8 years ago |
|
TimQu
|
d9e62a66cc
|
cdf export for single objective formulas
|
8 years ago |
dehnert
|
330dfb96c7
|
more work on abstraction-refinement framework
|
8 years ago |
|
dehnert
|
29903bef04
|
more work on general abstraction refinement framework
|
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 |
|
dehnert
|
e6f61fb441
|
fixed bug in hybrid engine when using interval iteration
|
8 years ago |
|
TimQu
|
33585c811f
|
MinMax Solver requirements now respect whether the solution is known to be unique or not.
|
8 years ago |
|
dehnert
|
9498705c95
|
more reuse of values in bisimulation-based abstraction refinement
|
8 years ago |
|
dehnert
|
4fad33b5e8
|
started on optimizing bisimulation-based abstraction-refinement
|
8 years ago |
|
dehnert
|
41828ca27d
|
more work on bisimulation-based abstraction-refinement
|
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 |
|
dehnert
|
4d7770aea6
|
fixed issue in hybrid reachability reward computation that caused empty row groups
|
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
|
f2e581b3df
|
rational search for symbolic linear equation solvers
|
8 years ago |
|
dehnert
|
086201ac43
|
corrected some output and adapted requirements of symbolic minmax solver
|
8 years ago |
|
dehnert
|
55c787e0d8
|
proper EC elimination in hybrid helper
|
8 years ago |
|
dehnert
|
694e6ba240
|
EC elimination for Pmax for hybrid MDP model checker
|
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
|
cb15db041c
|
add missing include
|
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
|
51e64b8ebd
|
started on Baier-style 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 |
