dehnert
|
74eeaa7f81
|
computing unbounded until on MDPs with the sparse helper now respects solver requirements
|
9 years ago |
TimQu
|
40edc0ca4d
|
assert that there are no endcomponents with positive rewards
|
9 years ago |
TimQu
|
529526593b
|
improved structure in rewardunfolding
|
9 years ago |
TimQu
|
de1e9967a3
|
added some necessary conditions for the rewardbounded weight vector checker
|
9 years ago |
TimQu
|
0cca4a51d0
|
added weight vector checker for reward bounded objectives
|
9 years ago |
TimQu
|
721dd37a62
|
Moved reduction of the preprocessed model into the weightvectorchecker
|
9 years ago |
TimQu
|
4d248eb0a1
|
fixed assertion
|
9 years ago |
TimQu
|
8efccd76d2
|
started to make multi-objective preprocessing more flexible w.r.t. different checkers
|
9 years ago |
dehnert
|
569b0122b8
|
introduced different minmax equation system types for requirement retrieval
|
9 years ago |
dehnert
|
4adee85fa5
|
added checking requirements of MinMax solvers to model checker helpers
|
9 years ago |
TimQu
|
31af523ea1
|
implemented caching of the EC elimination result in the standard weight vector checker
|
9 years ago |
TimQu
|
9716289f6a
|
Added abstract superclass for WeightVectorCheckers
|
9 years ago |
TimQu
|
e0253ecba2
|
fixed new test
|
9 years ago |
dehnert
|
beb80cc5af
|
fixes issue #11 raised by Joachim Klein
|
9 years ago |
TimQu
|
e2ba3dbd06
|
fix for multiple subobjectives
|
9 years ago |
dehnert
|
722cb3109c
|
dd quotient extraction of reward models in dd bisimulation
|
9 years ago |
TimQu
|
27ac2798c4
|
allowing multi(...) path formulas in multiobjective model checking
|
9 years ago |
TimQu
|
5dd4bdbfc6
|
fixed ambiguous memory labeling
|
9 years ago |
TimQu
|
0e8049d4df
|
removed lots of debug output
|
9 years ago |
TimQu
|
354b3103f0
|
improved multi-dimensional reward unfolding
|
9 years ago |
TimQu
|
2eb13cdc10
|
fixed exploration of reachable epochs
|
9 years ago |
TimQu
|
df6ba12c74
|
enabled handling of reward bounded formulas within multi-objective formulas
|
9 years ago |
TimQu
|
9e2f8fb1a8
|
first version of weight-vector based apporach with reward bounded objectives
|
9 years ago |
TimQu
|
cf4ee1eb5f
|
also store the initial states within an epoch model
|
9 years ago |
TimQu
|
6334168fbe
|
also store the reward choices in the epoch model
|
9 years ago |
TimQu
|
3c5a270482
|
Further improvements for the multi dimensional reward unfolding
|
9 years ago |
TimQu
|
22e375bd79
|
Implemented more functionality of the reward unfolding
|
9 years ago |
TimQu
|
9ca14a54fc
|
templated the LpSolvers
|
9 years ago |
TimQu
|
25843ee53b
|
added setting 'lramethod'
|
9 years ago |
TimQu
|
5b10b027fc
|
implemented VI based Long-run-average method for MDPs
|
9 years ago |
TimQu
|
bae41009a2
|
LRA method for MAs can now be switched to LP-based method
|
9 years ago |
dehnert
|
f5ba5204c9
|
adding some debug functionality to DdManager to corner dynamic reordering issue with CUDD
|
9 years ago |
TimQu
|
aebe9fa3c3
|
LP-based long run average rewards for MDPs
|
9 years ago |
TimQu
|
fb6aa69750
|
started building the model for a given epoch
|
9 years ago |
dehnert
|
3bf40471b4
|
small fixes in matrix builder and removal of debug output
|
9 years ago |
TimQu
|
fffb9207d7
|
implemented basic functionality of the multi-dimensional reward unfolding
|
9 years ago |
dehnert
|
52b07a0c2f
|
fixed a bug in sparse matrix builder, fixed some tests
|
9 years ago |
dehnert
|
ad9008e0c1
|
fixing more warnings related to struct vs. class forward declarations
|
9 years ago |
TimQu
|
7c23aab43c
|
code skeleton for multi-dimensional reward unfolding
|
9 years ago |
TimQu
|
234b590bdf
|
Fixed #include
|
9 years ago |
TimQu
|
5b35927ecb
|
fix for some multi-objective queries
|
9 years ago |
TimQu
|
defcd7d5d7
|
Multi-objective model checking: adapted data structures to allow more general objectives
|
9 years ago |
TimQu
|
4251c9f525
|
added function to build a trivial memory structure
|
9 years ago |
TimQu
|
8aa2b57640
|
minor fix for multi-objective preprocessor
|
9 years ago |
TimQu
|
9bfb1fedc2
|
requiring that multi objective queries have a multi(..) formula at top level.
|
9 years ago |
TimQu
|
92f2f23603
|
initialization of some data for reward bounded objectives
|
9 years ago |
TimQu
|
0e88d711e8
|
Correctly handled reward bounded objectives in multi-objective preprocessing
|
9 years ago |
TimQu
|
5b868081f0
|
Fixed MA LRA computation for the case where the whole MA is a MEC
|
9 years ago |
dehnert
|
6471bfdcea
|
made cli output respect filters
|
9 years ago |
Sebastian Junges
|
3de51e28e5
|
towards reward-bounded properties
|
9 years ago |