TimQu
|
9735ff98d0
|
SolutionType is now a single vector instead of a struct
|
8 years ago |
|
TimQu
|
d6099a91a7
|
Further optimizations for setEpoch + started to work on single objective mode
|
8 years ago |
|
TimQu
|
57e604a815
|
optimized setCurrentEpoch a little
|
8 years ago |
|
TimQu
|
e4ac32a6fc
|
fixed selection of considered state in reduced model and optimized setting the stepsolutions
|
8 years ago |
|
TimQu
|
11fc1d29eb
|
more output for statistics
|
8 years ago |
|
TimQu
|
1bb8b3b497
|
only store the results that will be needed eventually
|
8 years ago |
|
TimQu
|
62e4558af1
|
reduced number of states considered in the epoch model
|
8 years ago |
|
TimQu
|
8e56efed3a
|
reduced the number of states in the product model
|
8 years ago |
|
TimQu
|
999fd0752c
|
The model memory product can now retrieve the reachable states without actually building the product
|
8 years ago |
|
TimQu
|
11a4f8d016
|
restructured initialization of modelmemory product
|
8 years ago |
|
TimQu
|
90a7ea4907
|
printing timing information
|
8 years ago |
|
TimQu
|
61a6b178b7
|
restricted the number of reachable product states
|
8 years ago |
|
TimQu
|
40edc0ca4d
|
assert that there are no endcomponents with positive rewards
|
8 years ago |
|
TimQu
|
529526593b
|
improved structure in rewardunfolding
|
8 years ago |
|
TimQu
|
de1e9967a3
|
added some necessary conditions for the rewardbounded weight vector checker
|
8 years ago |
|
TimQu
|
0cca4a51d0
|
added weight vector checker for reward bounded objectives
|
8 years ago |
|
TimQu
|
721dd37a62
|
Moved reduction of the preprocessed model into the weightvectorchecker
|
8 years ago |
|
TimQu
|
4d248eb0a1
|
fixed assertion
|
8 years ago |
|
TimQu
|
8efccd76d2
|
started to make multi-objective preprocessing more flexible w.r.t. different checkers
|
8 years ago |
|
TimQu
|
31af523ea1
|
implemented caching of the EC elimination result in the standard weight vector checker
|
8 years ago |
|
TimQu
|
9716289f6a
|
Added abstract superclass for WeightVectorCheckers
|
8 years ago |
|
TimQu
|
e0253ecba2
|
fixed new test
|
8 years ago |
|
TimQu
|
e2ba3dbd06
|
fix for multiple subobjectives
|
8 years ago |
|
TimQu
|
27ac2798c4
|
allowing multi(...) path formulas in multiobjective model checking
|
8 years ago |
|
TimQu
|
5dd4bdbfc6
|
fixed ambiguous memory labeling
|
8 years ago |
|
TimQu
|
0e8049d4df
|
removed lots of debug output
|
8 years ago |
|
TimQu
|
354b3103f0
|
improved multi-dimensional reward unfolding
|
8 years ago |
|
TimQu
|
2eb13cdc10
|
fixed exploration of reachable epochs
|
8 years ago |
|
TimQu
|
9e2f8fb1a8
|
first version of weight-vector based apporach with reward bounded objectives
|
8 years ago |
|
TimQu
|
cf4ee1eb5f
|
also store the initial states within an epoch model
|
8 years ago |
|
TimQu
|
6334168fbe
|
also store the reward choices in the epoch model
|
8 years ago |
|
TimQu
|
3c5a270482
|
Further improvements for the multi dimensional reward unfolding
|
8 years ago |
|
TimQu
|
22e375bd79
|
Implemented more functionality of the reward unfolding
|
8 years ago |
|
TimQu
|
fb6aa69750
|
started building the model for a given epoch
|
8 years ago |
|
TimQu
|
fffb9207d7
|
implemented basic functionality of the multi-dimensional reward unfolding
|
8 years ago |
|
TimQu
|
7c23aab43c
|
code skeleton for multi-dimensional reward unfolding
|
8 years ago |
|
TimQu
|
234b590bdf
|
Fixed #include
|
8 years ago |
|
TimQu
|
5b35927ecb
|
fix for some multi-objective queries
|
8 years ago |
|
TimQu
|
defcd7d5d7
|
Multi-objective model checking: adapted data structures to allow more general objectives
|
8 years ago |
|
TimQu
|
4251c9f525
|
added function to build a trivial memory structure
|
8 years ago |
|
TimQu
|
8aa2b57640
|
minor fix for multi-objective preprocessor
|
8 years ago |
|
TimQu
|
92f2f23603
|
initialization of some data for reward bounded objectives
|
8 years ago |
|
TimQu
|
0e88d711e8
|
Correctly handled reward bounded objectives in multi-objective preprocessing
|
8 years ago |
Sebastian Junges
|
3de51e28e5
|
towards reward-bounded properties
|
8 years ago |
|
TimQu
|
2f49255db6
|
Improved storage::Scheduler. We can now consider arbitrary finite memory schedulers, potentially employing randomization.
|
8 years ago |
|
TimQu
|
16041bc936
|
Improved memory structure so that a memory update is triggered based on the transition that was taken (and not only the state that was reached)
|
8 years ago |
dehnert
|
ea02ea0838
|
started overhaul of cli/api
|
8 years ago |
TimQu
|
a8e877d016
|
fixed capitalization.
|
8 years ago |
|
TimQu
|
1d329176ba
|
Resolved compiling issues due to recent merge
|
8 years ago |
|
TimQu
|
dc079b3196
|
moved a function to graph.h
|
8 years ago |
