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
|
b90e88c365
|
first version, seems to be working, need to check more
|
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 |
|
Timo Philipp Gros
|
fc28fd16d3
|
delete self loops for probabilistic states
|
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
|
33585c811f
|
MinMax Solver requirements now respect whether the solution is known to be unique or not.
|
8 years ago |
|
dehnert
|
b8120ed73a
|
Markov automaton model checker now clearing basic requirements
|
8 years ago |
|
dehnert
|
7f56c82523
|
moved to providing solve goals in sparse model checkers and helpers
|
8 years ago |
|
dehnert
|
ec61e110f2
|
introducing solver formats to enable linear equation solvers to take the fixed point rather than the equation system formulation
|
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
|
569b0122b8
|
introduced different minmax equation system types for requirement retrieval
|
8 years ago |
|
dehnert
|
4adee85fa5
|
added checking requirements of MinMax solvers to model checker helpers
|
8 years ago |
|
dehnert
|
722cb3109c
|
dd quotient extraction of reward models in dd bisimulation
|
8 years ago |
|
TimQu
|
9ca14a54fc
|
templated the LpSolvers
|
8 years ago |
|
TimQu
|
25843ee53b
|
added setting 'lramethod'
|
8 years ago |
|
TimQu
|
bae41009a2
|
LRA method for MAs can now be switched to LP-based method
|
8 years ago |
|
TimQu
|
aebe9fa3c3
|
LP-based long run average rewards for MDPs
|
8 years ago |
|
TimQu
|
9bfb1fedc2
|
requiring that multi objective queries have a multi(..) formula at top level.
|
8 years ago |
|
TimQu
|
5b868081f0
|
Fixed MA LRA computation for the case where the whole MA is a MEC
|
8 years ago |
Sebastian Junges
|
3de51e28e5
|
towards reward-bounded properties
|
8 years ago |
|
TimQu
|
1c9d888676
|
uint_fast64_t -> uint64_t
|
8 years ago |
|
TimQu
|
8da6a6e30e
|
reduced memory consumption of VI based LRA computation
|
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
|
75e4c229cb
|
minor fix for Long run average rewards for Markov automata
|
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
|
e2cfa54d5b
|
Fixed an issue when computing expected rewards of Markov Automata
|
8 years ago |
|
dehnert
|
ea02ea0838
|
started overhaul of cli/api
|
8 years ago |
|
TimQu
|
267768a5b6
|
enabled markov automata with rationals
|
9 years ago |
|
TimQu
|
aa4d2141c3
|
build infrastructure for switching between multi objective model checking methods
|
9 years ago |
|
dehnert
|
952776a057
|
hybrid engine working for rational numbers
|
9 years ago |
|
dehnert
|
b7170b3c3b
|
fixed two issues pointed out by Joachim Klein: spirit error message (superfluous tab) and wrong treatment of strict upper bounds in bounded until and cumulative reward properties
|
9 years ago |
|
TimQu
|
14e44e0165
|
removed old region model checker classes, implemented entry point for pla, solved different compilation issues
|
9 years ago |
|
dehnert
|
b3a02b6e8a
|
fix in sparse ctmc model checker: bounded until returned empty result in case there are no non-prob0-states
|
9 years ago |
|
TimQu
|
0bb1c5855e
|
fixed bug when computing expected reachability rewards on MAs
|
9 years ago |
|
dehnert
|
c5ba425e54
|
enabling exact reachability rewards for CTMCs
|
9 years ago |
|
dehnert
|
77bd6e4a44
|
fixed some model building issues
|
9 years ago |
|
dehnert
|
43354d0c20
|
bunch of fixes (prominently in prism -> jani conversion)
|
9 years ago |
|
dehnert
|
9e8d6eee90
|
fixed a bug when reducing state-action rewards to state rewards for CTMCs
|
9 years ago |
|
dehnert
|
09f90dbc9f
|
enabled long-run average rewards for dtmc/ctmcs (sparse/hybrid engines)
|
9 years ago |
