dehnert
|
4d7770aea6
|
fixed issue in hybrid reachability reward computation that caused empty row groups
|
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 |
dehnert
|
df05711f3e
|
finished rational search for MinMax solver, preparing rational search for NativeLinearEquationSolver
|
8 years ago |
dehnert
|
2d41de479e
|
added progress outputs to iterative solvers
|
8 years ago |
dehnert
|
d25cc4b05f
|
first version of sound value iteration
|
8 years ago |
dehnert
|
9d95d2adcf
|
first version of multiply-and-reduce (only for native)
|
8 years ago |
dehnert
|
7c24607427
|
started on symbolic solver requirements
|
8 years ago |
dehnert
|
e81d979d56
|
hybrid MDP helper respecting solver requirements
|
8 years ago |
dehnert
|
a3cbaedcc1
|
intermediate commit to switch workplace
|
8 years ago |
dehnert
|
12b10af672
|
started on hybrid MDP helper respecting solver requirements
|
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 |
TimQu
|
d5d0a5f44a
|
fixed a few issues related to having CLN numbers as storm::RationalNumber
|
8 years ago |
dehnert
|
952776a057
|
hybrid engine working for rational numbers
|
8 years ago |
dehnert
|
a2e29893f2
|
fixed a few bugs
|
8 years ago |
dehnert
|
61157cc1c5
|
add warning when computing minimal rewards on MDPs that reward values may be too low
|
8 years ago |
dehnert
|
b258f1e52d
|
some more warnings gone
|
9 years ago |
dehnert
|
8d6b029d67
|
next batch of fixing 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 |
sjunges
|
f7a3e02fb6
|
refactored model checkers st all are templated in the model, have to handle rational function bounds next
Former-commit-id: b665709a52
|
9 years ago |
dehnert
|
be5fdeb636
|
started working on internal auxiliary storage of solvers
Former-commit-id: d895041c50
|
9 years ago |
dehnert
|
95b95d9c64
|
fixed some minor issues and renamed equation solver methods slightly to make the names a bit more compact
Former-commit-id: de103e19ad
|
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
|
49f59052f8
|
made model checkers give up possession of matrix to solver when possible
Former-commit-id: 8d689470bd
|
9 years ago |
dehnert
|
f3701f66fb
|
bugfix for symbolic reachability reward computation
Former-commit-id: c197203539
|
9 years ago |
dehnert
|
756b2c5e30
|
added globally operator to functionality of hybrid/symbolic MDP model checkers
Former-commit-id: 2672333544
|
10 years ago |
sjunges
|
1e1400d68d
|
merge
Former-commit-id: eb9efc4bb2
|
10 years ago |
dehnert
|
0708672a68
|
removed ite for ADDs as this operation should be formed with a BDD as the first argument. as a compensation, we provide a version of ite that takes a BDD and two ADDs and returns the corresponding ADD
Former-commit-id: 720dc3a9c4
|
10 years ago |
dehnert
|
b7ea918d1b
|
update to latest version of sylvan and accompanying changes (mostly because 0 * inf = nan in IEEE754)
Former-commit-id: 828e13307f
|
10 years ago |
dehnert
|
f8fc39870a
|
hybrid and symbolic model checkers working with sylvan
Former-commit-id: d01b92e328
|
10 years ago |
dehnert
|
009dabf2f1
|
started cleanining up
Former-commit-id: 3db6fbc1b2
|
10 years ago |
dehnert
|
a258d1ab48
|
restructured ODD to be independent of the DD library being used
Former-commit-id: 83f08ba203
|
10 years ago |
dehnert
|
8bf0f3c87e
|
apparently, changing the DD interface implies some other changes as well...
Former-commit-id: c5cedc720f
|
10 years ago |
dehnert
|
4e86ef2e47
|
moved CUDD-based DD implementation to own folder
Former-commit-id: a828f92518
|
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 |
sjunges
|
35a154f67f
|
Splitted graph in h and cpp`
Former-commit-id: e22ab7f8eb
|
10 years ago |
dehnert
|
fbd05cd780
|
more and more bugfixes
Former-commit-id: 7f1ba98797
|
10 years ago |
dehnert
|
b3178e17f6
|
more bug fixes
Former-commit-id: 0b33b30efa
|
10 years ago |
dehnert
|
6133c3462a
|
symbolic models can now have several reward models, adapted reward generation in model builders, probably introduced quite some bugs
Former-commit-id: 1fae8bcf12
|
10 years ago |
dehnert
|
5beb33e3d8
|
merged a bit more
Former-commit-id: e42dc21233
|
10 years ago |
dehnert
|
9d138d86f7
|
further work on creating helper classes for model checking tasks
Former-commit-id: 12cd17fb26
|
10 years ago |
dehnert
|
b56766e993
|
more work on reward model that turned out to be refactoring in disguise
Former-commit-id: 31a7fa4801
|
10 years ago |