Timo Philipp Gros
|
ec41a5e661
|
reorganised and modulised storm
|
8 years ago |
Timo Philipp Gros
|
dd8ada13cd
|
creating solver only once
|
8 years ago |
Timo Philipp Gros
|
5ba296404a
|
not finished version of MDP approach
|
8 years ago |
Timo Philipp Gros
|
8421ff5c65
|
first try, cmake not building
|
8 years ago |
Timo Philipp Gros
|
dfda3a1544
|
cleaned up
|
8 years ago |
Timo Philipp Gros
|
286fc8aec7
|
fixed bugs, runnig now
|
8 years ago |
Timo Philipp Gros
|
253b34ce09
|
modularised diagonal-prob entrie delete and skipped zero loops in cycle identification
|
8 years ago |
Timo Philipp Gros
|
fe863679bf
|
identify probCycles outgoing states
|
8 years ago |
Timo Philipp Gros
|
250fc89bc6
|
new also supporting Pmin
|
8 years ago |
Timo Philipp Gros
|
25a7b6c71a
|
implemented trajans alg to identify prob Cycles
|
8 years ago |
dehnert
|
a6046ab0b3
|
fixed some warnings and issues and introduce cli switch to select IMCA or UnifPlus
|
8 years ago |
Timo Philipp Gros
|
54ab1c114e
|
first version of UnifPlus for MA
|
8 years ago |
TimQu
|
bae41009a2
|
LRA method for MAs can now be switched to LP-based method
|
8 years ago |
TimQu
|
1c9d888676
|
uint_fast64_t -> uint64_t
|
8 years ago |
TimQu
|
19925ac74d
|
implemented value iteration based Long run average rewards for Markov automata by Butkova et al. (TACAS 2017)
|
8 years ago |
TimQu
|
6151dc0e96
|
Enabled Long Run Average Rewards for MAs (LP based)
|
8 years ago |
TimQu
|
752af135cd
|
When computing expected rewards for Markov Automata, we now invoke the MDP implementation (instead of the rather inefficient MA implementation)
|
8 years ago |
TimQu
|
267768a5b6
|
enabled markov automata with rationals
|
8 years ago |
TimQu
|
0bb1c5855e
|
fixed bug when computing expected reachability rewards on MAs
|
9 years ago |
dehnert
|
136cb194d1
|
fixed a bunch of unused variable warnings
|
9 years ago |
Sebastian Junges
|
d246517757
|
removed src prefix in all includes
|
9 years ago |
Sebastian Junges
|
e1d201c85e
|
c++ code compiles again after rename
|
9 years ago |
Sebastian Junges
|
3a7ee7867b
|
rename files (does not compile)
|
9 years ago |
dehnert
|
b4e0cabef6
|
started working on general min-max solver that uses an underlying linear equation solver. provided necessary factories. adapted code and removed old min-max solvers
Former-commit-id: c1895472c7
|
9 years ago |
dehnert
|
5e1e5b55a1
|
renamed expected time formulas to time formulas
Former-commit-id: 50a11fe446
|
9 years ago |
Mavo
|
796d7652df
|
Fixed problem with bounds in MA model checker
Former-commit-id: c40c4e4795
|
9 years ago |
dehnert
|
645f130a62
|
introduced long-run average reward formula
Former-commit-id: 00fac9ad4b
|
10 years ago |
sjunges
|
8568ee3986
|
only one optimization direction enum -- towards integration of termination criterions on the model checker
Former-commit-id: 648855264e
|
10 years ago |
dehnert
|
f51e8eeaea
|
moved reward model template parameter from helper classes to the affected functions. this sadly excludes the SparseDtmcPrctlHelper for which clang then produces a segfault (bug report pending)
Former-commit-id: 8e9f0b29d4
|
10 years ago |
dehnert
|
8ff557cfad
|
more work on creating helpers for model checkers
Former-commit-id: 0c68ccaa41
|
10 years ago |