TimQu
|
a2bd1e0026
|
renamed argument from getRequirements so that it is easier to understand
|
7 years ago |
TimQu
|
285b2c71b9
|
renamed some files/classes
|
8 years ago |
TimQu
|
776ce4c8bb
|
Checking requirements of a linear equation solver now depends on whether we want to do multiplication or equation solving. This was necessary to get the correct requirements of a MinMaxSolver that only uses the underlying linear equation solver for multiplication.
|
8 years ago |
TimQu
|
bb63ac6089
|
Linear equation solver + game solvers now respect the environment as well
|
8 years ago |
TimQu
|
a2716ed85b
|
environment in multi-objective model checking methods
|
8 years ago |
TimQu
|
ccf7521250
|
Multi-dimensional cumulative reward formulas
|
8 years ago |
TimQu
|
fb21ffca63
|
Respected whether the linear equation solver wants the fix point or eq sys formulation
|
8 years ago |
TimQu
|
64ca58494d
|
considered solver requirements for multiobjective model checking
|
8 years ago |
dehnert
|
00f88ed452
|
gauss-seidel-style value iteration
|
8 years ago |
TimQu
|
721dd37a62
|
Moved reduction of the preprocessed model into the weightvectorchecker
|
8 years ago |
TimQu
|
defcd7d5d7
|
Multi-objective model checking: adapted data structures to allow more general objectives
|
8 years ago |
TimQu
|
0e88d711e8
|
Correctly handled reward bounded objectives in multi-objective preprocessing
|
8 years ago |
TimQu
|
2f49255db6
|
Improved storage::Scheduler. We can now consider arbitrary finite memory schedulers, potentially employing randomization.
|
8 years ago |
dehnert
|
ea02ea0838
|
started overhaul of cli/api
|
8 years ago |
TimQu
|
4413afb542
|
used new helper functions at some points in the code
|
8 years ago |
TimQu
|
267768a5b6
|
enabled markov automata with rationals
|
8 years ago |
TimQu
|
1649d47d66
|
Renamed lower/upper bounds to under/over approximation in weightVectorCheckers
|
8 years ago |
TimQu
|
7dd5c9e2c5
|
actually fixed the issue with timed reachability
|
8 years ago |
TimQu
|
c2f21e007e
|
fix that correctly sets the lower and upper bounds for multi-objective timed reachability
|
8 years ago |
TimQu
|
725e0e12e7
|
replaced old pcaa preprocessor with the refactored preprocessor.
|
8 years ago |
TimQu
|
b7aaf1957e
|
Replaced the StateDuplicator with the new memory structure product
|
8 years ago |
TimQu
|
2e01c8b137
|
Fixed time bounds containing constant variables for multi objective formulas.
|
8 years ago |
TimQu
|
e70f7716fe
|
Fixed minor pcaa bugs that were introduced due to recent changes
|
8 years ago |
TimQu
|
bfbd96a0e6
|
added some output for benchmarking
|
8 years ago |
TimQu
|
c1063f27cc
|
added a few more tests for multi-objective MAs. Also fixed/improved minor stuff.
|
8 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 |
TimQu
|
53ff482947
|
Caching of solvers can now be enabled/disabled
Former-commit-id: 498622f45c [formerly 1713f554a0 ]
Former-commit-id: 1015c7fef8
|
9 years ago |
TimQu
|
48b82e7b14
|
refactored auxData in linear equation solvers
Former-commit-id: 9e0deb255c
|
9 years ago |
TimQu
|
965d5b5e75
|
changed handling of auxiliary memory in MinMaxSolver
Former-commit-id: 602833f39d
|
9 years ago |
TimQu
|
8c31019bd5
|
improved selection of digitization constant
Former-commit-id: 72306b1879
|
9 years ago |
TimQu
|
ea2315e903
|
restructured code for pcaa implementation
Former-commit-id: cfadf06611
|
9 years ago |
TimQu
|
4e26b60b78
|
More cleanup
Former-commit-id: c532688514
|
9 years ago |
TimQu
|
71e181bd93
|
some quick and dirty optimizations (that need to be reviewed)
Former-commit-id: 86fbc66c90
|
9 years ago |
TimQu
|
e1aca37c86
|
some minor tweaks plus polling example
Former-commit-id: eebe4ca6d6
|
9 years ago |
TimQu
|
bf7a86b650
|
fixed lower time bounds for MAs
Former-commit-id: 98ca60c52c
|
9 years ago |
TimQu
|
1525ea6702
|
better time bounds
Former-commit-id: 57140de514
|
9 years ago |
TimQu
|
b267394a2c
|
fixed the case where an objective is satisfied at the initial state.
correctly added support for lower time bounds
Former-commit-id: 4d13d5de1b
|
9 years ago |
TimQu
|
7bab48b59b
|
bounded reachability for MAs
Former-commit-id: 982277d9ab
|
9 years ago |
TimQu
|
90ae65ffa9
|
computation of digitization constant
Former-commit-id: cd75d84566
|
9 years ago |
TimQu
|
75dd78ebec
|
towards bounded reachability: added the ability to have a lower/upper bound for the weightVectorChecker result
Former-commit-id: 413c2dee0a
|
9 years ago |
TimQu
|
8cda785414
|
fix in assertions
Former-commit-id: feb2ef1d0e
|
9 years ago |
TimQu
|
0f0c21840f
|
correct handling of state rewards of markovian states
Former-commit-id: 9dc50559fc
|
9 years ago |
TimQu
|
0e34bdbfc4
|
split weight vector checker into one for MDPs and one for MAs
Former-commit-id: 142a151f3c
|
9 years ago |