dehnert
b94e978843
another round of fixes
Former-commit-id: 67f4e4be47
10 years ago
dehnert
dc2735b6ff
moved some template parameters from class scope to function scope
Former-commit-id: 668453f7f3
10 years ago
sjunges
f85d28325e
Further work towards faster and more modular compilation
Former-commit-id: 9de50910b8
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
dehnert
dcd42d5653
started reworking reward models
Former-commit-id: 49d9106451
10 years ago
dehnert
a1dae8849e
Reworked (sparse) model files: moved them into their own namespace and deleted some functionality that is never used and not that nicely implemented.
Former-commit-id: d4e6df30b5
10 years ago
dehnert
51becda4b3
Commit to switch workplace.
Former-commit-id: da5fac08cf
11 years ago
dehnert
94902388c7
Some minor changes, still doesn't compile.
Former-commit-id: cfc613fd8e
11 years ago
dehnert
0e87ccac9d
Tried to pave the way for generic blocks for decompositions, but I don't know whether this is the way to go.
Former-commit-id: 4a7b51f33c
11 years ago
dehnert
8f7c9d5c25
Adapted SCC-interface such that it can also be given a matrix instead of a model. More work on SCC-based mc.
Former-commit-id: 21d2482e4c
11 years ago
dehnert
d40573640f
Dropped our current Tarjan-implementation in favour of the path-based algorithm by Gabow (and others) as this seems to perform a lot better (at when comparing our implementations).
Former-commit-id: 5cfeb85193
11 years ago
PBerger
57b6208eee
Added a pseudo model which can be constructed from only a matrix to look and behave like a model for use in Decomposition classes
Former-commit-id: f8fdc5a9b6
11 years ago
dehnert
f32853b6aa
Beautified remaining storage classes a bit.
Former-commit-id: 93f272727f
12 years ago
dehnert
35d16a1191
Replaced VectorSet bei boost::container::flat_set, which does essentially the same. Fixed a bug in sparse matrix creation.
Former-commit-id: cb632bcfd4
12 years ago
dehnert
101c39f365
Added correct detection of states that possess infinite exptected time to reach a given goal set.
Former-commit-id: 4bc605d89d
12 years ago
dehnert
f287b7e760
Further steps towards implementation of MEC decomposition.
Former-commit-id: 8166b3b923
12 years ago
masawei
c30d6d307e
Figured out how to explicitly instantiate templates.
But got bitten by std::vector<bool> as it is specialized and uses bitsets (i.e. integers) internally.
Less memory but at the cost of 'oh, sorry std::vector<bool> does not return a bool&'.
That again seems to be a problem for the SparseMatrix<bool> instatiation since for instance getValue returns a T&.
On the one hand I don't quite know why this was never an issue before and on the other hand it prevents successful compilation.
So there are different ways to settle this:
- Specialize SparseMatix for bool -> possibly lots of code, but might be the best solution
- Write a wrapper for std::vector that uses chars instead of booleans
- Dont't use SparseMatrix<bool>
Next up: Figure out the best solution for this and implement it.
Former-commit-id: 83b9cfd06e
12 years ago
dehnert
09f192b40f
Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata.
Former-commit-id: 4596ba71ec
12 years ago